oj.uz

Submission #745315

# Submission time Handle Problem Language Result Execution time Memory
745315 2023-05-19T20:25:02 Z IBory Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 171 ms 120200 KB 
#include <bits/stdc++.h>
#define pii pair<int, int>
using namespace std;

const int MAX = 999999;
unordered_map<int, int> mv[33333];
vector<int> G[MAX];
int D[MAX];

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

	for (auto& [q, v] : make) {
		auto [p, i] = q;
		vector<int> fr;
		for (int j = i; j < N; j += p) fr.push_back(j);
		int base = -1;
		for (int n = 0; n < fr.size(); ++n) {
			G[node].push_back(fr[n]);
			if (base != -1) G[base].push_back(node);
			base = node++;
		}
		base = -1;
		for (int n = fr.size() - 1; n >= 0; --n) {
			G[node].push_back(fr[n]);
			if (base != -1) G[base].push_back(node);
			base = node++;
		}
		for (int s : v) {
			int n = (s - i) / p;
			if (n) G[s].push_back(fr[n - 1]);
			if (n + 1 < fr.size()) G[s].push_back(fr[n + 1]);
			if (1 < n) G[s].push_back(node - (n - 1));
			if (n + 2 < fr.size()) G[s].push_back(node - 2 * fr.size() + n + 2);
		}
	}

	memset(D, 0x3f, sizeof(D));
	D[S] = 0;
	queue<int> Q;
	Q.push(S);
	while (!Q.empty()) {
		int cur = Q.front(); Q.pop();
		for (int next : G[cur]) {
			if (D[next] < 1e9) continue;
			D[next] = D[cur] + 1;
			Q.push(next);
		}
	}

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

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:24:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   24 |  for (auto& [q, v] : make) {
      |             ^
skyscraper.cpp:25:8: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   25 |   auto [p, i] = q;
      |        ^
skyscraper.cpp:29:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |   for (int n = 0; n < fr.size(); ++n) {
      |                   ~~^~~~~~~~~~~
skyscraper.cpp:43:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |    if (n + 1 < fr.size()) G[s].push_back(fr[n + 1]);
      |        ~~~~~~^~~~~~~~~~~
skyscraper.cpp:45:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |    if (n + 2 < fr.size()) G[s].push_back(node - 2 * fr.size() + n + 2);
      |        ~~~~~~^~~~~~~~~~~
skyscraper.cpp:62:14: warning: 'E' may be used uninitialized in this function [-Wmaybe-uninitialized]
   62 |  cout << (D[E] > 1E9 ? -1 : D[E]);
      |           ~~~^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 29524 KB Output is correct
2 Correct 16 ms 29524 KB Output is correct
3 Correct 15 ms 29480 KB Output is correct
4 Correct 15 ms 29484 KB Output is correct
5 Correct 16 ms 29504 KB Output is correct
6 Correct 15 ms 29484 KB Output is correct
7 Correct 15 ms 29524 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 29524 KB Output is correct
2 Correct 16 ms 29516 KB Output is correct
3 Correct 16 ms 29536 KB Output is correct
4 Correct 16 ms 29524 KB Output is correct
5 Correct 16 ms 29480 KB Output is correct
6 Correct 16 ms 29444 KB Output is correct
7 Correct 15 ms 29492 KB Output is correct
8 Correct 16 ms 29524 KB Output is correct
9 Correct 15 ms 29512 KB Output is correct
10 Correct 17 ms 29648 KB Output is correct
11 Correct 17 ms 30000 KB Output is correct
12 Correct 16 ms 29576 KB Output is correct
13 Correct 18 ms 29620 KB Output is correct
14 Correct 17 ms 30164 KB Output is correct
15 Correct 18 ms 30132 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 29524 KB Output is correct
2 Correct 16 ms 29524 KB Output is correct
3 Correct 15 ms 29460 KB Output is correct
4 Correct 15 ms 29536 KB Output is correct
5 Correct 20 ms 29516 KB Output is correct
6 Correct 21 ms 29524 KB Output is correct
7 Correct 16 ms 29524 KB Output is correct
8 Correct 16 ms 29516 KB Output is correct
9 Correct 16 ms 29484 KB Output is correct
10 Correct 16 ms 29652 KB Output is correct
11 Correct 17 ms 29908 KB Output is correct
12 Correct 15 ms 29624 KB Output is correct
13 Correct 16 ms 29524 KB Output is correct
14 Correct 18 ms 30164 KB Output is correct
15 Correct 17 ms 30164 KB Output is correct
16 Correct 16 ms 29876 KB Output is correct
17 Correct 22 ms 30596 KB Output is correct
18 Correct 21 ms 30000 KB Output is correct
19 Correct 17 ms 29940 KB Output is correct
20 Correct 16 ms 29648 KB Output is correct
21 Correct 16 ms 29780 KB Output is correct
22 Correct 16 ms 29912 KB Output is correct
23 Correct 17 ms 30028 KB Output is correct
24 Correct 19 ms 30596 KB Output is correct
25 Correct 18 ms 30264 KB Output is correct
26 Correct 17 ms 30096 KB Output is correct
27 Correct 17 ms 30064 KB Output is correct
28 Correct 21 ms 31168 KB Output is correct
29 Correct 29 ms 33456 KB Output is correct
30 Correct 19 ms 30548 KB Output is correct
31 Correct 23 ms 31656 KB Output is correct
32 Correct 19 ms 31020 KB Output is correct
33 Correct 43 ms 37304 KB Output is correct
34 Correct 43 ms 37196 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 29520 KB Output is correct
2 Correct 15 ms 29524 KB Output is correct
3 Correct 15 ms 29520 KB Output is correct
4 Correct 16 ms 29492 KB Output is correct
5 Correct 16 ms 29492 KB Output is correct
6 Correct 16 ms 29524 KB Output is correct
7 Correct 15 ms 29524 KB Output is correct
8 Correct 15 ms 29496 KB Output is correct
9 Correct 15 ms 29484 KB Output is correct
10 Correct 16 ms 29652 KB Output is correct
11 Correct 17 ms 29908 KB Output is correct
12 Correct 16 ms 29536 KB Output is correct
13 Correct 17 ms 29612 KB Output is correct
14 Correct 18 ms 30136 KB Output is correct
15 Correct 18 ms 30156 KB Output is correct
16 Correct 17 ms 29876 KB Output is correct
17 Correct 19 ms 30640 KB Output is correct
18 Correct 17 ms 30036 KB Output is correct
19 Correct 16 ms 29876 KB Output is correct
20 Correct 16 ms 29752 KB Output is correct
21 Correct 17 ms 29708 KB Output is correct
22 Correct 16 ms 29972 KB Output is correct
23 Correct 17 ms 30036 KB Output is correct
24 Correct 19 ms 30480 KB Output is correct
25 Correct 18 ms 30292 KB Output is correct
26 Correct 19 ms 30036 KB Output is correct
27 Correct 17 ms 29972 KB Output is correct
28 Correct 21 ms 31188 KB Output is correct
29 Correct 29 ms 33400 KB Output is correct
30 Correct 19 ms 30652 KB Output is correct
31 Correct 22 ms 31664 KB Output is correct
32 Correct 21 ms 31008 KB Output is correct
33 Correct 44 ms 37304 KB Output is correct
34 Correct 47 ms 37288 KB Output is correct
35 Correct 54 ms 39076 KB Output is correct
36 Correct 23 ms 31188 KB Output is correct
37 Correct 68 ms 42784 KB Output is correct
38 Correct 73 ms 43416 KB Output is correct
39 Correct 69 ms 43444 KB Output is correct
40 Correct 69 ms 43420 KB Output is correct
41 Correct 69 ms 43408 KB Output is correct
42 Correct 21 ms 30760 KB Output is correct
43 Correct 21 ms 30748 KB Output is correct
44 Correct 20 ms 30412 KB Output is correct
45 Correct 169 ms 63592 KB Output is correct
46 Correct 169 ms 63572 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 29652 KB Output is correct
2 Correct 16 ms 29500 KB Output is correct
3 Correct 17 ms 29524 KB Output is correct
4 Correct 15 ms 29516 KB Output is correct
5 Correct 16 ms 29524 KB Output is correct
6 Correct 16 ms 29484 KB Output is correct
7 Correct 16 ms 29500 KB Output is correct
8 Correct 16 ms 29560 KB Output is correct
9 Correct 16 ms 29524 KB Output is correct
10 Correct 17 ms 29596 KB Output is correct
11 Correct 18 ms 30020 KB Output is correct
12 Correct 16 ms 29520 KB Output is correct
13 Correct 15 ms 29524 KB Output is correct
14 Correct 18 ms 30240 KB Output is correct
15 Correct 17 ms 30132 KB Output is correct
16 Correct 17 ms 29776 KB Output is correct
17 Correct 19 ms 30676 KB Output is correct
18 Correct 17 ms 29992 KB Output is correct
19 Correct 18 ms 29876 KB Output is correct
20 Correct 16 ms 29756 KB Output is correct
21 Correct 16 ms 29740 KB Output is correct
22 Correct 19 ms 29908 KB Output is correct
23 Correct 17 ms 30084 KB Output is correct
24 Correct 21 ms 30556 KB Output is correct
25 Correct 18 ms 30236 KB Output is correct
26 Correct 18 ms 30060 KB Output is correct
27 Correct 17 ms 29980 KB Output is correct
28 Correct 21 ms 31240 KB Output is correct
29 Correct 29 ms 33444 KB Output is correct
30 Correct 19 ms 30632 KB Output is correct
31 Correct 23 ms 31700 KB Output is correct
32 Correct 21 ms 30964 KB Output is correct
33 Correct 45 ms 37292 KB Output is correct
34 Correct 43 ms 37300 KB Output is correct
35 Correct 53 ms 39056 KB Output is correct
36 Correct 20 ms 31188 KB Output is correct
37 Correct 70 ms 42888 KB Output is correct
38 Correct 71 ms 43436 KB Output is correct
39 Correct 82 ms 43320 KB Output is correct
40 Correct 72 ms 43304 KB Output is correct
41 Correct 70 ms 43420 KB Output is correct
42 Correct 21 ms 30796 KB Output is correct
43 Correct 22 ms 30772 KB Output is correct
44 Correct 21 ms 30412 KB Output is correct
45 Correct 166 ms 63592 KB Output is correct
46 Correct 171 ms 63472 KB Output is correct
47 Runtime error 146 ms 120200 KB Execution killed with signal 11
48 Halted 0 ms 0 KB -