oj.uz

Submission #771279

# Submission time Handle Problem Language Result Execution time Memory
771279 2023-07-02T19:04:30 Z IBory Jakarta Skyscrapers (APIO15_skyscraper) C++17
100 / 100
 984 ms 113496 KB 
#include <bits/stdc++.h>
#define pii pair<int, int>
using namespace std;

const int MAX = 7777777;
vector<int> G[30003];
int D[MAX], L[MAX];
pii B[MAX];

int main() {
	ios::sync_with_stdio(0); cin.tie(0);
	int N, M;
	cin >> N >> M;
	map<pii, vector<int>> make;
	pii S, E;
	for (int i = 0; i < M; ++i) {
		int b, p;
		cin >> b >> p; b++;
		if (i == 0) S = { b, p };
		if (i == 1) E = { b, p };
		make[{p, b % p}].push_back(b);
	}

	int node = N + 1, SN, EN;
	for (auto& [q, v] : make) {
		auto [p, i] = q;
		if (!i) i += p;
		vector<int> fr;
		int init = node;
		B[init] = { p, i };
		for (int j = i; j <= N; j += p) {
			if (S == pii{ j, p }) SN = node;
			if (E == pii{ j, p }) EN = node;
			L[node] = init;
			fr.push_back(node++);
		}
		for (int n : v) {
			G[n].push_back(-fr[(n - 1) / p]);
		}
	}
	L[node] = 1;
	make.clear();

	memset(D, 0x3f, sizeof(D));
	D[SN] = 0;
	deque<int> Q;
	Q.push_back(SN);
	while (!Q.empty()) {
		int cur = Q.front(); Q.pop_front();
		if (cur == EN) break;

		if (cur <= N) {
			for (int next : G[cur]) {
				int d = 1;
				if (next < 0) {
					d = 0;
					next *= -1;
				}
				if (D[cur] + d >= D[next]) continue;
				D[next] = D[cur] + d;
				if (d == 0) Q.push_front(next);
				else Q.push_back(next);
			}
		}
		else {
			vector<int> AG;
			int t = L[cur];
			int RN = B[t].second + B[t].first * (cur - t);
			if (L[cur] != cur) AG.push_back(cur - 1);
			if (L[cur + 1] != (cur + 1)) AG.push_back(cur + 1);
			AG.push_back(-RN);

			for (int next : AG) {
				int d = 1;
				if (next < 0) {
					d = 0;
					next *= -1;
				}
				if (D[cur] + d >= D[next]) continue;
				D[next] = D[cur] + d;
				if (d == 0) Q.push_front(next);
				else Q.push_back(next);
			}
		}
	}

	cout << (D[EN] > 1E9 ? -1 : D[EN]);
	return 0;
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:87:15: warning: 'EN' may be used uninitialized in this function [-Wmaybe-uninitialized]
   87 |  cout << (D[EN] > 1E9 ? -1 : D[EN]);
      |           ~~~~^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 31464 KB Output is correct
2 Correct 11 ms 31476 KB Output is correct
3 Correct 12 ms 31444 KB Output is correct
4 Correct 580 ms 31628 KB Output is correct
5 Correct 12 ms 31444 KB Output is correct
6 Correct 12 ms 31444 KB Output is correct
7 Correct 11 ms 31444 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 31364 KB Output is correct
2 Correct 11 ms 31400 KB Output is correct
3 Correct 11 ms 31440 KB Output is correct
4 Correct 544 ms 31508 KB Output is correct
5 Correct 11 ms 31420 KB Output is correct
6 Correct 12 ms 31456 KB Output is correct
7 Correct 11 ms 31456 KB Output is correct
8 Correct 11 ms 31444 KB Output is correct
9 Correct 12 ms 31368 KB Output is correct
10 Correct 12 ms 31444 KB Output is correct
11 Correct 13 ms 31700 KB Output is correct
12 Correct 14 ms 31420 KB Output is correct
13 Correct 11 ms 31444 KB Output is correct
14 Correct 13 ms 31704 KB Output is correct
15 Correct 12 ms 31776 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 31444 KB Output is correct
2 Correct 11 ms 31412 KB Output is correct
3 Correct 13 ms 31444 KB Output is correct
4 Correct 501 ms 31484 KB Output is correct
5 Correct 12 ms 31444 KB Output is correct
6 Correct 12 ms 31468 KB Output is correct
7 Correct 11 ms 31360 KB Output is correct
8 Correct 11 ms 31444 KB Output is correct
9 Correct 12 ms 31424 KB Output is correct
10 Correct 13 ms 31484 KB Output is correct
11 Correct 16 ms 31692 KB Output is correct
12 Correct 12 ms 31484 KB Output is correct
13 Correct 13 ms 31412 KB Output is correct
14 Correct 13 ms 31700 KB Output is correct
15 Correct 13 ms 31700 KB Output is correct
16 Correct 12 ms 31588 KB Output is correct
17 Correct 13 ms 31848 KB Output is correct
18 Correct 13 ms 31628 KB Output is correct
19 Correct 12 ms 31564 KB Output is correct
20 Correct 13 ms 31572 KB Output is correct
21 Correct 13 ms 31628 KB Output is correct
22 Correct 12 ms 31592 KB Output is correct
23 Correct 13 ms 31572 KB Output is correct
24 Correct 14 ms 31828 KB Output is correct
25 Correct 15 ms 31816 KB Output is correct
26 Correct 12 ms 31488 KB Output is correct
27 Correct 12 ms 31572 KB Output is correct
28 Correct 15 ms 31944 KB Output is correct
29 Correct 17 ms 32264 KB Output is correct
30 Correct 14 ms 31700 KB Output is correct
31 Correct 15 ms 31932 KB Output is correct
32 Correct 14 ms 31752 KB Output is correct
33 Correct 23 ms 33120 KB Output is correct
34 Correct 18 ms 33120 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 31444 KB Output is correct
2 Correct 12 ms 31404 KB Output is correct
3 Correct 12 ms 31440 KB Output is correct
4 Correct 515 ms 31516 KB Output is correct
5 Correct 12 ms 31444 KB Output is correct
6 Correct 12 ms 31388 KB Output is correct
7 Correct 12 ms 31416 KB Output is correct
8 Correct 12 ms 31368 KB Output is correct
9 Correct 12 ms 31488 KB Output is correct
10 Correct 12 ms 31532 KB Output is correct
11 Correct 12 ms 31612 KB Output is correct
12 Correct 12 ms 31444 KB Output is correct
13 Correct 12 ms 31432 KB Output is correct
14 Correct 13 ms 31700 KB Output is correct
15 Correct 12 ms 31772 KB Output is correct
16 Correct 14 ms 31624 KB Output is correct
17 Correct 13 ms 31828 KB Output is correct
18 Correct 12 ms 31580 KB Output is correct
19 Correct 12 ms 31608 KB Output is correct
20 Correct 12 ms 31576 KB Output is correct
21 Correct 12 ms 31572 KB Output is correct
22 Correct 13 ms 31532 KB Output is correct
23 Correct 13 ms 31572 KB Output is correct
24 Correct 16 ms 31828 KB Output is correct
25 Correct 13 ms 31700 KB Output is correct
26 Correct 12 ms 31512 KB Output is correct
27 Correct 13 ms 31572 KB Output is correct
28 Correct 15 ms 31936 KB Output is correct
29 Correct 17 ms 32212 KB Output is correct
30 Correct 13 ms 31688 KB Output is correct
31 Correct 15 ms 31856 KB Output is correct
32 Correct 14 ms 31700 KB Output is correct
33 Correct 23 ms 33112 KB Output is correct
34 Correct 19 ms 33052 KB Output is correct
35 Correct 30 ms 35588 KB Output is correct
36 Correct 14 ms 32212 KB Output is correct
37 Correct 27 ms 35652 KB Output is correct
38 Correct 35 ms 36840 KB Output is correct
39 Correct 28 ms 36764 KB Output is correct
40 Correct 30 ms 36712 KB Output is correct
41 Correct 28 ms 36812 KB Output is correct
42 Correct 14 ms 32000 KB Output is correct
43 Correct 18 ms 32008 KB Output is correct
44 Correct 14 ms 31848 KB Output is correct
45 Correct 73 ms 40580 KB Output is correct
46 Correct 56 ms 40532 KB Output is correct

Subtask #5
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 31444 KB Output is correct
2 Correct 11 ms 31444 KB Output is correct
3 Correct 12 ms 31444 KB Output is correct
4 Correct 546 ms 31504 KB Output is correct
5 Correct 12 ms 31444 KB Output is correct
6 Correct 13 ms 31444 KB Output is correct
7 Correct 11 ms 31476 KB Output is correct
8 Correct 11 ms 31444 KB Output is correct
9 Correct 12 ms 31444 KB Output is correct
10 Correct 12 ms 31444 KB Output is correct
11 Correct 12 ms 31672 KB Output is correct
12 Correct 12 ms 31468 KB Output is correct
13 Correct 13 ms 31444 KB Output is correct
14 Correct 13 ms 31700 KB Output is correct
15 Correct 16 ms 31680 KB Output is correct
16 Correct 12 ms 31572 KB Output is correct
17 Correct 13 ms 31816 KB Output is correct
18 Correct 13 ms 31600 KB Output is correct
19 Correct 12 ms 31572 KB Output is correct
20 Correct 13 ms 31572 KB Output is correct
21 Correct 12 ms 31572 KB Output is correct
22 Correct 12 ms 31572 KB Output is correct
23 Correct 13 ms 31584 KB Output is correct
24 Correct 14 ms 31812 KB Output is correct
25 Correct 13 ms 31700 KB Output is correct
26 Correct 12 ms 31492 KB Output is correct
27 Correct 13 ms 31588 KB Output is correct
28 Correct 15 ms 31932 KB Output is correct
29 Correct 18 ms 32212 KB Output is correct
30 Correct 15 ms 31704 KB Output is correct
31 Correct 14 ms 31828 KB Output is correct
32 Correct 14 ms 31752 KB Output is correct
33 Correct 22 ms 33108 KB Output is correct
34 Correct 19 ms 33108 KB Output is correct
35 Correct 30 ms 35668 KB Output is correct
36 Correct 15 ms 32188 KB Output is correct
37 Correct 27 ms 35656 KB Output is correct
38 Correct 33 ms 36820 KB Output is correct
39 Correct 28 ms 36772 KB Output is correct
40 Correct 31 ms 36724 KB Output is correct
41 Correct 34 ms 36784 KB Output is correct
42 Correct 16 ms 31900 KB Output is correct
43 Correct 17 ms 31960 KB Output is correct
44 Correct 15 ms 31872 KB Output is correct
45 Correct 74 ms 40572 KB Output is correct
46 Correct 55 ms 40576 KB Output is correct
47 Correct 33 ms 42196 KB Output is correct
48 Correct 23 ms 36556 KB Output is correct
49 Correct 23 ms 35680 KB Output is correct
50 Correct 22 ms 34824 KB Output is correct
51 Correct 43 ms 38272 KB Output is correct
52 Correct 39 ms 38488 KB Output is correct
53 Correct 29 ms 35892 KB Output is correct
54 Correct 515 ms 31752 KB Output is correct
55 Correct 510 ms 31864 KB Output is correct
56 Correct 18 ms 32564 KB Output is correct
57 Correct 15 ms 34644 KB Output is correct
58 Correct 19 ms 32220 KB Output is correct
59 Correct 18 ms 32348 KB Output is correct
60 Correct 18 ms 32684 KB Output is correct
61 Correct 24 ms 32768 KB Output is correct
62 Correct 81 ms 40148 KB Output is correct
63 Correct 272 ms 61544 KB Output is correct
64 Correct 385 ms 67624 KB Output is correct
65 Correct 490 ms 82132 KB Output is correct
66 Correct 984 ms 113496 KB Output is correct
67 Correct 598 ms 113492 KB Output is correct