oj.uz

Submission #63823

# Submission time Handle Problem Language Result Execution time Memory
63823 2018-08-03T03:58:54 Z kingpig9 Jakarta Skyscrapers (APIO15_skyscraper) C++11
100 / 100
 171 ms 16616 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 30010;

#define debug(...) fprintf(stderr, __VA_ARGS__)
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
#define fillchar(a, s) memset((a), (s), sizeof(a))

int N, M;
int S, T;
vector<int> jump[MAXN];
int dist[MAXN];
bool vis[MAXN];

int main() {
	scanf("%d %d", &N, &M);
	for (int i = 0; i < M; i++) {
		int x, p;
		scanf("%d %d", &x, &p);
		jump[x].push_back(p);
		if (i == 0) {
			S = x;
		} else if (i == 1) {
			T = x;
		}
	}

	for (int i = 0; i < N; i++) {
		sort(all(jump[i]));
		jump[i].resize(unique(all(jump[i])) - jump[i].begin());
	}

	for (int i = 0; i < N; i++) {
		dist[i] = INT_MAX / 2;
	}
	dist[S] = 0;

	priority_queue<pii, vector<pii>, greater<pii>> pq;
	pq.push({0, S});
	while (!pq.empty()) {
		int w = pq.top().fi;
		int u = pq.top().se;
		pq.pop();

		if (u == T) {
			printf("%d\n", w);
			return 0;
		}

		if (vis[u]) {
			continue;
		}
		vis[u] = true;

		for (int p : jump[u]) {
			for (int i = 1; u + i * p < N; i++) {
				int v = u + i * p;
				int nw = w + i;
				if (dist[v] > nw) {
					dist[v] = nw;
					pq.push({nw, v});
				}
				if (binary_search(all(jump[v]), p)) {
					break;
				}
			}

			for (int i = 1; u - i * p >= 0; i++) {
				int v = u - i * p;
				int nw = w + i;
				if (dist[v] > nw) {
					dist[v] = nw;
					pq.push({nw, v});
				}
				if (binary_search(all(jump[v]), p)) {
					break;
				}
			}
		}
	}
	puts("-1");
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:23: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:26:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &x, &p);
   ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1588 KB Output is correct
2 Correct 4 ms 1696 KB Output is correct
3 Correct 4 ms 1696 KB Output is correct
4 Correct 4 ms 1696 KB Output is correct
5 Correct 3 ms 1696 KB Output is correct
6 Correct 4 ms 1696 KB Output is correct
7 Correct 3 ms 1696 KB Output is correct
8 Correct 3 ms 1696 KB Output is correct
9 Correct 3 ms 1696 KB Output is correct
10 Correct 3 ms 1696 KB Output is correct
11 Correct 4 ms 1696 KB Output is correct
12 Correct 3 ms 1696 KB Output is correct
13 Correct 4 ms 1696 KB Output is correct
14 Correct 4 ms 1824 KB Output is correct
15 Correct 5 ms 1824 KB Output is correct
16 Correct 5 ms 1824 KB Output is correct
17 Correct 5 ms 1824 KB Output is correct
18 Correct 5 ms 1824 KB Output is correct
19 Correct 4 ms 1824 KB Output is correct
20 Correct 5 ms 1840 KB Output is correct
21 Correct 4 ms 1840 KB Output is correct
22 Correct 4 ms 1840 KB Output is correct
23 Correct 5 ms 1840 KB Output is correct
24 Correct 5 ms 1856 KB Output is correct
25 Correct 5 ms 1856 KB Output is correct
26 Correct 5 ms 1856 KB Output is correct
27 Correct 5 ms 1876 KB Output is correct
28 Correct 4 ms 1960 KB Output is correct
29 Correct 8 ms 2108 KB Output is correct
30 Correct 5 ms 2108 KB Output is correct
31 Correct 7 ms 2108 KB Output is correct
32 Correct 3 ms 2108 KB Output is correct
33 Correct 8 ms 2256 KB Output is correct
34 Correct 8 ms 2388 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2388 KB Output is correct
2 Correct 3 ms 2388 KB Output is correct
3 Correct 2 ms 2388 KB Output is correct
4 Correct 3 ms 2388 KB Output is correct
5 Correct 3 ms 2388 KB Output is correct
6 Correct 4 ms 2388 KB Output is correct
7 Correct 4 ms 2388 KB Output is correct
8 Correct 3 ms 2388 KB Output is correct
9 Correct 4 ms 2388 KB Output is correct
10 Correct 4 ms 2388 KB Output is correct
11 Correct 3 ms 2388 KB Output is correct
12 Correct 3 ms 2388 KB Output is correct
13 Correct 5 ms 2388 KB Output is correct
14 Correct 5 ms 2388 KB Output is correct
15 Correct 5 ms 2388 KB Output is correct
16 Correct 4 ms 2388 KB Output is correct
17 Correct 6 ms 2388 KB Output is correct
18 Correct 5 ms 2388 KB Output is correct
19 Correct 4 ms 2388 KB Output is correct
20 Correct 4 ms 2388 KB Output is correct
21 Correct 6 ms 2388 KB Output is correct
22 Correct 4 ms 2388 KB Output is correct
23 Correct 5 ms 2388 KB Output is correct
24 Correct 6 ms 2388 KB Output is correct
25 Correct 5 ms 2388 KB Output is correct
26 Correct 4 ms 2388 KB Output is correct
27 Correct 4 ms 2388 KB Output is correct
28 Correct 5 ms 2388 KB Output is correct
29 Correct 8 ms 2440 KB Output is correct
30 Correct 5 ms 2440 KB Output is correct
31 Correct 5 ms 2440 KB Output is correct
32 Correct 5 ms 2512 KB Output is correct
33 Correct 9 ms 2716 KB Output is correct
34 Correct 8 ms 2716 KB Output is correct
35 Correct 21 ms 2744 KB Output is correct
36 Correct 6 ms 2744 KB Output is correct
37 Correct 14 ms 3004 KB Output is correct
38 Correct 17 ms 3324 KB Output is correct
39 Correct 19 ms 3460 KB Output is correct
40 Correct 15 ms 3724 KB Output is correct
41 Correct 18 ms 4244 KB Output is correct
42 Correct 11 ms 4244 KB Output is correct
43 Correct 11 ms 4416 KB Output is correct
44 Correct 12 ms 4668 KB Output is correct
45 Correct 26 ms 5260 KB Output is correct
46 Correct 17 ms 5408 KB Output is correct

Subtask #5
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5408 KB Output is correct
2 Correct 4 ms 5408 KB Output is correct
3 Correct 3 ms 5408 KB Output is correct
4 Correct 3 ms 5408 KB Output is correct
5 Correct 3 ms 5408 KB Output is correct
6 Correct 5 ms 5408 KB Output is correct
7 Correct 5 ms 5408 KB Output is correct
8 Correct 4 ms 5408 KB Output is correct
9 Correct 3 ms 5408 KB Output is correct
10 Correct 5 ms 5408 KB Output is correct
11 Correct 4 ms 5408 KB Output is correct
12 Correct 4 ms 5408 KB Output is correct
13 Correct 5 ms 5408 KB Output is correct
14 Correct 4 ms 5408 KB Output is correct
15 Correct 4 ms 5408 KB Output is correct
16 Correct 4 ms 5408 KB Output is correct
17 Correct 6 ms 5408 KB Output is correct
18 Correct 4 ms 5408 KB Output is correct
19 Correct 4 ms 5408 KB Output is correct
20 Correct 5 ms 5408 KB Output is correct
21 Correct 4 ms 5408 KB Output is correct
22 Correct 4 ms 5408 KB Output is correct
23 Correct 5 ms 5408 KB Output is correct
24 Correct 5 ms 5408 KB Output is correct
25 Correct 5 ms 5408 KB Output is correct
26 Correct 5 ms 5408 KB Output is correct
27 Correct 3 ms 5408 KB Output is correct
28 Correct 7 ms 5408 KB Output is correct
29 Correct 6 ms 5408 KB Output is correct
30 Correct 5 ms 5408 KB Output is correct
31 Correct 6 ms 5408 KB Output is correct
32 Correct 4 ms 5408 KB Output is correct
33 Correct 10 ms 5608 KB Output is correct
34 Correct 7 ms 5608 KB Output is correct
35 Correct 16 ms 5696 KB Output is correct
36 Correct 8 ms 5696 KB Output is correct
37 Correct 14 ms 5960 KB Output is correct
38 Correct 15 ms 6248 KB Output is correct
39 Correct 15 ms 6384 KB Output is correct
40 Correct 14 ms 6832 KB Output is correct
41 Correct 17 ms 6996 KB Output is correct
42 Correct 14 ms 7192 KB Output is correct
43 Correct 12 ms 7496 KB Output is correct
44 Correct 13 ms 7580 KB Output is correct
45 Correct 22 ms 8076 KB Output is correct
46 Correct 16 ms 8288 KB Output is correct
47 Correct 26 ms 9012 KB Output is correct
48 Correct 17 ms 9012 KB Output is correct
49 Correct 14 ms 9012 KB Output is correct
50 Correct 11 ms 9128 KB Output is correct
51 Correct 35 ms 10268 KB Output is correct
52 Correct 33 ms 10600 KB Output is correct
53 Correct 23 ms 10600 KB Output is correct
54 Correct 6 ms 10600 KB Output is correct
55 Correct 7 ms 10600 KB Output is correct
56 Correct 19 ms 10900 KB Output is correct
57 Correct 6 ms 10900 KB Output is correct
58 Correct 15 ms 10900 KB Output is correct
59 Correct 24 ms 10900 KB Output is correct
60 Correct 14 ms 10992 KB Output is correct
61 Correct 15 ms 11200 KB Output is correct
62 Correct 24 ms 12088 KB Output is correct
63 Correct 60 ms 13880 KB Output is correct
64 Correct 71 ms 13916 KB Output is correct
65 Correct 89 ms 14272 KB Output is correct
66 Correct 171 ms 16404 KB Output is correct
67 Correct 113 ms 16616 KB Output is correct