oj.uz

Submission #761693

# Submission time Handle Problem Language Result Execution time Memory
761693 2023-06-20T07:16:59 Z MetalPower Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 131180 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<int, int> jp[30001];
 
int st, js, ed;
int rc[30001];
bool ex[30001];

int l = 0, r = -1;
pair<pair<int, int>, int> BFS[3000001];
 
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);
	}
	
	BFS[++r] = make_pair(make_pair(st, 0), js);
	while(l <= r) {
		int a, b, c;
		a = BFS[l].fi.fi;
		b = BFS[l].fi.se;
		c = BFS[l].se;
	//	cout<<a<<" "<<b<<" "<
		l++;

		rc[a] = min(rc[a], b);
		if(a == ed) break;
		if(a - c >= 0 && jp[a - c][c] == 0) {
			BFS[++r] = make_pair(make_pair(a - c, b + 1), c);
			jp[a - c][c] = 1;
		}
		if(a + c < N && jp[a + c][c] == 0) {
			BFS[++r] = make_pair(make_pair(a+c, b + 1), c);
			jp[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[a - c][c] == 0) {
				BFS[++r] = make_pair(make_pair(a - c, b + 1), c);
				jp[a - c][c] = 1;
			}
			if(a + c < N && jp[a + c][c] == 0) {
				BFS[++r] = make_pair(make_pair(a+c, b + 1), c);
				jp[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:60:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |   for(int k=0;k<dg[a].size();k++) {
      |               ~^~~~~~~~~~~~~
skyscraper.cpp:24:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |  scanf("%d %d", &N, &M);
      |  ~~~~~^~~~~~~~~~~~~~~~~
skyscraper.cpp:29:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |   scanf("%d %d", &a, &b);
      |   ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2664 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2596 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 1 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2900 KB Output is correct
15 Correct 2 ms 2772 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 1 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2900 KB Output is correct
15 Correct 2 ms 2772 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2900 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 2 ms 3028 KB Output is correct
21 Correct 1 ms 2644 KB Output is correct
22 Correct 2 ms 2644 KB Output is correct
23 Correct 2 ms 3028 KB Output is correct
24 Correct 3 ms 3156 KB Output is correct
25 Correct 2 ms 2644 KB Output is correct
26 Correct 2 ms 2900 KB Output is correct
27 Correct 2 ms 3028 KB Output is correct
28 Correct 6 ms 3796 KB Output is correct
29 Correct 9 ms 6100 KB Output is correct
30 Correct 3 ms 3540 KB Output is correct
31 Correct 5 ms 4556 KB Output is correct
32 Correct 4 ms 3796 KB Output is correct
33 Correct 18 ms 9604 KB Output is correct
34 Correct 8 ms 6100 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 1 ms 2584 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2568 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2900 KB Output is correct
15 Correct 2 ms 2772 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2900 KB Output is correct
18 Correct 1 ms 2644 KB Output is correct
19 Correct 1 ms 2680 KB Output is correct
20 Correct 2 ms 3028 KB Output is correct
21 Correct 2 ms 2644 KB Output is correct
22 Correct 2 ms 2644 KB Output is correct
23 Correct 3 ms 3048 KB Output is correct
24 Correct 4 ms 3028 KB Output is correct
25 Correct 2 ms 2772 KB Output is correct
26 Correct 3 ms 2900 KB Output is correct
27 Correct 2 ms 3028 KB Output is correct
28 Correct 4 ms 3796 KB Output is correct
29 Correct 14 ms 6172 KB Output is correct
30 Correct 3 ms 3512 KB Output is correct
31 Correct 5 ms 4564 KB Output is correct
32 Correct 4 ms 3796 KB Output is correct
33 Correct 18 ms 9608 KB Output is correct
34 Correct 8 ms 6100 KB Output is correct
35 Correct 9 ms 4436 KB Output is correct
36 Correct 2 ms 2772 KB Output is correct
37 Correct 7 ms 3972 KB Output is correct
38 Correct 10 ms 4396 KB Output is correct
39 Correct 7 ms 2856 KB Output is correct
40 Correct 7 ms 2900 KB Output is correct
41 Correct 9 ms 3236 KB Output is correct
42 Correct 7 ms 3048 KB Output is correct
43 Correct 6 ms 3156 KB Output is correct
44 Correct 6 ms 3156 KB Output is correct
45 Correct 121 ms 27596 KB Output is correct
46 Correct 51 ms 17356 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2548 KB Output is correct
8 Correct 1 ms 2644 KB Output is correct
9 Correct 1 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 3 ms 2980 KB Output is correct
15 Correct 2 ms 2772 KB Output is correct
16 Correct 1 ms 2644 KB Output is correct
17 Correct 2 ms 2900 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 4 ms 3028 KB Output is correct
21 Correct 2 ms 2644 KB Output is correct
22 Correct 2 ms 2644 KB Output is correct
23 Correct 2 ms 3028 KB Output is correct
24 Correct 4 ms 3028 KB Output is correct
25 Correct 2 ms 2772 KB Output is correct
26 Correct 2 ms 2900 KB Output is correct
27 Correct 2 ms 3028 KB Output is correct
28 Correct 6 ms 3816 KB Output is correct
29 Correct 11 ms 6124 KB Output is correct
30 Correct 3 ms 3540 KB Output is correct
31 Correct 5 ms 4692 KB Output is correct
32 Correct 4 ms 3796 KB Output is correct
33 Correct 18 ms 9556 KB Output is correct
34 Correct 8 ms 6100 KB Output is correct
35 Correct 9 ms 4436 KB Output is correct
36 Correct 2 ms 2772 KB Output is correct
37 Correct 7 ms 3924 KB Output is correct
38 Correct 10 ms 4384 KB Output is correct
39 Correct 6 ms 2900 KB Output is correct
40 Correct 6 ms 2900 KB Output is correct
41 Correct 7 ms 3224 KB Output is correct
42 Correct 8 ms 3028 KB Output is correct
43 Correct 6 ms 3168 KB Output is correct
44 Correct 6 ms 3156 KB Output is correct
45 Correct 105 ms 27572 KB Output is correct
46 Correct 46 ms 17324 KB Output is correct
47 Correct 11 ms 4564 KB Output is correct
48 Correct 6 ms 3372 KB Output is correct
49 Correct 6 ms 3412 KB Output is correct
50 Correct 5 ms 3304 KB Output is correct
51 Correct 18 ms 7764 KB Output is correct
52 Correct 20 ms 8500 KB Output is correct
53 Correct 9 ms 3968 KB Output is correct
54 Correct 5 ms 5076 KB Output is correct
55 Correct 7 ms 6052 KB Output is correct
56 Correct 16 ms 8316 KB Output is correct
57 Correct 2 ms 2900 KB Output is correct
58 Correct 16 ms 9044 KB Output is correct
59 Correct 15 ms 8536 KB Output is correct
60 Correct 15 ms 8648 KB Output is correct
61 Correct 18 ms 8332 KB Output is correct
62 Correct 145 ms 28228 KB Output is correct
63 Execution timed out 1091 ms 131180 KB Time limit exceeded
64 Halted 0 ms 0 KB -