Submission #536662

# Submission time Handle Problem Language Result Execution time Memory
536662 2022-03-13T17:38:15 Z Gurban Jakarta Skyscrapers (APIO15_skyscraper) C++17
36 / 100
1000 ms 42540 KB
#include "bits/stdc++.h"
using namespace std;

using ll = long long;

const int maxn=3e4+5;
int n,m;
int b[maxn],p[maxn];
vector<int>v[maxn];
set<pair<int,int>>vis;
map<pair<int,int>,int>dis;

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin >> n >> m;
	for(int i = 0;i < m;i++){
		cin >> b[i] >> p[i];
		v[b[i]].push_back(p[i]);
	}
	priority_queue<tuple<int,int,int>>q;
	q.push({0,b[0],p[0]});
	dis[{b[0],p[0]}] = 0;
	while(!q.empty()){
		int idx = get<1>(q.top());
		int pi = get<2>(q.top());
		q.pop();
		if(vis.find({idx,pi}) != vis.end()) continue;
		if(idx == b[1]) return cout<<dis[{idx,pi}],0;
		vis.insert({idx,pi});
		int now = dis[{idx,pi}];
		if(idx - pi >= 0){
			auto t = dis.find({idx - pi,pi});
			if(t == dis.end() or (t != dis.end() and (*t).second > now + 1)){
				dis[{idx - pi,pi}] = now + 1;
				q.push({-now - 1,idx - pi,pi});
			}
		}
		if(idx + pi < n){
			auto t = dis.find({idx + pi,pi});
			if(t == dis.end() or (t != dis.end() and (*t).second > now + 1)){
				dis[{idx + pi,pi}] = now + 1;
				q.push({-now - 1,idx + pi,pi});
			}
		}
		for(auto i : v[idx]){
			if(idx - i >= 0){
				auto t = dis.find({idx - i,i});
				if(t == dis.end() or (t != dis.end() and (*t).second > now + 1)){
					dis[{idx - i,i}] = now + 1;
					q.push({-now - 1,idx - i,i});
				}		
			}
			if(idx + i < n){
				auto t = dis.find({idx + i,i});
				if(t == dis.end() or (t != dis.end() and (*t).second > now + 1)){
					dis[{idx + i,i}] = now + 1;
					q.push({-now - 1,idx + i,i});
				}
			}
		}
	}
	cout<<-1;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 940 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 980 KB Output is correct
11 Correct 1 ms 980 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 11 ms 1748 KB Output is correct
15 Correct 2 ms 1108 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 1008 KB Output is correct
11 Correct 1 ms 980 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 11 ms 1620 KB Output is correct
15 Correct 2 ms 1108 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 5 ms 1364 KB Output is correct
18 Correct 1 ms 980 KB Output is correct
19 Correct 1 ms 980 KB Output is correct
20 Correct 2 ms 1236 KB Output is correct
21 Correct 1 ms 980 KB Output is correct
22 Correct 1 ms 980 KB Output is correct
23 Correct 5 ms 1468 KB Output is correct
24 Correct 7 ms 1748 KB Output is correct
25 Correct 2 ms 1108 KB Output is correct
26 Correct 2 ms 1364 KB Output is correct
27 Correct 5 ms 1492 KB Output is correct
28 Correct 19 ms 3100 KB Output is correct
29 Correct 64 ms 7636 KB Output is correct
30 Correct 18 ms 2876 KB Output is correct
31 Correct 33 ms 4564 KB Output is correct
32 Correct 23 ms 3604 KB Output is correct
33 Correct 172 ms 14156 KB Output is correct
34 Correct 64 ms 7992 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 992 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 980 KB Output is correct
11 Correct 1 ms 980 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 10 ms 1740 KB Output is correct
15 Correct 2 ms 1108 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 4 ms 1364 KB Output is correct
18 Correct 1 ms 980 KB Output is correct
19 Correct 1 ms 980 KB Output is correct
20 Correct 2 ms 1236 KB Output is correct
21 Correct 1 ms 980 KB Output is correct
22 Correct 1 ms 980 KB Output is correct
23 Correct 5 ms 1492 KB Output is correct
24 Correct 9 ms 1648 KB Output is correct
25 Correct 2 ms 1072 KB Output is correct
26 Correct 3 ms 1364 KB Output is correct
27 Correct 4 ms 1492 KB Output is correct
28 Correct 18 ms 3164 KB Output is correct
29 Correct 61 ms 7700 KB Output is correct
30 Correct 15 ms 2896 KB Output is correct
31 Correct 32 ms 4572 KB Output is correct
32 Correct 21 ms 3508 KB Output is correct
33 Correct 143 ms 14144 KB Output is correct
34 Correct 65 ms 7988 KB Output is correct
35 Correct 28 ms 3396 KB Output is correct
36 Correct 3 ms 1108 KB Output is correct
37 Correct 9 ms 2140 KB Output is correct
38 Correct 44 ms 4104 KB Output is correct
39 Correct 7 ms 1492 KB Output is correct
40 Correct 7 ms 1748 KB Output is correct
41 Correct 27 ms 3764 KB Output is correct
42 Correct 6 ms 1620 KB Output is correct
43 Correct 7 ms 1748 KB Output is correct
44 Correct 7 ms 1620 KB Output is correct
45 Execution timed out 1089 ms 42540 KB Time limit exceeded
46 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 980 KB Output is correct
11 Correct 1 ms 980 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 11 ms 1680 KB Output is correct
15 Correct 1 ms 1108 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 4 ms 1364 KB Output is correct
18 Correct 1 ms 980 KB Output is correct
19 Correct 1 ms 980 KB Output is correct
20 Correct 2 ms 1236 KB Output is correct
21 Correct 1 ms 980 KB Output is correct
22 Correct 1 ms 980 KB Output is correct
23 Correct 6 ms 1492 KB Output is correct
24 Correct 8 ms 1748 KB Output is correct
25 Correct 2 ms 1108 KB Output is correct
26 Correct 3 ms 1364 KB Output is correct
27 Correct 4 ms 1492 KB Output is correct
28 Correct 19 ms 3072 KB Output is correct
29 Correct 60 ms 7628 KB Output is correct
30 Correct 14 ms 2792 KB Output is correct
31 Correct 30 ms 4632 KB Output is correct
32 Correct 21 ms 3496 KB Output is correct
33 Correct 155 ms 14136 KB Output is correct
34 Correct 72 ms 7984 KB Output is correct
35 Correct 32 ms 3404 KB Output is correct
36 Correct 2 ms 1108 KB Output is correct
37 Correct 9 ms 2132 KB Output is correct
38 Correct 33 ms 4104 KB Output is correct
39 Correct 6 ms 1492 KB Output is correct
40 Correct 8 ms 1748 KB Output is correct
41 Correct 28 ms 3736 KB Output is correct
42 Correct 6 ms 1620 KB Output is correct
43 Correct 8 ms 1840 KB Output is correct
44 Correct 6 ms 1620 KB Output is correct
45 Execution timed out 1095 ms 41356 KB Time limit exceeded
46 Halted 0 ms 0 KB -