oj.uz

Submission #212718

# Submission time Handle Problem Language Result Execution time Memory
212718 2020-03-24T07:39:46 Z spdskatr Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 37624 KB 
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <functional>
#include <utility>
#define fi first
#define se second

using namespace std;
typedef pair<int, int> pii;

int N, M, b[30005], p[30005], seen[30005];
vector<int> doges[30005];
map<int, int> dists;
queue<int> q;

int id(int d, int x) {
	return d * 30001 + x;
}

void visit(int pos, int d) {
	//printf("visit(%d, %d)\n", pos, d);
	seen[pos] = 1;
	for (int doge : doges[pos]) {
		dists[id(pos, doge)] = d;
		q.push(id(pos, doge));
	}
}

int main() {
	scanf("%d %d", &N, &M);
	for (int i = 0; i < M; i++) {
		scanf("%d %d", b+i, p+i);
		doges[b[i]].push_back(p[i]);
	}
	visit(b[0], 0);
	while (q.size()) {
		int e = q.front(); q.pop();
		int loc = e / 30001, power = e % 30001;
		//printf("At (%d, %d) (dist %d)\n", loc, power, dists[e]);
		if (loc == b[1]) {
			printf("%d\n", dists[e]);
			return 0;
		}
		if (loc - power >= 0) {
			int pos = loc - power;
			int d = power;
			if (!seen[pos]) {
				visit(pos, dists[e] + 1);
			}
			if (dists.find(id(pos, d)) == dists.end()) {
				dists[id(pos, d)] = dists[e] + 1;
				q.push(id(pos, d));
			}
		}
		if (loc + power < N) {
			int pos = loc + power;
			int d = power;
			if (!seen[pos]) {
				visit(pos, dists[e] + 1);
			}
			if (dists.find(id(pos, d)) == dists.end()) {
				dists[id(pos, d)] = dists[e] + 1;
				q.push(id(pos, d));
			}
		}
	}
	printf("-1\n");
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:34:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &N, &M);
  ~~~~~^~~~~~~~~~~~~~~~~
skyscraper.cpp:36:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", b+i, p+i);
   ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1024 KB Output is correct
2 Correct 5 ms 1024 KB Output is correct
3 Correct 5 ms 1024 KB Output is correct
4 Correct 5 ms 1024 KB Output is correct
5 Correct 5 ms 1024 KB Output is correct
6 Correct 5 ms 1024 KB Output is correct
7 Correct 5 ms 1024 KB Output is correct
8 Correct 5 ms 1024 KB Output is correct
9 Correct 5 ms 1024 KB Output is correct
10 Correct 5 ms 1024 KB Output is correct
11 Correct 6 ms 1280 KB Output is correct
12 Correct 5 ms 1152 KB Output is correct
13 Correct 5 ms 1024 KB Output is correct
14 Correct 8 ms 1280 KB Output is correct
15 Correct 6 ms 1280 KB Output is correct
16 Correct 5 ms 1024 KB Output is correct
17 Correct 7 ms 1280 KB Output is correct
18 Correct 5 ms 1024 KB Output is correct
19 Correct 6 ms 1024 KB Output is correct
20 Correct 6 ms 1152 KB Output is correct
21 Correct 5 ms 1024 KB Output is correct
22 Correct 6 ms 1024 KB Output is correct
23 Correct 7 ms 1280 KB Output is correct
24 Correct 9 ms 1408 KB Output is correct
25 Correct 7 ms 1152 KB Output is correct
26 Correct 6 ms 1152 KB Output is correct
27 Correct 7 ms 1280 KB Output is correct
28 Correct 15 ms 2048 KB Output is correct
29 Correct 46 ms 3960 KB Output is correct
30 Correct 13 ms 1792 KB Output is correct
31 Correct 23 ms 2560 KB Output is correct
32 Correct 17 ms 2176 KB Output is correct
33 Correct 114 ms 6652 KB Output is correct
34 Correct 50 ms 4088 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1024 KB Output is correct
2 Correct 5 ms 1024 KB Output is correct
3 Correct 5 ms 1024 KB Output is correct
4 Correct 5 ms 1024 KB Output is correct
5 Correct 5 ms 1024 KB Output is correct
6 Correct 5 ms 1024 KB Output is correct
7 Correct 5 ms 1024 KB Output is correct
8 Correct 5 ms 1024 KB Output is correct
9 Correct 5 ms 1024 KB Output is correct
10 Correct 6 ms 1024 KB Output is correct
11 Correct 5 ms 1152 KB Output is correct
12 Correct 5 ms 1024 KB Output is correct
13 Correct 5 ms 1024 KB Output is correct
14 Correct 8 ms 1408 KB Output is correct
15 Correct 6 ms 1280 KB Output is correct
16 Correct 5 ms 1024 KB Output is correct
17 Correct 7 ms 1280 KB Output is correct
18 Correct 5 ms 1024 KB Output is correct
19 Correct 5 ms 1024 KB Output is correct
20 Correct 6 ms 1152 KB Output is correct
21 Correct 5 ms 1024 KB Output is correct
22 Correct 5 ms 1024 KB Output is correct
23 Correct 7 ms 1280 KB Output is correct
24 Correct 8 ms 1408 KB Output is correct
25 Correct 6 ms 1152 KB Output is correct
26 Correct 6 ms 1152 KB Output is correct
27 Correct 7 ms 1280 KB Output is correct
28 Correct 16 ms 2048 KB Output is correct
29 Correct 45 ms 3832 KB Output is correct
30 Correct 13 ms 1792 KB Output is correct
31 Correct 23 ms 2560 KB Output is correct
32 Correct 17 ms 2176 KB Output is correct
33 Correct 104 ms 6648 KB Output is correct
34 Correct 50 ms 4088 KB Output is correct
35 Correct 31 ms 3960 KB Output is correct
36 Correct 7 ms 1280 KB Output is correct
37 Correct 25 ms 3328 KB Output is correct
38 Correct 34 ms 4476 KB Output is correct
39 Correct 14 ms 1792 KB Output is correct
40 Correct 16 ms 2304 KB Output is correct
41 Correct 22 ms 3328 KB Output is correct
42 Correct 11 ms 1664 KB Output is correct
43 Correct 15 ms 1920 KB Output is correct
44 Correct 13 ms 1792 KB Output is correct
45 Correct 650 ms 24440 KB Output is correct
46 Correct 255 ms 14328 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1024 KB Output is correct
2 Correct 5 ms 1024 KB Output is correct
3 Correct 5 ms 1024 KB Output is correct
4 Correct 5 ms 1024 KB Output is correct
5 Correct 5 ms 1024 KB Output is correct
6 Correct 5 ms 1024 KB Output is correct
7 Correct 5 ms 1024 KB Output is correct
8 Correct 5 ms 1024 KB Output is correct
9 Correct 5 ms 1024 KB Output is correct
10 Correct 5 ms 1024 KB Output is correct
11 Correct 6 ms 1152 KB Output is correct
12 Correct 5 ms 1024 KB Output is correct
13 Correct 5 ms 1024 KB Output is correct
14 Correct 8 ms 1280 KB Output is correct
15 Correct 6 ms 1280 KB Output is correct
16 Correct 5 ms 1024 KB Output is correct
17 Correct 7 ms 1280 KB Output is correct
18 Correct 5 ms 1024 KB Output is correct
19 Correct 5 ms 1024 KB Output is correct
20 Correct 6 ms 1152 KB Output is correct
21 Correct 5 ms 1024 KB Output is correct
22 Correct 5 ms 1024 KB Output is correct
23 Correct 7 ms 1280 KB Output is correct
24 Correct 9 ms 1408 KB Output is correct
25 Correct 6 ms 1152 KB Output is correct
26 Correct 7 ms 1280 KB Output is correct
27 Correct 7 ms 1280 KB Output is correct
28 Correct 15 ms 2048 KB Output is correct
29 Correct 46 ms 3832 KB Output is correct
30 Correct 13 ms 1792 KB Output is correct
31 Correct 23 ms 2560 KB Output is correct
32 Correct 17 ms 2176 KB Output is correct
33 Correct 131 ms 6776 KB Output is correct
34 Correct 51 ms 4088 KB Output is correct
35 Correct 31 ms 3960 KB Output is correct
36 Correct 7 ms 1280 KB Output is correct
37 Correct 25 ms 3320 KB Output is correct
38 Correct 34 ms 4472 KB Output is correct
39 Correct 14 ms 1792 KB Output is correct
40 Correct 16 ms 2304 KB Output is correct
41 Correct 21 ms 3328 KB Output is correct
42 Correct 11 ms 1664 KB Output is correct
43 Correct 13 ms 1920 KB Output is correct
44 Correct 13 ms 1912 KB Output is correct
45 Correct 647 ms 24440 KB Output is correct
46 Correct 254 ms 14328 KB Output is correct
47 Correct 23 ms 3200 KB Output is correct
48 Correct 13 ms 1920 KB Output is correct
49 Correct 13 ms 1920 KB Output is correct
50 Correct 10 ms 1664 KB Output is correct
51 Correct 47 ms 4856 KB Output is correct
52 Correct 56 ms 5368 KB Output is correct
53 Correct 18 ms 2560 KB Output is correct
54 Correct 10 ms 1792 KB Output is correct
55 Correct 15 ms 2304 KB Output is correct
56 Correct 25 ms 3968 KB Output is correct
57 Correct 7 ms 1152 KB Output is correct
58 Correct 42 ms 4728 KB Output is correct
59 Correct 38 ms 4472 KB Output is correct
60 Correct 38 ms 4344 KB Output is correct
61 Correct 39 ms 4360 KB Output is correct
62 Correct 454 ms 23672 KB Output is correct
63 Execution timed out 1099 ms 37624 KB Time limit exceeded
64 Halted 0 ms 0 KB -