oj.uz

Submission #761628

# Submission time Handle Problem Language Result Execution time Memory
761628 2023-06-20T06:01:32 Z KN200711 Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 33796 KB 
# include <bits/stdc++.h>
# include <unordered_map>
# define fi first
# define se second
using namespace std;

const int sq = 200;
vector<int> dg[30001];
map< pair<int, int> , int> jp;

int st, js, ed;
int rc[30001];

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[make_pair(a - c, c)] == 0) {
			BFS.push(make_pair(make_pair(a - c, b + 1), c));
			jp[make_pair(a - c, c)] = 1;
		}
		if(a + c < N && jp[make_pair(a + c, c)] == 0) {
			BFS.push(make_pair(make_pair(a+c, b + 1), c));
			jp[make_pair(a + c, c)] = 1;
		}
		for(int k=0;k<dg[a].size();k++) {
			c = dg[a][k];
			if(a - c >= 0 && jp[make_pair(a - c, c)] == 0) {
				BFS.push(make_pair(make_pair(a - c, b + 1), c));
				jp[make_pair(a - c, c)] = 1;
			}
			if(a + c < N && jp[make_pair(a + c, c)] == 0) {
				BFS.push(make_pair(make_pair(a+c, b + 1), c));
				jp[make_pair(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:48:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |   for(int k=0;k<dg[a].size();k++) {
      |               ~^~~~~~~~~~~~~
skyscraper.cpp:16:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |  scanf("%d %d", &N, &M);
      |  ~~~~~^~~~~~~~~~~~~~~~~
skyscraper.cpp:21:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |   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 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 1020 KB Output is correct
9 Correct 1 ms 1012 KB Output is correct
10 Correct 2 ms 1016 KB Output is correct
11 Correct 7 ms 1236 KB Output is correct
12 Correct 2 ms 980 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 7 ms 1364 KB Output is correct
15 Correct 7 ms 1364 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 1008 KB Output is correct
7 Correct 1 ms 1012 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 7 ms 1248 KB Output is correct
12 Correct 2 ms 1108 KB Output is correct
13 Correct 2 ms 980 KB Output is correct
14 Correct 7 ms 1364 KB Output is correct
15 Correct 7 ms 1344 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 12 ms 1860 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 1016 KB Output is correct
23 Correct 3 ms 1364 KB Output is correct
24 Correct 7 ms 1756 KB Output is correct
25 Correct 3 ms 1236 KB Output is correct
26 Correct 4 ms 1512 KB Output is correct
27 Correct 10 ms 1464 KB Output is correct
28 Correct 10 ms 2260 KB Output is correct
29 Correct 29 ms 4768 KB Output is correct
30 Correct 7 ms 2004 KB Output is correct
31 Correct 16 ms 3160 KB Output is correct
32 Correct 12 ms 2548 KB Output is correct
33 Correct 76 ms 8508 KB Output is correct
34 Correct 67 ms 8540 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 1012 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 1012 KB Output is correct
6 Correct 1 ms 1016 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 1008 KB Output is correct
9 Correct 1 ms 1012 KB Output is correct
10 Correct 2 ms 1108 KB Output is correct
11 Correct 7 ms 1256 KB Output is correct
12 Correct 2 ms 980 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 7 ms 1364 KB Output is correct
15 Correct 7 ms 1364 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 12 ms 1920 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 1364 KB Output is correct
24 Correct 7 ms 1748 KB Output is correct
25 Correct 3 ms 1324 KB Output is correct
26 Correct 4 ms 1492 KB Output is correct
27 Correct 10 ms 1380 KB Output is correct
28 Correct 9 ms 2260 KB Output is correct
29 Correct 28 ms 4820 KB Output is correct
30 Correct 7 ms 2004 KB Output is correct
31 Correct 14 ms 3100 KB Output is correct
32 Correct 11 ms 2428 KB Output is correct
33 Correct 68 ms 8520 KB Output is correct
34 Correct 67 ms 8544 KB Output is correct
35 Correct 248 ms 6968 KB Output is correct
36 Correct 12 ms 2048 KB Output is correct
37 Correct 549 ms 12104 KB Output is correct
38 Correct 470 ms 11096 KB Output is correct
39 Correct 467 ms 11040 KB Output is correct
40 Correct 452 ms 11064 KB Output is correct
41 Correct 466 ms 11076 KB Output is correct
42 Correct 15 ms 1748 KB Output is correct
43 Correct 131 ms 1640 KB Output is correct
44 Correct 7 ms 1492 KB Output is correct
45 Correct 889 ms 31520 KB Output is correct
46 Correct 914 ms 31588 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 1012 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 1012 KB Output is correct
10 Correct 2 ms 1108 KB Output is correct
11 Correct 7 ms 1236 KB Output is correct
12 Correct 2 ms 980 KB Output is correct
13 Correct 1 ms 1016 KB Output is correct
14 Correct 7 ms 1384 KB Output is correct
15 Correct 7 ms 1396 KB Output is correct
16 Correct 1 ms 1016 KB Output is correct
17 Correct 12 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 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 1364 KB Output is correct
24 Correct 7 ms 1808 KB Output is correct
25 Correct 3 ms 1236 KB Output is correct
26 Correct 4 ms 1404 KB Output is correct
27 Correct 10 ms 1460 KB Output is correct
28 Correct 9 ms 2260 KB Output is correct
29 Correct 28 ms 4748 KB Output is correct
30 Correct 6 ms 2112 KB Output is correct
31 Correct 15 ms 2992 KB Output is correct
32 Correct 9 ms 2388 KB Output is correct
33 Correct 70 ms 8436 KB Output is correct
34 Correct 71 ms 8552 KB Output is correct
35 Correct 219 ms 7040 KB Output is correct
36 Correct 12 ms 2004 KB Output is correct
37 Correct 552 ms 12076 KB Output is correct
38 Correct 457 ms 11004 KB Output is correct
39 Correct 473 ms 11084 KB Output is correct
40 Correct 481 ms 11056 KB Output is correct
41 Correct 451 ms 11016 KB Output is correct
42 Correct 15 ms 1748 KB Output is correct
43 Correct 130 ms 1640 KB Output is correct
44 Correct 7 ms 1492 KB Output is correct
45 Correct 851 ms 31432 KB Output is correct
46 Correct 880 ms 31480 KB Output is correct
47 Execution timed out 1071 ms 33796 KB Time limit exceeded
48 Halted 0 ms 0 KB -