oj.uz

Submission #48214

# Submission time Handle Problem Language Result Execution time Memory
48214 2018-05-10T14:30:34 Z E869120 Jakarta Skyscrapers (APIO15_skyscraper) C++14
100 / 100
 659 ms 50284 KB 
#include <iostream>
#include <queue>
#include <vector>
#include <map>
using namespace std;
#pragma warning (disable: 4996)

int N, M, A[30009], P[30009]; vector<short>G[30009]; vector<int>dist[30009]; vector<vector<int>> X[30009];
map<pair<int, int>, int>M1; queue<pair<int, int>>Q;

void connect(int px, int py, int qx, int qy) {
	X[px][py].emplace_back((qx << 15) + qy);
}
int constant(int u1, int u2) {
	return (u1 << 15) + u2;
}

int main() {
	cin >> N >> M;
	for (int i = 0; i < N; i++) G[0].push_back(i);
	X[0].resize(G[0].size());
	dist[0].resize(G[0].size(), (1 << 30));

	for (int i = 1; i <= M; i++) scanf("%d%d", &A[i], &P[i]);
	for (int i = 1; i <= M; i++) {
		int J = M1[make_pair(A[i] % P[i], P[i])];
		if (J == 0) {
			M1[make_pair(A[i] % P[i], P[i])] = i; J = i; int BB = A[i] % P[i];
			G[i].resize(((N - 1) - BB) / P[i] + 1);
			int CC = 0; for (int j = A[i] % P[i]; j < N; j += P[i]) { G[i][CC] = j; CC++; }

			dist[i].resize(G[i].size(), (1 << 30));
		}
		int pos1 = lower_bound(G[J].begin(), G[J].end(), A[i]) - G[J].begin();
		if (A[i] + P[i] < N) connect(0, A[i], 0, A[i] + P[i]);
		if (A[i] - P[i] >= 0) connect(0, A[i], 0, A[i] - P[i]);
		if (pos1 >= 1) connect(0, A[i], J, pos1 - 1);
		if (pos1 + 1 < G[J].size()) connect(0, A[i], J, pos1 + 1);
	}
	dist[0][A[1]] = 0; Q.push(make_pair(0, A[1]));

	while (!Q.empty()) {
		int pos1 = Q.front().first, pos2 = Q.front().second; Q.pop();
		if (pos1 == 0 && pos2 == A[2]) break;
		if (pos1 == 0) {
			for (int i = 0; i < X[pos1][pos2].size(); i++) {
				int D = X[pos1][pos2][i];
				int to1 = (D >> 15), to2 = (D & 32767);
				if (dist[to1][to2] > dist[pos1][pos2] + 1) {
					dist[to1][to2] = dist[pos1][pos2] + 1;
					Q.push(make_pair(to1, to2));
				}
			}
		}
		if (pos1 >= 1) {
			for (int j = -1; j <= 1; j += 2) {
				int to1 = pos1, to2 = pos2 + j; if (to2 < 0 || to2 >= G[pos1].size()) continue;
				if (dist[to1][to2] > dist[pos1][pos2] + 1) {
					dist[to1][to2] = dist[pos1][pos2] + 1;
					Q.push(make_pair(to1, to2));
				}
			}
			for (int j = -1; j <= 1; j += 2) {
				int to1 = pos1, to2 = pos2 + j; if (to2 < 0 || to2 >= G[pos1].size()) continue;
				to2 = G[to1][to2]; to1 = 0;
				if (dist[to1][to2] > dist[pos1][pos2] + 1) {
					dist[to1][to2] = dist[pos1][pos2] + 1;
					Q.push(make_pair(to1, to2));
				}
			}
		}
	}
	if (dist[0][A[2]] == (1 << 30)) dist[0][A[2]] = -1;
	cout << dist[0][A[2]] << endl;
	return 0;
}

Compilation message

skyscraper.cpp:6:0: warning: ignoring #pragma warning  [-Wunknown-pragmas]
 #pragma warning (disable: 4996)
 
skyscraper.cpp: In function 'int main()':
skyscraper.cpp:38:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if (pos1 + 1 < G[J].size()) connect(0, A[i], J, pos1 + 1);
       ~~~~~~~~~^~~~~~~~~~~~~
skyscraper.cpp:46:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int i = 0; i < X[pos1][pos2].size(); i++) {
                    ~~^~~~~~~~~~~~~~~~~~~~~~
skyscraper.cpp:57:56: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     int to1 = pos1, to2 = pos2 + j; if (to2 < 0 || to2 >= G[pos1].size()) continue;
                                                    ~~~~^~~~~~~~~~~~~~~~~
skyscraper.cpp:64:56: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     int to1 = pos1, to2 = pos2 + j; if (to2 < 0 || to2 >= G[pos1].size()) continue;
                                                    ~~~~^~~~~~~~~~~~~~~~~
skyscraper.cpp:24:36: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (int i = 1; i <= M; i++) scanf("%d%d", &A[i], &P[i]);
                               ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2584 KB Output is correct
2 Correct 4 ms 2632 KB Output is correct
3 Correct 3 ms 2760 KB Output is correct
4 Correct 3 ms 2760 KB Output is correct
5 Correct 3 ms 2760 KB Output is correct
6 Correct 4 ms 2760 KB Output is correct
7 Correct 3 ms 2760 KB Output is correct
8 Correct 3 ms 2760 KB Output is correct
9 Correct 4 ms 2848 KB Output is correct
10 Correct 4 ms 2848 KB Output is correct
11 Correct 5 ms 2940 KB Output is correct
12 Correct 4 ms 2940 KB Output is correct
13 Correct 4 ms 2940 KB Output is correct
14 Correct 5 ms 2940 KB Output is correct
15 Correct 5 ms 2940 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2940 KB Output is correct
2 Correct 3 ms 2940 KB Output is correct
3 Correct 4 ms 2940 KB Output is correct
4 Correct 4 ms 2940 KB Output is correct
5 Correct 4 ms 2940 KB Output is correct
6 Correct 4 ms 2940 KB Output is correct
7 Correct 4 ms 2940 KB Output is correct
8 Correct 4 ms 2940 KB Output is correct
9 Correct 3 ms 2940 KB Output is correct
10 Correct 5 ms 2940 KB Output is correct
11 Correct 6 ms 2940 KB Output is correct
12 Correct 4 ms 2940 KB Output is correct
13 Correct 4 ms 2940 KB Output is correct
14 Correct 5 ms 2940 KB Output is correct
15 Correct 5 ms 2940 KB Output is correct
16 Correct 4 ms 2940 KB Output is correct
17 Correct 6 ms 3068 KB Output is correct
18 Correct 6 ms 3068 KB Output is correct
19 Correct 4 ms 3068 KB Output is correct
20 Correct 6 ms 3068 KB Output is correct
21 Correct 4 ms 3068 KB Output is correct
22 Correct 4 ms 3068 KB Output is correct
23 Correct 5 ms 3068 KB Output is correct
24 Correct 6 ms 3068 KB Output is correct
25 Correct 6 ms 3068 KB Output is correct
26 Correct 5 ms 3068 KB Output is correct
27 Correct 5 ms 3068 KB Output is correct
28 Correct 6 ms 3200 KB Output is correct
29 Correct 6 ms 3320 KB Output is correct
30 Correct 4 ms 3320 KB Output is correct
31 Correct 5 ms 3320 KB Output is correct
32 Correct 4 ms 3320 KB Output is correct
33 Correct 10 ms 3644 KB Output is correct
34 Correct 10 ms 3708 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3708 KB Output is correct
2 Correct 3 ms 3708 KB Output is correct
3 Correct 3 ms 3708 KB Output is correct
4 Correct 3 ms 3708 KB Output is correct
5 Correct 3 ms 3708 KB Output is correct
6 Correct 3 ms 3708 KB Output is correct
7 Correct 3 ms 3708 KB Output is correct
8 Correct 3 ms 3708 KB Output is correct
9 Correct 3 ms 3708 KB Output is correct
10 Correct 4 ms 3708 KB Output is correct
11 Correct 5 ms 3708 KB Output is correct
12 Correct 4 ms 3708 KB Output is correct
13 Correct 4 ms 3708 KB Output is correct
14 Correct 5 ms 3708 KB Output is correct
15 Correct 5 ms 3708 KB Output is correct
16 Correct 4 ms 3708 KB Output is correct
17 Correct 5 ms 3708 KB Output is correct
18 Correct 4 ms 3708 KB Output is correct
19 Correct 4 ms 3708 KB Output is correct
20 Correct 4 ms 3708 KB Output is correct
21 Correct 4 ms 3708 KB Output is correct
22 Correct 4 ms 3708 KB Output is correct
23 Correct 5 ms 3708 KB Output is correct
24 Correct 6 ms 3708 KB Output is correct
25 Correct 6 ms 3708 KB Output is correct
26 Correct 4 ms 3708 KB Output is correct
27 Correct 4 ms 3708 KB Output is correct
28 Correct 6 ms 3708 KB Output is correct
29 Correct 6 ms 3708 KB Output is correct
30 Correct 4 ms 3708 KB Output is correct
31 Correct 5 ms 3708 KB Output is correct
32 Correct 5 ms 3708 KB Output is correct
33 Correct 11 ms 3716 KB Output is correct
34 Correct 8 ms 3716 KB Output is correct
35 Correct 35 ms 6780 KB Output is correct
36 Correct 11 ms 6780 KB Output is correct
37 Correct 39 ms 6780 KB Output is correct
38 Correct 37 ms 7676 KB Output is correct
39 Correct 37 ms 7676 KB Output is correct
40 Correct 37 ms 7676 KB Output is correct
41 Correct 42 ms 7676 KB Output is correct
42 Correct 19 ms 7676 KB Output is correct
43 Correct 11 ms 7676 KB Output is correct
44 Correct 20 ms 7676 KB Output is correct
45 Correct 67 ms 9408 KB Output is correct
46 Correct 86 ms 9408 KB Output is correct

Subtask #5
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9408 KB Output is correct
2 Correct 4 ms 9408 KB Output is correct
3 Correct 3 ms 9408 KB Output is correct
4 Correct 3 ms 9408 KB Output is correct
5 Correct 5 ms 9408 KB Output is correct
6 Correct 4 ms 9408 KB Output is correct
7 Correct 4 ms 9408 KB Output is correct
8 Correct 4 ms 9408 KB Output is correct
9 Correct 4 ms 9408 KB Output is correct
10 Correct 4 ms 9408 KB Output is correct
11 Correct 5 ms 9408 KB Output is correct
12 Correct 5 ms 9408 KB Output is correct
13 Correct 4 ms 9408 KB Output is correct
14 Correct 5 ms 9408 KB Output is correct
15 Correct 5 ms 9408 KB Output is correct
16 Correct 5 ms 9408 KB Output is correct
17 Correct 5 ms 9408 KB Output is correct
18 Correct 5 ms 9408 KB Output is correct
19 Correct 4 ms 9408 KB Output is correct
20 Correct 5 ms 9408 KB Output is correct
21 Correct 4 ms 9408 KB Output is correct
22 Correct 5 ms 9408 KB Output is correct
23 Correct 5 ms 9408 KB Output is correct
24 Correct 5 ms 9408 KB Output is correct
25 Correct 6 ms 9408 KB Output is correct
26 Correct 4 ms 9408 KB Output is correct
27 Correct 4 ms 9408 KB Output is correct
28 Correct 6 ms 9408 KB Output is correct
29 Correct 7 ms 9408 KB Output is correct
30 Correct 4 ms 9408 KB Output is correct
31 Correct 5 ms 9408 KB Output is correct
32 Correct 4 ms 9408 KB Output is correct
33 Correct 11 ms 9408 KB Output is correct
34 Correct 8 ms 9408 KB Output is correct
35 Correct 32 ms 9408 KB Output is correct
36 Correct 8 ms 9408 KB Output is correct
37 Correct 27 ms 9408 KB Output is correct
38 Correct 54 ms 9408 KB Output is correct
39 Correct 38 ms 9408 KB Output is correct
40 Correct 37 ms 9408 KB Output is correct
41 Correct 43 ms 9408 KB Output is correct
42 Correct 11 ms 9408 KB Output is correct
43 Correct 11 ms 9408 KB Output is correct
44 Correct 11 ms 9408 KB Output is correct
45 Correct 70 ms 9408 KB Output is correct
46 Correct 53 ms 9408 KB Output is correct
47 Correct 41 ms 10492 KB Output is correct
48 Correct 34 ms 10492 KB Output is correct
49 Correct 32 ms 10492 KB Output is correct
50 Correct 22 ms 10492 KB Output is correct
51 Correct 50 ms 10492 KB Output is correct
52 Correct 50 ms 10492 KB Output is correct
53 Correct 38 ms 10492 KB Output is correct
54 Correct 5 ms 10492 KB Output is correct
55 Correct 5 ms 10492 KB Output is correct
56 Correct 23 ms 10492 KB Output is correct
57 Correct 8 ms 10492 KB Output is correct
58 Correct 13 ms 10492 KB Output is correct
59 Correct 14 ms 10492 KB Output is correct
60 Correct 14 ms 10492 KB Output is correct
61 Correct 16 ms 10492 KB Output is correct
62 Correct 63 ms 10492 KB Output is correct
63 Correct 202 ms 20604 KB Output is correct
64 Correct 240 ms 23680 KB Output is correct
65 Correct 328 ms 30972 KB Output is correct
66 Correct 659 ms 50052 KB Output is correct
67 Correct 355 ms 50284 KB Output is correct