oj.uz

Submission #771271

# Submission time Handle Problem Language Result Execution time Memory
771271 2023-07-02T18:56:49 Z IBory Jakarta Skyscrapers (APIO15_skyscraper) C++17
100 / 100
 967 ms 122396 KB 
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
#define pii pair<int, int>
using namespace std;

const int MAX = 9999999;
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:91:15: warning: 'EN' may be used uninitialized in this function [-Wmaybe-uninitialized]
   91 |  cout << (D[EN] > 1E9 ? -1 : D[EN]);
      |           ~~~~^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 40148 KB Output is correct
2 Correct 15 ms 40048 KB Output is correct
3 Correct 16 ms 40148 KB Output is correct
4 Correct 643 ms 40308 KB Output is correct
5 Correct 16 ms 40148 KB Output is correct
6 Correct 16 ms 40148 KB Output is correct
7 Correct 15 ms 40132 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 40148 KB Output is correct
2 Correct 15 ms 40148 KB Output is correct
3 Correct 15 ms 40076 KB Output is correct
4 Correct 640 ms 40176 KB Output is correct
5 Correct 15 ms 40148 KB Output is correct
6 Correct 15 ms 40140 KB Output is correct
7 Correct 15 ms 40148 KB Output is correct
8 Correct 16 ms 40092 KB Output is correct
9 Correct 16 ms 40132 KB Output is correct
10 Correct 16 ms 40140 KB Output is correct
11 Correct 16 ms 40408 KB Output is correct
12 Correct 18 ms 40136 KB Output is correct
13 Correct 15 ms 40148 KB Output is correct
14 Correct 16 ms 40404 KB Output is correct
15 Correct 16 ms 40404 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 40072 KB Output is correct
2 Correct 15 ms 40064 KB Output is correct
3 Correct 15 ms 40168 KB Output is correct
4 Correct 670 ms 40164 KB Output is correct
5 Correct 14 ms 40148 KB Output is correct
6 Correct 16 ms 40148 KB Output is correct
7 Correct 15 ms 40084 KB Output is correct
8 Correct 15 ms 40084 KB Output is correct
9 Correct 16 ms 40148 KB Output is correct
10 Correct 16 ms 40148 KB Output is correct
11 Correct 16 ms 40288 KB Output is correct
12 Correct 16 ms 40148 KB Output is correct
13 Correct 16 ms 40164 KB Output is correct
14 Correct 16 ms 40404 KB Output is correct
15 Correct 16 ms 40444 KB Output is correct
16 Correct 15 ms 40296 KB Output is correct
17 Correct 17 ms 40532 KB Output is correct
18 Correct 16 ms 40340 KB Output is correct
19 Correct 15 ms 40260 KB Output is correct
20 Correct 16 ms 40148 KB Output is correct
21 Correct 18 ms 40276 KB Output is correct
22 Correct 15 ms 40312 KB Output is correct
23 Correct 16 ms 40276 KB Output is correct
24 Correct 19 ms 40532 KB Output is correct
25 Correct 16 ms 40404 KB Output is correct
26 Correct 15 ms 40280 KB Output is correct
27 Correct 15 ms 40276 KB Output is correct
28 Correct 19 ms 40708 KB Output is correct
29 Correct 20 ms 40900 KB Output is correct
30 Correct 17 ms 40380 KB Output is correct
31 Correct 18 ms 40556 KB Output is correct
32 Correct 18 ms 40404 KB Output is correct
33 Correct 26 ms 41812 KB Output is correct
34 Correct 22 ms 41804 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 40076 KB Output is correct
2 Correct 15 ms 40052 KB Output is correct
3 Correct 16 ms 40112 KB Output is correct
4 Correct 652 ms 40164 KB Output is correct
5 Correct 15 ms 40148 KB Output is correct
6 Correct 15 ms 40160 KB Output is correct
7 Correct 15 ms 40076 KB Output is correct
8 Correct 15 ms 40072 KB Output is correct
9 Correct 15 ms 40072 KB Output is correct
10 Correct 17 ms 40224 KB Output is correct
11 Correct 16 ms 40404 KB Output is correct
12 Correct 16 ms 40188 KB Output is correct
13 Correct 15 ms 40148 KB Output is correct
14 Correct 17 ms 40368 KB Output is correct
15 Correct 16 ms 40448 KB Output is correct
16 Correct 16 ms 40316 KB Output is correct
17 Correct 16 ms 40532 KB Output is correct
18 Correct 17 ms 40328 KB Output is correct
19 Correct 16 ms 40276 KB Output is correct
20 Correct 16 ms 40148 KB Output is correct
21 Correct 16 ms 40276 KB Output is correct
22 Correct 16 ms 40276 KB Output is correct
23 Correct 17 ms 40364 KB Output is correct
24 Correct 19 ms 40468 KB Output is correct
25 Correct 17 ms 40448 KB Output is correct
26 Correct 16 ms 40220 KB Output is correct
27 Correct 16 ms 40232 KB Output is correct
28 Correct 19 ms 40648 KB Output is correct
29 Correct 20 ms 40916 KB Output is correct
30 Correct 18 ms 40276 KB Output is correct
31 Correct 18 ms 40552 KB Output is correct
32 Correct 17 ms 40516 KB Output is correct
33 Correct 26 ms 41792 KB Output is correct
34 Correct 21 ms 41684 KB Output is correct
35 Correct 33 ms 44308 KB Output is correct
36 Correct 18 ms 40916 KB Output is correct
37 Correct 30 ms 44280 KB Output is correct
38 Correct 36 ms 45540 KB Output is correct
39 Correct 31 ms 45380 KB Output is correct
40 Correct 34 ms 45428 KB Output is correct
41 Correct 33 ms 45428 KB Output is correct
42 Correct 21 ms 40660 KB Output is correct
43 Correct 23 ms 40676 KB Output is correct
44 Correct 19 ms 40528 KB Output is correct
45 Correct 112 ms 49196 KB Output is correct
46 Correct 60 ms 49164 KB Output is correct

Subtask #5
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 40052 KB Output is correct
2 Correct 17 ms 40064 KB Output is correct
3 Correct 15 ms 40148 KB Output is correct
4 Correct 631 ms 40212 KB Output is correct
5 Correct 15 ms 40156 KB Output is correct
6 Correct 17 ms 40148 KB Output is correct
7 Correct 17 ms 40148 KB Output is correct
8 Correct 15 ms 40148 KB Output is correct
9 Correct 16 ms 40108 KB Output is correct
10 Correct 15 ms 40148 KB Output is correct
11 Correct 17 ms 40344 KB Output is correct
12 Correct 16 ms 40148 KB Output is correct
13 Correct 18 ms 40148 KB Output is correct
14 Correct 17 ms 40404 KB Output is correct
15 Correct 16 ms 40404 KB Output is correct
16 Correct 16 ms 40276 KB Output is correct
17 Correct 17 ms 40492 KB Output is correct
18 Correct 16 ms 40276 KB Output is correct
19 Correct 17 ms 40252 KB Output is correct
20 Correct 17 ms 40188 KB Output is correct
21 Correct 16 ms 40332 KB Output is correct
22 Correct 15 ms 40276 KB Output is correct
23 Correct 17 ms 40360 KB Output is correct
24 Correct 17 ms 40496 KB Output is correct
25 Correct 17 ms 40412 KB Output is correct
26 Correct 16 ms 40268 KB Output is correct
27 Correct 16 ms 40184 KB Output is correct
28 Correct 19 ms 40760 KB Output is correct
29 Correct 22 ms 40848 KB Output is correct
30 Correct 17 ms 40276 KB Output is correct
31 Correct 18 ms 40524 KB Output is correct
32 Correct 17 ms 40484 KB Output is correct
33 Correct 26 ms 41812 KB Output is correct
34 Correct 21 ms 41812 KB Output is correct
35 Correct 34 ms 44336 KB Output is correct
36 Correct 18 ms 40916 KB Output is correct
37 Correct 30 ms 44372 KB Output is correct
38 Correct 36 ms 45444 KB Output is correct
39 Correct 32 ms 45384 KB Output is correct
40 Correct 38 ms 45476 KB Output is correct
41 Correct 36 ms 45380 KB Output is correct
42 Correct 19 ms 40660 KB Output is correct
43 Correct 19 ms 40688 KB Output is correct
44 Correct 18 ms 40608 KB Output is correct
45 Correct 80 ms 49272 KB Output is correct
46 Correct 59 ms 49188 KB Output is correct
47 Correct 38 ms 50964 KB Output is correct
48 Correct 35 ms 45168 KB Output is correct
49 Correct 31 ms 44460 KB Output is correct
50 Correct 24 ms 43476 KB Output is correct
51 Correct 42 ms 46932 KB Output is correct
52 Correct 52 ms 47308 KB Output is correct
53 Correct 37 ms 44628 KB Output is correct
54 Correct 682 ms 40476 KB Output is correct
55 Correct 627 ms 40528 KB Output is correct
56 Correct 23 ms 41300 KB Output is correct
57 Correct 18 ms 43284 KB Output is correct
58 Correct 24 ms 40840 KB Output is correct
59 Correct 29 ms 41124 KB Output is correct
60 Correct 23 ms 41436 KB Output is correct
61 Correct 24 ms 41384 KB Output is correct
62 Correct 83 ms 48848 KB Output is correct
63 Correct 299 ms 70236 KB Output is correct
64 Correct 337 ms 76316 KB Output is correct
65 Correct 524 ms 90768 KB Output is correct
66 Correct 967 ms 122180 KB Output is correct
67 Correct 559 ms 122396 KB Output is correct