Submission #536663

# Submission time Handle Problem Language Result Execution time Memory
536663 2022-03-13T17:41:18 Z Gurban Jakarta Skyscrapers (APIO15_skyscraper) C++17
36 / 100
1000 ms 41500 KB
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#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 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
# 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 2 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
# 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 12 ms 1716 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 1492 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 4 ms 1492 KB Output is correct
28 Correct 21 ms 3156 KB Output is correct
29 Correct 86 ms 7700 KB Output is correct
30 Correct 18 ms 2772 KB Output is correct
31 Correct 38 ms 4604 KB Output is correct
32 Correct 23 ms 3540 KB Output is correct
33 Correct 156 ms 14116 KB Output is correct
34 Correct 68 ms 7888 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 1044 KB Output is correct
14 Correct 12 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 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 5 ms 1492 KB Output is correct
28 Correct 24 ms 3080 KB Output is correct
29 Correct 68 ms 7592 KB Output is correct
30 Correct 16 ms 2796 KB Output is correct
31 Correct 35 ms 4560 KB Output is correct
32 Correct 23 ms 3592 KB Output is correct
33 Correct 156 ms 14128 KB Output is correct
34 Correct 76 ms 8012 KB Output is correct
35 Correct 30 ms 3444 KB Output is correct
36 Correct 2 ms 1108 KB Output is correct
37 Correct 10 ms 2132 KB Output is correct
38 Correct 43 ms 4156 KB Output is correct
39 Correct 8 ms 1492 KB Output is correct
40 Correct 7 ms 1748 KB Output is correct
41 Correct 31 ms 3784 KB Output is correct
42 Correct 6 ms 1640 KB Output is correct
43 Correct 7 ms 1748 KB Output is correct
44 Correct 8 ms 1600 KB Output is correct
45 Execution timed out 1091 ms 38084 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 2 ms 980 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 11 ms 1676 KB Output is correct
15 Correct 2 ms 1108 KB Output is correct
16 Correct 2 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 2 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 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 3128 KB Output is correct
29 Correct 62 ms 7620 KB Output is correct
30 Correct 15 ms 2760 KB Output is correct
31 Correct 30 ms 4560 KB Output is correct
32 Correct 23 ms 3608 KB Output is correct
33 Correct 184 ms 14132 KB Output is correct
34 Correct 77 ms 7896 KB Output is correct
35 Correct 29 ms 3440 KB Output is correct
36 Correct 2 ms 1108 KB Output is correct
37 Correct 10 ms 2172 KB Output is correct
38 Correct 33 ms 4224 KB Output is correct
39 Correct 6 ms 1492 KB Output is correct
40 Correct 7 ms 1748 KB Output is correct
41 Correct 27 ms 3688 KB Output is correct
42 Correct 7 ms 1640 KB Output is correct
43 Correct 7 ms 1748 KB Output is correct
44 Correct 7 ms 1664 KB Output is correct
45 Execution timed out 1094 ms 41500 KB Time limit exceeded
46 Halted 0 ms 0 KB -