oj.uz

Submission #536667

# Submission time Handle Problem Language Result Execution time Memory
536667 2022-03-13T18:03:34 Z Gurban Jakarta Skyscrapers (APIO15_skyscraper) C++17
36 / 100
 1000 ms 22360 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<int,int>dis;

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

	cin >> n >> m;
	int mx = max(n,m) + 1;
	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] * mx + p[0]] = 0;
	while(!q.empty()){
		int idx = q.front().first;
		int pi = q.front().second;
		q.pop();
		int now = dis[idx * mx + pi];
		if(idx == b[1]) return cout<<now,0;
		if(idx - pi >= 0){
			auto t = dis.find((idx - pi) * mx + pi);
			if(t == dis.end() or (t != dis.end() and (*t).second > now + 1)){
				dis[(idx - pi) * mx + pi] = now + 1;
				q.push({idx - pi,pi});
			}
		}
		if(idx + pi < n){
			auto t = dis.find((idx + pi) * mx + pi);
			if(t == dis.end() or (t != dis.end() and (*t).second > now + 1)){
				dis[(idx + pi) * mx + pi] = now + 1;
				q.push({idx + pi,pi});
			}
		}
		for(auto i : v[idx]){
			if(idx - i >= 0){
				auto t = dis.find((idx - i) * mx + i);
				if(t == dis.end() or (t != dis.end() and (*t).second > now + 1)){
					dis[(idx - i) * mx + i] = now + 1;
					q.push({idx - i,i});
				}		
			}
			if(idx + i < n){
				auto t = dis.find((idx + i) * mx + i);
				if(t == dis.end() or (t != dis.end() and (*t).second > now + 1)){
					dis[(idx + i) * mx + 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 7 ms 1236 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 7 ms 1236 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 2 ms 980 KB Output is correct
19 Correct 1 ms 980 KB Output is correct
20 Correct 2 ms 1108 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 4 ms 1364 KB Output is correct
25 Correct 1 ms 1108 KB Output is correct
26 Correct 2 ms 1108 KB Output is correct
27 Correct 3 ms 1200 KB Output is correct
28 Correct 11 ms 2004 KB Output is correct
29 Correct 38 ms 3880 KB Output is correct
30 Correct 8 ms 1772 KB Output is correct
31 Correct 16 ms 2492 KB Output is correct
32 Correct 11 ms 2132 KB Output is correct
33 Correct 95 ms 6620 KB Output is correct
34 Correct 46 ms 4040 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 8 ms 1236 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 2 ms 1108 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 4 ms 1364 KB Output is correct
25 Correct 2 ms 1108 KB Output is correct
26 Correct 2 ms 1108 KB Output is correct
27 Correct 3 ms 1236 KB Output is correct
28 Correct 13 ms 1996 KB Output is correct
29 Correct 41 ms 3872 KB Output is correct
30 Correct 9 ms 1748 KB Output is correct
31 Correct 20 ms 2492 KB Output is correct
32 Correct 12 ms 2072 KB Output is correct
33 Correct 98 ms 6744 KB Output is correct
34 Correct 48 ms 4064 KB Output is correct
35 Correct 34 ms 2900 KB Output is correct
36 Correct 2 ms 1108 KB Output is correct
37 Correct 13 ms 2388 KB Output is correct
38 Correct 21 ms 2900 KB Output is correct
39 Correct 6 ms 1428 KB Output is correct
40 Correct 5 ms 1492 KB Output is correct
41 Correct 7 ms 1748 KB Output is correct
42 Correct 5 ms 1492 KB Output is correct
43 Correct 6 ms 1492 KB Output is correct
44 Correct 6 ms 1492 KB Output is correct
45 Execution timed out 1091 ms 22292 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 1000 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 7 ms 1236 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 1108 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 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 3 ms 1108 KB Output is correct
27 Correct 3 ms 1236 KB Output is correct
28 Correct 17 ms 2004 KB Output is correct
29 Correct 44 ms 3868 KB Output is correct
30 Correct 8 ms 1748 KB Output is correct
31 Correct 16 ms 2548 KB Output is correct
32 Correct 11 ms 2052 KB Output is correct
33 Correct 89 ms 6624 KB Output is correct
34 Correct 45 ms 4092 KB Output is correct
35 Correct 36 ms 2840 KB Output is correct
36 Correct 2 ms 1108 KB Output is correct
37 Correct 12 ms 2460 KB Output is correct
38 Correct 30 ms 2900 KB Output is correct
39 Correct 6 ms 1492 KB Output is correct
40 Correct 9 ms 1492 KB Output is correct
41 Correct 11 ms 1748 KB Output is correct
42 Correct 6 ms 1492 KB Output is correct
43 Correct 6 ms 1492 KB Output is correct
44 Correct 6 ms 1516 KB Output is correct
45 Execution timed out 1085 ms 22360 KB Time limit exceeded
46 Halted 0 ms 0 KB -