oj.uz

Submission #761640

# Submission time Handle Problem Language Result Execution time Memory
761640 2023-06-20T06:39:11 Z KN200711 Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 33376 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];

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();
		
		rc[a] = min(rc[a], b);
		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;
		}
		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:52:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |   for(int k=0;k<dg[a].size();k++) {
      |               ~^~~~~~~~~~~~~
skyscraper.cpp:20:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |  scanf("%d %d", &N, &M);
      |  ~~~~~^~~~~~~~~~~~~~~~~
skyscraper.cpp:25:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |   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 6 ms 1220 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 6 ms 1364 KB Output is correct
15 Correct 6 ms 1320 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 6 ms 1236 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 6 ms 1364 KB Output is correct
15 Correct 6 ms 1364 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 11 ms 1876 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 3 ms 1364 KB Output is correct
24 Correct 6 ms 1748 KB Output is correct
25 Correct 3 ms 1236 KB Output is correct
26 Correct 3 ms 1492 KB Output is correct
27 Correct 9 ms 1432 KB Output is correct
28 Correct 8 ms 2260 KB Output is correct
29 Correct 26 ms 4772 KB Output is correct
30 Correct 6 ms 2112 KB Output is correct
31 Correct 12 ms 3100 KB Output is correct
32 Correct 8 ms 2388 KB Output is correct
33 Correct 62 ms 8436 KB Output is correct
34 Correct 61 ms 8440 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 1108 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 2 ms 1108 KB Output is correct
11 Correct 8 ms 1188 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 6 ms 1364 KB Output is correct
15 Correct 6 ms 1340 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 10 ms 1864 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 3 ms 1364 KB Output is correct
24 Correct 6 ms 1748 KB Output is correct
25 Correct 2 ms 1236 KB Output is correct
26 Correct 3 ms 1492 KB Output is correct
27 Correct 9 ms 1444 KB Output is correct
28 Correct 8 ms 2260 KB Output is correct
29 Correct 26 ms 4764 KB Output is correct
30 Correct 6 ms 2004 KB Output is correct
31 Correct 13 ms 3028 KB Output is correct
32 Correct 9 ms 2388 KB Output is correct
33 Correct 66 ms 8496 KB Output is correct
34 Correct 64 ms 8532 KB Output is correct
35 Correct 214 ms 6836 KB Output is correct
36 Correct 10 ms 2004 KB Output is correct
37 Correct 526 ms 11884 KB Output is correct
38 Correct 497 ms 10828 KB Output is correct
39 Correct 439 ms 10796 KB Output is correct
40 Correct 437 ms 10804 KB Output is correct
41 Correct 438 ms 10784 KB Output is correct
42 Correct 17 ms 1620 KB Output is correct
43 Correct 114 ms 1432 KB Output is correct
44 Correct 7 ms 1236 KB Output is correct
45 Correct 820 ms 31252 KB Output is correct
46 Correct 833 ms 31308 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 964 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 1108 KB Output is correct
11 Correct 8 ms 1240 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 2 ms 980 KB Output is correct
14 Correct 6 ms 1372 KB Output is correct
15 Correct 6 ms 1316 KB Output is correct
16 Correct 1 ms 988 KB Output is correct
17 Correct 10 ms 1884 KB Output is correct
18 Correct 1 ms 988 KB Output is correct
19 Correct 1 ms 988 KB Output is correct
20 Correct 1 ms 1116 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 6 ms 1748 KB Output is correct
25 Correct 3 ms 1236 KB Output is correct
26 Correct 4 ms 1480 KB Output is correct
27 Correct 9 ms 1364 KB Output is correct
28 Correct 8 ms 2256 KB Output is correct
29 Correct 26 ms 4744 KB Output is correct
30 Correct 8 ms 2040 KB Output is correct
31 Correct 12 ms 3040 KB Output is correct
32 Correct 8 ms 2400 KB Output is correct
33 Correct 67 ms 8532 KB Output is correct
34 Correct 76 ms 8484 KB Output is correct
35 Correct 222 ms 6760 KB Output is correct
36 Correct 11 ms 2016 KB Output is correct
37 Correct 538 ms 11860 KB Output is correct
38 Correct 491 ms 10788 KB Output is correct
39 Correct 479 ms 10816 KB Output is correct
40 Correct 450 ms 10844 KB Output is correct
41 Correct 483 ms 10804 KB Output is correct
42 Correct 13 ms 1624 KB Output is correct
43 Correct 117 ms 1428 KB Output is correct
44 Correct 10 ms 1236 KB Output is correct
45 Correct 874 ms 31284 KB Output is correct
46 Correct 840 ms 31252 KB Output is correct
47 Execution timed out 1083 ms 33376 KB Time limit exceeded
48 Halted 0 ms 0 KB -