oj.uz

Submission #771278

# Submission time Handle Problem Language Result Execution time Memory
771278 2023-07-02T19:03:45 Z IBory Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 114388 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 = 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, set<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}].insert(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 13 ms 31444 KB Output is correct
2 Correct 14 ms 31444 KB Output is correct
3 Correct 11 ms 31364 KB Output is correct
4 Correct 574 ms 31564 KB Output is correct
5 Correct 13 ms 31444 KB Output is correct
6 Correct 12 ms 31444 KB Output is correct
7 Correct 12 ms 31444 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 31444 KB Output is correct
2 Correct 13 ms 31444 KB Output is correct
3 Correct 12 ms 31444 KB Output is correct
4 Correct 520 ms 31500 KB Output is correct
5 Correct 13 ms 31444 KB Output is correct
6 Correct 14 ms 31428 KB Output is correct
7 Correct 13 ms 31372 KB Output is correct
8 Correct 13 ms 31416 KB Output is correct
9 Correct 15 ms 31444 KB Output is correct
10 Correct 14 ms 31540 KB Output is correct
11 Correct 13 ms 31700 KB Output is correct
12 Correct 13 ms 31396 KB Output is correct
13 Correct 13 ms 31480 KB Output is correct
14 Correct 14 ms 31828 KB Output is correct
15 Correct 15 ms 31820 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 31432 KB Output is correct
2 Correct 12 ms 31444 KB Output is correct
3 Correct 12 ms 31444 KB Output is correct
4 Correct 536 ms 31476 KB Output is correct
5 Correct 13 ms 31444 KB Output is correct
6 Correct 12 ms 31444 KB Output is correct
7 Correct 12 ms 31444 KB Output is correct
8 Correct 14 ms 31472 KB Output is correct
9 Correct 13 ms 31444 KB Output is correct
10 Correct 15 ms 31540 KB Output is correct
11 Correct 14 ms 31732 KB Output is correct
12 Correct 14 ms 31444 KB Output is correct
13 Correct 13 ms 31416 KB Output is correct
14 Correct 13 ms 31828 KB Output is correct
15 Correct 13 ms 31840 KB Output is correct
16 Correct 13 ms 31528 KB Output is correct
17 Correct 13 ms 31896 KB Output is correct
18 Correct 13 ms 31724 KB Output is correct
19 Correct 14 ms 31572 KB Output is correct
20 Correct 13 ms 31644 KB Output is correct
21 Correct 13 ms 31572 KB Output is correct
22 Correct 13 ms 31572 KB Output is correct
23 Correct 13 ms 31700 KB Output is correct
24 Correct 17 ms 31920 KB Output is correct
25 Correct 14 ms 31776 KB Output is correct
26 Correct 13 ms 31580 KB Output is correct
27 Correct 13 ms 31572 KB Output is correct
28 Correct 16 ms 32084 KB Output is correct
29 Correct 18 ms 32212 KB Output is correct
30 Correct 14 ms 31656 KB Output is correct
31 Correct 15 ms 31960 KB Output is correct
32 Correct 14 ms 31728 KB Output is correct
33 Correct 24 ms 33164 KB Output is correct
34 Correct 21 ms 33188 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 31444 KB Output is correct
2 Correct 12 ms 31412 KB Output is correct
3 Correct 13 ms 31484 KB Output is correct
4 Correct 517 ms 31468 KB Output is correct
5 Correct 13 ms 31404 KB Output is correct
6 Correct 12 ms 31444 KB Output is correct
7 Correct 12 ms 31404 KB Output is correct
8 Correct 13 ms 31412 KB Output is correct
9 Correct 12 ms 31444 KB Output is correct
10 Correct 12 ms 31500 KB Output is correct
11 Correct 13 ms 31764 KB Output is correct
12 Correct 12 ms 31444 KB Output is correct
13 Correct 13 ms 31428 KB Output is correct
14 Correct 13 ms 31828 KB Output is correct
15 Correct 13 ms 31828 KB Output is correct
16 Correct 12 ms 31572 KB Output is correct
17 Correct 14 ms 31828 KB Output is correct
18 Correct 13 ms 31712 KB Output is correct
19 Correct 13 ms 31524 KB Output is correct
20 Correct 13 ms 31656 KB Output is correct
21 Correct 13 ms 31668 KB Output is correct
22 Correct 14 ms 31640 KB Output is correct
23 Correct 13 ms 31620 KB Output is correct
24 Correct 14 ms 31828 KB Output is correct
25 Correct 14 ms 31852 KB Output is correct
26 Correct 13 ms 31532 KB Output is correct
27 Correct 13 ms 31540 KB Output is correct
28 Correct 17 ms 32072 KB Output is correct
29 Correct 19 ms 32312 KB Output is correct
30 Correct 14 ms 31708 KB Output is correct
31 Correct 16 ms 31860 KB Output is correct
32 Correct 18 ms 31816 KB Output is correct
33 Correct 25 ms 33180 KB Output is correct
34 Correct 20 ms 33156 KB Output is correct
35 Correct 32 ms 36484 KB Output is correct
36 Correct 16 ms 32308 KB Output is correct
37 Correct 28 ms 36320 KB Output is correct
38 Correct 35 ms 37688 KB Output is correct
39 Correct 30 ms 37744 KB Output is correct
40 Correct 31 ms 37680 KB Output is correct
41 Correct 32 ms 37736 KB Output is correct
42 Correct 16 ms 31548 KB Output is correct
43 Correct 16 ms 31572 KB Output is correct
44 Correct 15 ms 31572 KB Output is correct
45 Correct 79 ms 41512 KB Output is correct
46 Correct 60 ms 41516 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 31444 KB Output is correct
2 Correct 12 ms 31456 KB Output is correct
3 Correct 12 ms 31444 KB Output is correct
4 Correct 521 ms 31472 KB Output is correct
5 Correct 12 ms 31444 KB Output is correct
6 Correct 13 ms 31444 KB Output is correct
7 Correct 15 ms 31416 KB Output is correct
8 Correct 13 ms 31404 KB Output is correct
9 Correct 12 ms 31444 KB Output is correct
10 Correct 13 ms 31572 KB Output is correct
11 Correct 13 ms 31700 KB Output is correct
12 Correct 13 ms 31444 KB Output is correct
13 Correct 13 ms 31492 KB Output is correct
14 Correct 13 ms 31828 KB Output is correct
15 Correct 14 ms 31844 KB Output is correct
16 Correct 13 ms 31616 KB Output is correct
17 Correct 14 ms 31828 KB Output is correct
18 Correct 16 ms 31700 KB Output is correct
19 Correct 13 ms 31552 KB Output is correct
20 Correct 13 ms 31660 KB Output is correct
21 Correct 13 ms 31572 KB Output is correct
22 Correct 13 ms 31640 KB Output is correct
23 Correct 13 ms 31676 KB Output is correct
24 Correct 14 ms 31828 KB Output is correct
25 Correct 13 ms 31976 KB Output is correct
26 Correct 13 ms 31572 KB Output is correct
27 Correct 13 ms 31572 KB Output is correct
28 Correct 16 ms 32080 KB Output is correct
29 Correct 18 ms 32212 KB Output is correct
30 Correct 14 ms 31684 KB Output is correct
31 Correct 16 ms 31976 KB Output is correct
32 Correct 17 ms 31828 KB Output is correct
33 Correct 24 ms 33088 KB Output is correct
34 Correct 20 ms 33144 KB Output is correct
35 Correct 31 ms 36460 KB Output is correct
36 Correct 15 ms 32340 KB Output is correct
37 Correct 29 ms 36308 KB Output is correct
38 Correct 34 ms 37692 KB Output is correct
39 Correct 28 ms 37692 KB Output is correct
40 Correct 29 ms 37628 KB Output is correct
41 Correct 30 ms 37668 KB Output is correct
42 Correct 15 ms 31492 KB Output is correct
43 Correct 16 ms 31572 KB Output is correct
44 Correct 16 ms 31632 KB Output is correct
45 Correct 80 ms 41520 KB Output is correct
46 Correct 80 ms 41512 KB Output is correct
47 Correct 38 ms 42968 KB Output is correct
48 Correct 26 ms 37140 KB Output is correct
49 Correct 25 ms 36348 KB Output is correct
50 Correct 23 ms 35296 KB Output is correct
51 Correct 45 ms 39220 KB Output is correct
52 Correct 55 ms 39380 KB Output is correct
53 Correct 39 ms 36936 KB Output is correct
54 Correct 513 ms 31668 KB Output is correct
55 Correct 514 ms 31840 KB Output is correct
56 Correct 26 ms 33884 KB Output is correct
57 Correct 15 ms 34708 KB Output is correct
58 Correct 22 ms 31836 KB Output is correct
59 Correct 24 ms 32232 KB Output is correct
60 Correct 25 ms 32432 KB Output is correct
61 Correct 22 ms 32720 KB Output is correct
62 Correct 86 ms 41180 KB Output is correct
63 Correct 325 ms 62480 KB Output is correct
64 Correct 367 ms 68820 KB Output is correct
65 Correct 632 ms 83020 KB Output is correct
66 Execution timed out 1093 ms 114388 KB Time limit exceeded
67 Halted 0 ms 0 KB -