oj.uz

Submission #536666

# Submission time Handle Problem Language Result Execution time Memory
536666 2022-03-13T17:54:40 Z Gurban Jakarta Skyscrapers (APIO15_skyscraper) C++17
36 / 100
 1000 ms 25472 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];
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]);
	}
	queue<pair<int,int>>q;
	q.push({b[0],p[0]});
	dis[{b[0],p[0]}] = 0;
	while(!q.empty()){
		int idx = q.front().first;
		int pi = q.front().second;
		q.pop();
		if(idx == b[1]) return cout<<dis[{idx,pi}],0;
		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({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({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({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({idx + i,i});
				}
			}
		}
	}
	cout<<-1;
}

Subtask #1
10.0 / 10.0

# 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

Subtask #2
12.0 / 12.0

# 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 9 ms 1388 KB Output is correct
15 Correct 2 ms 1108 KB Output is correct

Subtask #3
14.0 / 14.0

# 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 1364 KB Output is correct
15 Correct 2 ms 1228 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 3 ms 1236 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 4 ms 1304 KB Output is correct
24 Correct 5 ms 1348 KB Output is correct
25 Correct 2 ms 1108 KB Output is correct
26 Correct 2 ms 1236 KB Output is correct
27 Correct 3 ms 1236 KB Output is correct
28 Correct 12 ms 2228 KB Output is correct
29 Correct 45 ms 4780 KB Output is correct
30 Correct 10 ms 2040 KB Output is correct
31 Correct 20 ms 2960 KB Output is correct
32 Correct 13 ms 2500 KB Output is correct
33 Correct 118 ms 8552 KB Output is correct
34 Correct 52 ms 5160 KB Output is correct

Subtask #4
0 / 21.0

# 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 9 ms 1380 KB Output is correct
15 Correct 2 ms 1108 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 3 ms 1236 KB Output is correct
18 Correct 1 ms 980 KB Output is correct
19 Correct 1 ms 980 KB Output is correct
20 Correct 1 ms 1236 KB Output is correct
21 Correct 1 ms 980 KB Output is correct
22 Correct 2 ms 948 KB Output is correct
23 Correct 3 ms 1236 KB Output is correct
24 Correct 5 ms 1364 KB Output is correct
25 Correct 1 ms 1108 KB Output is correct
26 Correct 2 ms 1236 KB Output is correct
27 Correct 3 ms 1236 KB Output is correct
28 Correct 12 ms 2260 KB Output is correct
29 Correct 43 ms 4812 KB Output is correct
30 Correct 9 ms 2068 KB Output is correct
31 Correct 20 ms 3028 KB Output is correct
32 Correct 14 ms 2428 KB Output is correct
33 Correct 116 ms 8436 KB Output is correct
34 Correct 53 ms 5016 KB Output is correct
35 Correct 37 ms 3276 KB Output is correct
36 Correct 2 ms 1108 KB Output is correct
37 Correct 14 ms 2788 KB Output is correct
38 Correct 22 ms 3276 KB Output is correct
39 Correct 6 ms 1492 KB Output is correct
40 Correct 6 ms 1500 KB Output is correct
41 Correct 8 ms 1748 KB Output is correct
42 Correct 5 ms 1492 KB Output is correct
43 Correct 5 ms 1620 KB Output is correct
44 Correct 6 ms 1492 KB Output is correct
45 Execution timed out 1091 ms 23636 KB Time limit exceeded
46 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 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 9 ms 1380 KB Output is correct
15 Correct 2 ms 1108 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 3 ms 1236 KB Output is correct
18 Correct 1 ms 980 KB Output is correct
19 Correct 1 ms 1040 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 3 ms 1236 KB Output is correct
24 Correct 5 ms 1364 KB Output is correct
25 Correct 2 ms 1108 KB Output is correct
26 Correct 2 ms 1188 KB Output is correct
27 Correct 3 ms 1236 KB Output is correct
28 Correct 13 ms 2364 KB Output is correct
29 Correct 42 ms 4812 KB Output is correct
30 Correct 9 ms 2004 KB Output is correct
31 Correct 20 ms 3004 KB Output is correct
32 Correct 13 ms 2516 KB Output is correct
33 Correct 116 ms 8508 KB Output is correct
34 Correct 54 ms 5080 KB Output is correct
35 Correct 36 ms 3328 KB Output is correct
36 Correct 2 ms 1108 KB Output is correct
37 Correct 15 ms 2748 KB Output is correct
38 Correct 22 ms 3356 KB Output is correct
39 Correct 5 ms 1492 KB Output is correct
40 Correct 7 ms 1524 KB Output is correct
41 Correct 8 ms 1748 KB Output is correct
42 Correct 5 ms 1492 KB Output is correct
43 Correct 6 ms 1640 KB Output is correct
44 Correct 6 ms 1492 KB Output is correct
45 Execution timed out 1101 ms 25472 KB Time limit exceeded
46 Halted 0 ms 0 KB -