oj.uz

Submission #206179

# Submission time Handle Problem Language Result Execution time Memory
206179 2020-03-02T15:57:39 Z mraron Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 63096 KB 
#include<bits/stdc++.h>
using namespace std;
#define xx first
#define yy second
int n,m;
const int MAXN=30001;
const int lim=500;
int b[MAXN];
int p[MAXN];
int dst[MAXN][lim+1];
int kesz[MAXN];

vector<int> lst_small[MAXN];
vector<int> lst_big[MAXN];

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>m;
	for(int i=0;i<m;++i) {
		cin>>b[i]>>p[i];
		if(p[i]<=lim) lst_small[b[i]].push_back(p[i]);
		else lst_big[b[i]].push_back(p[i]);
	}
	
	for(int i=0;i<n;++i) {
		lst_small[b[i]].push_back(0);
		sort(lst_small[b[i]].begin(), lst_small[b[i]].end());
		lst_small[b[i]].resize(distance(lst_small[b[i]].begin(), unique(lst_small[b[i]].begin(), lst_small[b[i]].end())));
		
		sort(lst_big[b[i]].begin(), lst_big[b[i]].end());
		lst_big[b[i]].resize(distance(lst_big[b[i]].begin(), unique(lst_big[b[i]].begin(), lst_big[b[i]].end())));
	}
	for(int i=0;i<n;++i) {
		for(int j=0;j<=lim;++j) {
			dst[i][j]=1e9;
		}
	}
	
	dst[b[0]][0]=0;
	priority_queue<pair<int,pair<int,int>>, vector<pair<int,pair<int,int>>>, greater<pair<int,pair<int,int>>>> pq;
	pq.push({0, {b[0], 0}});
	while(!pq.empty()) {
		auto tp=pq.top();
		pq.pop();
		if(tp.xx>dst[tp.yy.xx][tp.yy.yy]) continue ;
		
		if(!kesz[tp.yy.xx]) {
			for(auto i:lst_small[tp.yy.xx]) {
				if(i<=lim) {
					if(tp.xx<dst[tp.yy.xx][i]) {
						dst[tp.yy.xx][i]=tp.xx;
						pq.push({dst[tp.yy.xx][i], {tp.yy.xx, i}});
					}
				}
			}

			for(auto i:lst_big[tp.yy.xx]) {
				for(int j=tp.yy.xx%i;j<n;j+=i) {
					int diff=abs(j-tp.yy.xx)/i;
					if(tp.xx+diff<dst[j][0]) {
						dst[j][0]=tp.xx+diff;
						pq.push({dst[j][0], {j,0}});
					}
				}
			}
		}
		kesz[tp.yy.xx]=1;
		
		if(tp.yy.xx-tp.yy.yy>=0 && tp.xx+1<dst[tp.yy.xx-tp.yy.yy][tp.yy.yy]) {
			dst[tp.yy.xx-tp.yy.yy][tp.yy.yy]=tp.xx+1;
			pq.push({dst[tp.yy.xx-tp.yy.yy][tp.yy.yy], {tp.yy.xx-tp.yy.yy, tp.yy.yy}});
		}
		
		if(tp.yy.xx+tp.yy.yy<n && tp.xx+1<dst[tp.yy.xx+tp.yy.yy][tp.yy.yy]) {
			dst[tp.yy.xx+tp.yy.yy][tp.yy.yy]=tp.xx+1;
			pq.push({dst[tp.yy.xx+tp.yy.yy][tp.yy.yy], {tp.yy.xx+tp.yy.yy, tp.yy.yy}});
		}
	}
	
	if(dst[b[1]][0]==1e9) cout<<-1;
	else cout<<dst[b[1]][0];
	cout<<"\n";
	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1784 KB Output is correct
2 Correct 6 ms 1784 KB Output is correct
3 Correct 6 ms 1784 KB Output is correct
4 Correct 6 ms 1784 KB Output is correct
5 Correct 6 ms 1784 KB Output is correct
6 Correct 5 ms 1784 KB Output is correct
7 Correct 6 ms 1784 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1788 KB Output is correct
2 Correct 6 ms 1784 KB Output is correct
3 Correct 6 ms 1784 KB Output is correct
4 Correct 5 ms 1784 KB Output is correct
5 Correct 6 ms 1784 KB Output is correct
6 Correct 6 ms 1784 KB Output is correct
7 Correct 6 ms 1784 KB Output is correct
8 Correct 6 ms 1912 KB Output is correct
9 Correct 6 ms 1916 KB Output is correct
10 Correct 6 ms 1912 KB Output is correct
11 Correct 7 ms 2040 KB Output is correct
12 Correct 6 ms 2040 KB Output is correct
13 Correct 6 ms 2040 KB Output is correct
14 Correct 7 ms 2040 KB Output is correct
15 Correct 7 ms 2040 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1784 KB Output is correct
2 Correct 6 ms 1784 KB Output is correct
3 Correct 6 ms 1784 KB Output is correct
4 Correct 6 ms 1784 KB Output is correct
5 Correct 6 ms 1784 KB Output is correct
6 Correct 6 ms 1784 KB Output is correct
7 Correct 5 ms 1784 KB Output is correct
8 Correct 6 ms 1784 KB Output is correct
9 Correct 6 ms 1912 KB Output is correct
10 Correct 6 ms 1912 KB Output is correct
11 Correct 7 ms 2040 KB Output is correct
12 Correct 6 ms 2040 KB Output is correct
13 Correct 6 ms 1932 KB Output is correct
14 Correct 7 ms 2040 KB Output is correct
15 Correct 7 ms 2040 KB Output is correct
16 Correct 6 ms 2168 KB Output is correct
17 Correct 9 ms 3320 KB Output is correct
18 Correct 8 ms 5240 KB Output is correct
19 Correct 9 ms 5880 KB Output is correct
20 Correct 9 ms 5752 KB Output is correct
21 Correct 6 ms 2552 KB Output is correct
22 Correct 8 ms 5368 KB Output is correct
23 Correct 9 ms 4984 KB Output is correct
24 Correct 10 ms 5624 KB Output is correct
25 Correct 9 ms 5752 KB Output is correct
26 Correct 9 ms 5748 KB Output is correct
27 Correct 11 ms 5752 KB Output is correct
28 Correct 10 ms 5880 KB Output is correct
29 Correct 16 ms 5752 KB Output is correct
30 Correct 10 ms 5752 KB Output is correct
31 Correct 12 ms 5752 KB Output is correct
32 Correct 10 ms 5752 KB Output is correct
33 Correct 26 ms 5752 KB Output is correct
34 Correct 25 ms 5752 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1784 KB Output is correct
2 Correct 6 ms 1784 KB Output is correct
3 Correct 6 ms 1784 KB Output is correct
4 Correct 7 ms 1784 KB Output is correct
5 Correct 6 ms 1784 KB Output is correct
6 Correct 5 ms 1784 KB Output is correct
7 Correct 6 ms 1784 KB Output is correct
8 Correct 6 ms 1784 KB Output is correct
9 Correct 6 ms 1912 KB Output is correct
10 Correct 6 ms 1912 KB Output is correct
11 Correct 7 ms 2040 KB Output is correct
12 Correct 6 ms 2040 KB Output is correct
13 Correct 6 ms 2040 KB Output is correct
14 Correct 7 ms 2040 KB Output is correct
15 Correct 7 ms 2040 KB Output is correct
16 Correct 6 ms 2168 KB Output is correct
17 Correct 9 ms 3320 KB Output is correct
18 Correct 8 ms 5240 KB Output is correct
19 Correct 8 ms 5756 KB Output is correct
20 Correct 9 ms 5752 KB Output is correct
21 Correct 6 ms 2552 KB Output is correct
22 Correct 8 ms 5240 KB Output is correct
23 Correct 10 ms 4984 KB Output is correct
24 Correct 10 ms 5624 KB Output is correct
25 Correct 10 ms 5880 KB Output is correct
26 Correct 9 ms 5752 KB Output is correct
27 Correct 11 ms 5784 KB Output is correct
28 Correct 10 ms 5880 KB Output is correct
29 Correct 16 ms 5752 KB Output is correct
30 Correct 10 ms 5752 KB Output is correct
31 Correct 13 ms 5884 KB Output is correct
32 Correct 11 ms 5752 KB Output is correct
33 Correct 25 ms 5752 KB Output is correct
34 Correct 24 ms 5752 KB Output is correct
35 Correct 27 ms 5368 KB Output is correct
36 Correct 10 ms 4088 KB Output is correct
37 Correct 40 ms 6328 KB Output is correct
38 Correct 37 ms 6600 KB Output is correct
39 Correct 37 ms 6584 KB Output is correct
40 Correct 38 ms 6584 KB Output is correct
41 Correct 37 ms 6584 KB Output is correct
42 Correct 15 ms 6264 KB Output is correct
43 Correct 17 ms 6264 KB Output is correct
44 Correct 14 ms 6264 KB Output is correct
45 Correct 106 ms 6712 KB Output is correct
46 Correct 102 ms 6712 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1784 KB Output is correct
2 Correct 6 ms 1784 KB Output is correct
3 Correct 5 ms 1788 KB Output is correct
4 Correct 6 ms 1784 KB Output is correct
5 Correct 6 ms 1784 KB Output is correct
6 Correct 6 ms 1784 KB Output is correct
7 Correct 6 ms 1784 KB Output is correct
8 Correct 5 ms 1784 KB Output is correct
9 Correct 6 ms 1912 KB Output is correct
10 Correct 6 ms 1912 KB Output is correct
11 Correct 7 ms 2040 KB Output is correct
12 Correct 6 ms 2040 KB Output is correct
13 Correct 6 ms 2040 KB Output is correct
14 Correct 7 ms 2040 KB Output is correct
15 Correct 7 ms 2040 KB Output is correct
16 Correct 6 ms 2168 KB Output is correct
17 Correct 9 ms 3320 KB Output is correct
18 Correct 8 ms 5240 KB Output is correct
19 Correct 8 ms 5752 KB Output is correct
20 Correct 9 ms 5752 KB Output is correct
21 Correct 6 ms 2552 KB Output is correct
22 Correct 8 ms 5240 KB Output is correct
23 Correct 9 ms 4984 KB Output is correct
24 Correct 10 ms 5624 KB Output is correct
25 Correct 9 ms 5752 KB Output is correct
26 Correct 10 ms 5752 KB Output is correct
27 Correct 12 ms 5752 KB Output is correct
28 Correct 10 ms 5884 KB Output is correct
29 Correct 16 ms 5752 KB Output is correct
30 Correct 10 ms 5752 KB Output is correct
31 Correct 12 ms 5752 KB Output is correct
32 Correct 11 ms 5752 KB Output is correct
33 Correct 25 ms 5752 KB Output is correct
34 Correct 25 ms 5752 KB Output is correct
35 Correct 27 ms 5368 KB Output is correct
36 Correct 10 ms 4088 KB Output is correct
37 Correct 40 ms 6328 KB Output is correct
38 Correct 37 ms 6648 KB Output is correct
39 Correct 36 ms 6648 KB Output is correct
40 Correct 36 ms 6584 KB Output is correct
41 Correct 38 ms 6648 KB Output is correct
42 Correct 14 ms 6264 KB Output is correct
43 Correct 17 ms 6264 KB Output is correct
44 Correct 14 ms 6264 KB Output is correct
45 Correct 103 ms 6712 KB Output is correct
46 Correct 104 ms 6712 KB Output is correct
47 Correct 152 ms 27448 KB Output is correct
48 Correct 44 ms 48504 KB Output is correct
49 Correct 46 ms 52728 KB Output is correct
50 Correct 45 ms 57464 KB Output is correct
51 Correct 104 ms 62520 KB Output is correct
52 Correct 113 ms 62520 KB Output is correct
53 Correct 63 ms 62200 KB Output is correct
54 Correct 41 ms 60664 KB Output is correct
55 Correct 43 ms 60664 KB Output is correct
56 Correct 54 ms 61944 KB Output is correct
57 Correct 121 ms 60920 KB Output is correct
58 Correct 49 ms 61304 KB Output is correct
59 Correct 57 ms 61304 KB Output is correct
60 Correct 66 ms 61304 KB Output is correct
61 Correct 639 ms 61304 KB Output is correct
62 Correct 102 ms 63096 KB Output is correct
63 Correct 561 ms 62320 KB Output is correct
64 Correct 768 ms 61880 KB Output is correct
65 Execution timed out 1094 ms 61940 KB Time limit exceeded
66 Halted 0 ms 0 KB -