oj.uz

Submission #761653

# Submission time Handle Problem Language Result Execution time Memory
761653 2023-06-20T06:45:15 Z KN200711 Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 66240 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 == 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;
		}
		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:53:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |   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 956 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 1020 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 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 6 ms 1364 KB Output is correct
15 Correct 2 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 1024 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 2 ms 1236 KB Output is correct
24 Correct 3 ms 1428 KB Output is correct
25 Correct 1 ms 980 KB Output is correct
26 Correct 2 ms 1108 KB Output is correct
27 Correct 2 ms 1236 KB Output is correct
28 Correct 8 ms 2132 KB Output is correct
29 Correct 25 ms 4752 KB Output is correct
30 Correct 6 ms 2004 KB Output is correct
31 Correct 12 ms 3060 KB Output is correct
32 Correct 8 ms 2388 KB Output is correct
33 Correct 62 ms 8420 KB Output is correct
34 Correct 31 ms 5068 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 6 ms 1280 KB Output is correct
15 Correct 2 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 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 2 ms 1236 KB Output is correct
24 Correct 3 ms 1364 KB Output is correct
25 Correct 1 ms 980 KB Output is correct
26 Correct 2 ms 1108 KB Output is correct
27 Correct 2 ms 1236 KB Output is correct
28 Correct 8 ms 2260 KB Output is correct
29 Correct 25 ms 4780 KB Output is correct
30 Correct 6 ms 2004 KB Output is correct
31 Correct 12 ms 3032 KB Output is correct
32 Correct 8 ms 2388 KB Output is correct
33 Correct 62 ms 8460 KB Output is correct
34 Correct 31 ms 4992 KB Output is correct
35 Correct 28 ms 3144 KB Output is correct
36 Correct 2 ms 1108 KB Output is correct
37 Correct 11 ms 2644 KB Output is correct
38 Correct 18 ms 3224 KB Output is correct
39 Correct 5 ms 1236 KB Output is correct
40 Correct 6 ms 1208 KB Output is correct
41 Correct 7 ms 1620 KB Output is correct
42 Correct 5 ms 1236 KB Output is correct
43 Correct 5 ms 1364 KB Output is correct
44 Correct 7 ms 1236 KB Output is correct
45 Correct 786 ms 31180 KB Output is correct
46 Correct 550 ms 18252 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 0 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 6 ms 1364 KB Output is correct
15 Correct 2 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 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 3 ms 1364 KB Output is correct
25 Correct 1 ms 980 KB Output is correct
26 Correct 2 ms 1108 KB Output is correct
27 Correct 2 ms 1236 KB Output is correct
28 Correct 8 ms 2132 KB Output is correct
29 Correct 25 ms 4800 KB Output is correct
30 Correct 6 ms 2004 KB Output is correct
31 Correct 12 ms 2956 KB Output is correct
32 Correct 8 ms 2384 KB Output is correct
33 Correct 61 ms 8392 KB Output is correct
34 Correct 31 ms 5068 KB Output is correct
35 Correct 28 ms 3156 KB Output is correct
36 Correct 2 ms 1108 KB Output is correct
37 Correct 11 ms 2672 KB Output is correct
38 Correct 17 ms 3152 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 1236 KB Output is correct
43 Correct 5 ms 1364 KB Output is correct
44 Correct 7 ms 1248 KB Output is correct
45 Correct 802 ms 31292 KB Output is correct
46 Correct 542 ms 18284 KB Output is correct
47 Correct 10 ms 2388 KB Output is correct
48 Correct 5 ms 1792 KB Output is correct
49 Correct 5 ms 1792 KB Output is correct
50 Correct 4 ms 1620 KB Output is correct
51 Correct 28 ms 4924 KB Output is correct
52 Correct 34 ms 5588 KB Output is correct
53 Correct 9 ms 2416 KB Output is correct
54 Correct 5 ms 2004 KB Output is correct
55 Correct 8 ms 2644 KB Output is correct
56 Correct 19 ms 4116 KB Output is correct
57 Correct 1 ms 1144 KB Output is correct
58 Correct 33 ms 5492 KB Output is correct
59 Correct 23 ms 5016 KB Output is correct
60 Correct 22 ms 5024 KB Output is correct
61 Correct 22 ms 4688 KB Output is correct
62 Correct 340 ms 29420 KB Output is correct
63 Execution timed out 1070 ms 66240 KB Time limit exceeded
64 Halted 0 ms 0 KB -