oj.uz

Submission #761664

# Submission time Handle Problem Language Result Execution time Memory
761664 2023-06-20T06:57:12 Z MetalPower Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 92552 KB 
# include <bits/stdc++.h>
# define fi first
# define se second
# define ll long long
using namespace std;
 
const int sq = 200;
vector<int> dg[30001];
unordered_map<ll , int> jp;
 
int st, js, ed;
int rc[30001];
bool ex[30001];
map<pair<int, int>, int> vis;
 
ll ch(int a, int b) {
	return (1ll * 1e9 * 1ll * a) + (1ll * b);	
}
 
int main() {
	int N, M;
	scanf("%d %d", &N, &M);
	
	for(int i=0;i<N;i++) rc[i] = 1e9;
	for(int i=0;i<M;i++) {
		int a, b;
		scanf("%d %d", &a, &b);
		if(i == 0) {
			st = a;
			js = b;
		} else if(i == 1) ed = a;
		else dg[a].push_back(b);
	}
	
	queue< pair<pair<int, int>, int> > BFS;
	BFS.push(make_pair(make_pair(st, 0), js));
	while(BFS.size()) {
		int a, b, c;
		a = BFS.front().fi.fi;
		b = BFS.front().fi.se;
		c = BFS.front().se;
	//	cout<<a<<" "<<b<<" "<
		BFS.pop();

		if(vis[make_pair(a, c)]) continue;
		vis[make_pair(a, c)] = 1;
		
		rc[a] = min(rc[a], b);
		if(a == ed) break;
		if(a - c >= 0 && jp[ch(a - c, c)] == 0) {
			BFS.push(make_pair(make_pair(a - c, b + 1), c));
			jp[ch(a - c, c)] = 1;
		}
		if(a + c < N && jp[ch(a + c, c)] == 0) {
			BFS.push(make_pair(make_pair(a+c, b + 1), c));
			jp[ch(a + c, c)] = 1;
		}

		if(ex[a]) continue;
		ex[a] = true;
		
		for(int k=0;k<dg[a].size();k++) {
			
			c = dg[a][k];
			if(a - c >= 0 && jp[ch(a - c, c)] == 0) {
				BFS.push(make_pair(make_pair(a - c, b + 1), c));
				jp[ch(a - c, c)] = 1;
			}
			if(a + c < N && jp[ch(a + c, c)] == 0) {
				BFS.push(make_pair(make_pair(a+c, b + 1), c));
				jp[ch(a + c, c)] = 1;
			}
		}
	}
	if(rc[ed] == 1e9) rc[ed] = -1;
	printf("%d\n", rc[ed]);
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:62:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |   for(int k=0;k<dg[a].size();k++) {
      |               ~^~~~~~~~~~~~~
skyscraper.cpp:22:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |  scanf("%d %d", &N, &M);
      |  ~~~~~^~~~~~~~~~~~~~~~~
skyscraper.cpp:27:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |   scanf("%d %d", &a, &b);
      |   ~~~~~^~~~~~~~~~~~~~~~~

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 3 ms 1620 KB Output is correct
15 Correct 1 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 2 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 3 ms 1620 KB Output is correct
15 Correct 1 ms 1108 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 2 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 1 ms 980 KB Output is correct
23 Correct 3 ms 1364 KB Output is correct
24 Correct 4 ms 1620 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 1364 KB Output is correct
28 Correct 9 ms 2940 KB Output is correct
29 Correct 30 ms 7388 KB Output is correct
30 Correct 7 ms 2772 KB Output is correct
31 Correct 14 ms 4400 KB Output is correct
32 Correct 10 ms 3504 KB Output is correct
33 Correct 70 ms 13580 KB Output is correct
34 Correct 32 ms 7576 KB Output is correct

Subtask #4
21.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 3 ms 1620 KB Output is correct
15 Correct 1 ms 1108 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 2 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 1 ms 980 KB Output is correct
23 Correct 2 ms 1364 KB Output is correct
24 Correct 4 ms 1620 KB Output is correct
25 Correct 1 ms 1108 KB Output is correct
26 Correct 2 ms 1236 KB Output is correct
27 Correct 2 ms 1364 KB Output is correct
28 Correct 9 ms 2900 KB Output is correct
29 Correct 30 ms 7372 KB Output is correct
30 Correct 7 ms 2772 KB Output is correct
31 Correct 20 ms 4424 KB Output is correct
32 Correct 10 ms 3516 KB Output is correct
33 Correct 68 ms 13508 KB Output is correct
34 Correct 31 ms 7640 KB Output is correct
35 Correct 12 ms 3248 KB Output is correct
36 Correct 1 ms 1108 KB Output is correct
37 Correct 7 ms 2260 KB Output is correct
38 Correct 10 ms 2864 KB Output is correct
39 Correct 5 ms 1236 KB Output is correct
40 Correct 5 ms 1236 KB Output is correct
41 Correct 9 ms 1492 KB Output is correct
42 Correct 5 ms 1364 KB Output is correct
43 Correct 7 ms 1492 KB Output is correct
44 Correct 5 ms 1356 KB Output is correct
45 Correct 471 ms 51856 KB Output is correct
46 Correct 237 ms 27732 KB Output is correct

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 3 ms 1620 KB Output is correct
15 Correct 1 ms 1108 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 2 ms 1244 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 1 ms 980 KB Output is correct
23 Correct 3 ms 1476 KB Output is correct
24 Correct 4 ms 1620 KB Output is correct
25 Correct 1 ms 1108 KB Output is correct
26 Correct 2 ms 1236 KB Output is correct
27 Correct 2 ms 1364 KB Output is correct
28 Correct 9 ms 2900 KB Output is correct
29 Correct 35 ms 7392 KB Output is correct
30 Correct 7 ms 2772 KB Output is correct
31 Correct 15 ms 4364 KB Output is correct
32 Correct 10 ms 3512 KB Output is correct
33 Correct 75 ms 13552 KB Output is correct
34 Correct 31 ms 7652 KB Output is correct
35 Correct 18 ms 3240 KB Output is correct
36 Correct 2 ms 1108 KB Output is correct
37 Correct 6 ms 2260 KB Output is correct
38 Correct 13 ms 2876 KB Output is correct
39 Correct 5 ms 1236 KB Output is correct
40 Correct 5 ms 1236 KB Output is correct
41 Correct 6 ms 1492 KB Output is correct
42 Correct 5 ms 1364 KB Output is correct
43 Correct 6 ms 1492 KB Output is correct
44 Correct 6 ms 1364 KB Output is correct
45 Correct 550 ms 51904 KB Output is correct
46 Correct 248 ms 27812 KB Output is correct
47 Correct 9 ms 2372 KB Output is correct
48 Correct 7 ms 1748 KB Output is correct
49 Correct 7 ms 1748 KB Output is correct
50 Correct 4 ms 1620 KB Output is correct
51 Correct 28 ms 6492 KB Output is correct
52 Correct 33 ms 7356 KB Output is correct
53 Correct 9 ms 2388 KB Output is correct
54 Correct 4 ms 2644 KB Output is correct
55 Correct 7 ms 3760 KB Output is correct
56 Correct 16 ms 5256 KB Output is correct
57 Correct 2 ms 1236 KB Output is correct
58 Correct 26 ms 8212 KB Output is correct
59 Correct 30 ms 7512 KB Output is correct
60 Correct 25 ms 7572 KB Output is correct
61 Correct 26 ms 7112 KB Output is correct
62 Correct 514 ms 48492 KB Output is correct
63 Execution timed out 1079 ms 92552 KB Time limit exceeded
64 Halted 0 ms 0 KB -