oj.uz

Submission #761666

# Submission time Handle Problem Language Result Execution time Memory
761666 2023-06-20T06:58:33 Z MetalPower Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 87064 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];
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 968 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 4 ms 1748 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 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 4 ms 1756 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 1320 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 3 ms 1492 KB Output is correct
24 Correct 5 ms 1748 KB Output is correct
25 Correct 1 ms 1108 KB Output is correct
26 Correct 2 ms 1364 KB Output is correct
27 Correct 3 ms 1492 KB Output is correct
28 Correct 12 ms 3336 KB Output is correct
29 Correct 57 ms 8688 KB Output is correct
30 Correct 10 ms 3012 KB Output is correct
31 Correct 23 ms 5076 KB Output is correct
32 Correct 15 ms 3876 KB Output is correct
33 Correct 118 ms 15960 KB Output is correct
34 Correct 52 ms 8908 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 4 ms 1748 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 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 1316 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 1492 KB Output is correct
24 Correct 4 ms 1748 KB Output is correct
25 Correct 1 ms 1108 KB Output is correct
26 Correct 2 ms 1336 KB Output is correct
27 Correct 3 ms 1492 KB Output is correct
28 Correct 12 ms 3384 KB Output is correct
29 Correct 47 ms 8632 KB Output is correct
30 Correct 11 ms 3104 KB Output is correct
31 Correct 22 ms 5076 KB Output is correct
32 Correct 15 ms 3924 KB Output is correct
33 Correct 151 ms 15928 KB Output is correct
34 Correct 53 ms 8880 KB Output is correct
35 Correct 17 ms 3760 KB Output is correct
36 Correct 2 ms 1144 KB Output is correct
37 Correct 10 ms 2772 KB Output is correct
38 Correct 14 ms 3372 KB Output is correct
39 Correct 5 ms 1256 KB Output is correct
40 Correct 5 ms 1236 KB Output is correct
41 Correct 7 ms 1620 KB Output is correct
42 Correct 5 ms 1492 KB Output is correct
43 Correct 6 ms 1620 KB Output is correct
44 Correct 7 ms 1460 KB Output is correct
45 Correct 805 ms 61372 KB Output is correct
46 Correct 352 ms 33512 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 940 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 4 ms 1748 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 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 3 ms 1492 KB Output is correct
24 Correct 5 ms 1748 KB Output is correct
25 Correct 1 ms 1108 KB Output is correct
26 Correct 2 ms 1364 KB Output is correct
27 Correct 3 ms 1492 KB Output is correct
28 Correct 12 ms 3412 KB Output is correct
29 Correct 47 ms 8500 KB Output is correct
30 Correct 10 ms 3000 KB Output is correct
31 Correct 22 ms 5104 KB Output is correct
32 Correct 15 ms 3860 KB Output is correct
33 Correct 119 ms 16004 KB Output is correct
34 Correct 51 ms 8912 KB Output is correct
35 Correct 16 ms 3864 KB Output is correct
36 Correct 2 ms 1108 KB Output is correct
37 Correct 10 ms 2712 KB Output is correct
38 Correct 15 ms 3476 KB Output is correct
39 Correct 5 ms 1236 KB Output is correct
40 Correct 6 ms 1236 KB Output is correct
41 Correct 7 ms 1620 KB Output is correct
42 Correct 5 ms 1492 KB Output is correct
43 Correct 6 ms 1620 KB Output is correct
44 Correct 8 ms 1464 KB Output is correct
45 Correct 771 ms 61380 KB Output is correct
46 Correct 340 ms 33508 KB Output is correct
47 Correct 10 ms 2620 KB Output is correct
48 Correct 7 ms 1748 KB Output is correct
49 Correct 5 ms 1748 KB Output is correct
50 Correct 4 ms 1620 KB Output is correct
51 Correct 38 ms 7152 KB Output is correct
52 Correct 47 ms 8420 KB Output is correct
53 Correct 10 ms 2388 KB Output is correct
54 Correct 7 ms 2904 KB Output is correct
55 Correct 14 ms 4180 KB Output is correct
56 Correct 25 ms 5732 KB Output is correct
57 Correct 2 ms 1236 KB Output is correct
58 Correct 44 ms 9708 KB Output is correct
59 Correct 39 ms 8700 KB Output is correct
60 Correct 39 ms 8532 KB Output is correct
61 Correct 37 ms 7916 KB Output is correct
62 Correct 559 ms 56332 KB Output is correct
63 Execution timed out 1097 ms 87064 KB Time limit exceeded
64 Halted 0 ms 0 KB -