oj.uz

Submission #48203

# Submission time Handle Problem Language Result Execution time Memory
48203 2018-05-10T14:00:15 Z E869120 Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 262144 KB 
#include <iostream>
#include <queue>
#include <vector>
#include <map>
using namespace std;

int N, M, A[30009], P[30009]; vector<int>G[30009], dist[30009]; vector<vector<pair<short, short>>> 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(make_pair(qx, qy));
}

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++) {
		cin >> A[i] >> P[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;
			for (int j = A[i] % P[i]; j < N; j += P[i]) G[i].push_back(j);
			X[i].resize(G[i].size());
			dist[i].resize(G[i].size(), (1 << 30));
			for (int j = 0; j < G[i].size(); j++) {
				if (j == 0 || j + 1 == G[i].size()) X[i][j].resize(2);
				else X[i][j].resize(4);

				int cnt = 0;
				if (j + 1 < G[i].size()) {
					X[i][j][cnt] = make_pair(i, j + 1); cnt++;
					X[i][j][cnt] = make_pair(0, G[i][j + 1]); cnt++;
				}
				if (j >= 1) {
					X[i][j][cnt] = make_pair(i, j - 1); cnt++;
					X[i][j][cnt] = make_pair(0, G[i][j - 1]); cnt++;
				}
			}
		}
		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();
		for (int i = 0; i < X[pos1][pos2].size(); i++) {
			int to1 = X[pos1][pos2][i].first, to2 = X[pos1][pos2][i].second;
			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: In function 'int main()':
skyscraper.cpp:27:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int j = 0; j < G[i].size(); j++) {
                    ~~^~~~~~~~~~~~~
skyscraper.cpp:28:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if (j == 0 || j + 1 == G[i].size()) X[i][j].resize(2);
                   ~~~~~~^~~~~~~~~~~~~~
skyscraper.cpp:32:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if (j + 1 < G[i].size()) {
         ~~~~~~^~~~~~~~~~~~~
skyscraper.cpp:46: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:52:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < X[pos1][pos2].size(); 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 2532 KB Output is correct
3 Correct 3 ms 2532 KB Output is correct
4 Correct 3 ms 2532 KB Output is correct
5 Correct 4 ms 2532 KB Output is correct
6 Correct 3 ms 2532 KB Output is correct
7 Correct 3 ms 2656 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2716 KB Output is correct
2 Correct 3 ms 2744 KB Output is correct
3 Correct 3 ms 2744 KB Output is correct
4 Correct 3 ms 2744 KB Output is correct
5 Correct 3 ms 2744 KB Output is correct
6 Correct 3 ms 2744 KB Output is correct
7 Correct 4 ms 2744 KB Output is correct
8 Correct 3 ms 2744 KB Output is correct
9 Correct 3 ms 2744 KB Output is correct
10 Correct 4 ms 2812 KB Output is correct
11 Correct 6 ms 3196 KB Output is correct
12 Correct 4 ms 3196 KB Output is correct
13 Correct 6 ms 3196 KB Output is correct
14 Correct 10 ms 3300 KB Output is correct
15 Correct 7 ms 3324 KB Output is correct

Subtask #3
14.0 / 14.0

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

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 10908 KB Output is correct
2 Correct 3 ms 10908 KB Output is correct
3 Correct 3 ms 10908 KB Output is correct
4 Correct 3 ms 10908 KB Output is correct
5 Correct 3 ms 10908 KB Output is correct
6 Correct 3 ms 10908 KB Output is correct
7 Correct 3 ms 10908 KB Output is correct
8 Correct 3 ms 10908 KB Output is correct
9 Correct 3 ms 10908 KB Output is correct
10 Correct 4 ms 10908 KB Output is correct
11 Correct 9 ms 10908 KB Output is correct
12 Correct 4 ms 10908 KB Output is correct
13 Correct 6 ms 10908 KB Output is correct
14 Correct 7 ms 10908 KB Output is correct
15 Correct 7 ms 10908 KB Output is correct
16 Correct 5 ms 10908 KB Output is correct
17 Correct 8 ms 10908 KB Output is correct
18 Correct 8 ms 10908 KB Output is correct
19 Correct 5 ms 10908 KB Output is correct
20 Correct 5 ms 10908 KB Output is correct
21 Correct 7 ms 10908 KB Output is correct
22 Correct 7 ms 10908 KB Output is correct
23 Correct 6 ms 10908 KB Output is correct
24 Correct 9 ms 10908 KB Output is correct
25 Correct 8 ms 10908 KB Output is correct
26 Correct 6 ms 10908 KB Output is correct
27 Correct 6 ms 10908 KB Output is correct
28 Correct 10 ms 10908 KB Output is correct
29 Correct 14 ms 10908 KB Output is correct
30 Correct 6 ms 10908 KB Output is correct
31 Correct 11 ms 10908 KB Output is correct
32 Correct 10 ms 10908 KB Output is correct
33 Correct 32 ms 10908 KB Output is correct
34 Correct 28 ms 10908 KB Output is correct
35 Correct 82 ms 12924 KB Output is correct
36 Correct 14 ms 12924 KB Output is correct
37 Correct 89 ms 16560 KB Output is correct
38 Correct 106 ms 17240 KB Output is correct
39 Correct 124 ms 17404 KB Output is correct
40 Correct 124 ms 17404 KB Output is correct
41 Correct 107 ms 17404 KB Output is correct
42 Correct 38 ms 17404 KB Output is correct
43 Correct 38 ms 17404 KB Output is correct
44 Correct 37 ms 17404 KB Output is correct
45 Correct 285 ms 37884 KB Output is correct
46 Correct 248 ms 38000 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 38000 KB Output is correct
2 Correct 3 ms 38000 KB Output is correct
3 Correct 3 ms 38000 KB Output is correct
4 Correct 3 ms 38000 KB Output is correct
5 Correct 3 ms 38000 KB Output is correct
6 Correct 4 ms 38000 KB Output is correct
7 Correct 3 ms 38000 KB Output is correct
8 Correct 3 ms 38000 KB Output is correct
9 Correct 3 ms 38000 KB Output is correct
10 Correct 4 ms 38000 KB Output is correct
11 Correct 7 ms 38000 KB Output is correct
12 Correct 5 ms 38000 KB Output is correct
13 Correct 4 ms 38000 KB Output is correct
14 Correct 7 ms 38000 KB Output is correct
15 Correct 7 ms 38000 KB Output is correct
16 Correct 5 ms 38000 KB Output is correct
17 Correct 8 ms 38000 KB Output is correct
18 Correct 5 ms 38000 KB Output is correct
19 Correct 5 ms 38000 KB Output is correct
20 Correct 5 ms 38000 KB Output is correct
21 Correct 5 ms 38000 KB Output is correct
22 Correct 5 ms 38000 KB Output is correct
23 Correct 6 ms 38000 KB Output is correct
24 Correct 8 ms 38000 KB Output is correct
25 Correct 7 ms 38000 KB Output is correct
26 Correct 6 ms 38000 KB Output is correct
27 Correct 6 ms 38000 KB Output is correct
28 Correct 10 ms 38000 KB Output is correct
29 Correct 14 ms 38000 KB Output is correct
30 Correct 6 ms 38000 KB Output is correct
31 Correct 9 ms 38000 KB Output is correct
32 Correct 8 ms 38000 KB Output is correct
33 Correct 29 ms 38000 KB Output is correct
34 Correct 30 ms 38000 KB Output is correct
35 Correct 76 ms 38000 KB Output is correct
36 Correct 14 ms 38000 KB Output is correct
37 Correct 93 ms 38000 KB Output is correct
38 Correct 111 ms 38000 KB Output is correct
39 Correct 106 ms 38000 KB Output is correct
40 Correct 116 ms 38000 KB Output is correct
41 Correct 110 ms 38000 KB Output is correct
42 Correct 23 ms 38000 KB Output is correct
43 Correct 25 ms 38000 KB Output is correct
44 Correct 22 ms 38000 KB Output is correct
45 Correct 236 ms 38000 KB Output is correct
46 Correct 235 ms 38000 KB Output is correct
47 Correct 299 ms 54140 KB Output is correct
48 Correct 92 ms 54140 KB Output is correct
49 Correct 74 ms 54140 KB Output is correct
50 Correct 56 ms 54140 KB Output is correct
51 Correct 166 ms 54140 KB Output is correct
52 Correct 190 ms 54140 KB Output is correct
53 Correct 81 ms 54140 KB Output is correct
54 Correct 8 ms 54140 KB Output is correct
55 Correct 12 ms 54140 KB Output is correct
56 Correct 40 ms 54140 KB Output is correct
57 Correct 110 ms 54140 KB Output is correct
58 Correct 28 ms 54140 KB Output is correct
59 Correct 39 ms 54140 KB Output is correct
60 Correct 43 ms 54140 KB Output is correct
61 Correct 44 ms 54140 KB Output is correct
62 Correct 174 ms 54140 KB Output is correct
63 Correct 767 ms 154240 KB Output is correct
64 Correct 919 ms 188696 KB Output is correct
65 Execution timed out 1038 ms 262144 KB Time limit exceeded
66 Halted 0 ms 0 KB -