oj.uz

답안 #771281

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
771281 2023-07-02T19:10:17 Z IBory Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 113452 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, 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) {
		sort(v.begin(), v.end());
		v.erase(unique(v.begin(), v.end()), v.end());
		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:29:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   29 |  for (auto& [q, v] : make) {
      |             ^
skyscraper.cpp:32:8: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   32 |   auto [p, i] = q;
      |        ^
skyscraper.cpp:93:15: warning: 'EN' may be used uninitialized in this function [-Wmaybe-uninitialized]
   93 |  cout << (D[EN] > 1E9 ? -1 : D[EN]);
      |           ~~~~^

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 31444 KB Output is correct
2 Correct 11 ms 31444 KB Output is correct
3 Correct 11 ms 31444 KB Output is correct
4 Correct 504 ms 31496 KB Output is correct
5 Correct 12 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

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 31400 KB Output is correct
2 Correct 11 ms 31364 KB Output is correct
3 Correct 12 ms 31444 KB Output is correct
4 Correct 498 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 31368 KB Output is correct
8 Correct 12 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 13 ms 31688 KB Output is correct
12 Correct 12 ms 31452 KB Output is correct
13 Correct 12 ms 31384 KB Output is correct
14 Correct 16 ms 31700 KB Output is correct
15 Correct 15 ms 31700 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 31444 KB Output is correct
2 Correct 12 ms 31424 KB Output is correct
3 Correct 12 ms 31436 KB Output is correct
4 Correct 491 ms 31508 KB Output is correct
5 Correct 14 ms 31444 KB Output is correct
6 Correct 12 ms 31444 KB Output is correct
7 Correct 13 ms 31436 KB Output is correct
8 Correct 14 ms 31536 KB Output is correct
9 Correct 13 ms 31384 KB Output is correct
10 Correct 12 ms 31504 KB Output is correct
11 Correct 13 ms 31700 KB Output is correct
12 Correct 13 ms 31444 KB Output is correct
13 Correct 12 ms 31380 KB Output is correct
14 Correct 14 ms 31788 KB Output is correct
15 Correct 13 ms 31700 KB Output is correct
16 Correct 13 ms 31596 KB Output is correct
17 Correct 14 ms 31828 KB Output is correct
18 Correct 13 ms 31628 KB Output is correct
19 Correct 15 ms 31596 KB Output is correct
20 Correct 15 ms 31556 KB Output is correct
21 Correct 13 ms 31648 KB Output is correct
22 Correct 12 ms 31572 KB Output is correct
23 Correct 13 ms 31648 KB Output is correct
24 Correct 14 ms 31828 KB Output is correct
25 Correct 13 ms 31748 KB Output is correct
26 Correct 12 ms 31572 KB Output is correct
27 Correct 13 ms 31548 KB Output is correct
28 Correct 15 ms 32016 KB Output is correct
29 Correct 18 ms 32212 KB Output is correct
30 Correct 14 ms 31588 KB Output is correct
31 Correct 15 ms 31836 KB Output is correct
32 Correct 17 ms 31716 KB Output is correct
33 Correct 24 ms 33108 KB Output is correct
34 Correct 19 ms 33020 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 31476 KB Output is correct
2 Correct 12 ms 31444 KB Output is correct
3 Correct 13 ms 31444 KB Output is correct
4 Correct 468 ms 31476 KB Output is correct
5 Correct 13 ms 31444 KB Output is correct
6 Correct 13 ms 31436 KB Output is correct
7 Correct 12 ms 31440 KB Output is correct
8 Correct 12 ms 31444 KB Output is correct
9 Correct 13 ms 31460 KB Output is correct
10 Correct 12 ms 31444 KB Output is correct
11 Correct 13 ms 31700 KB Output is correct
12 Correct 13 ms 31444 KB Output is correct
13 Correct 12 ms 31444 KB Output is correct
14 Correct 14 ms 31784 KB Output is correct
15 Correct 13 ms 31700 KB Output is correct
16 Correct 13 ms 31508 KB Output is correct
17 Correct 13 ms 31752 KB Output is correct
18 Correct 12 ms 31652 KB Output is correct
19 Correct 12 ms 31496 KB Output is correct
20 Correct 13 ms 31468 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 31572 KB Output is correct
24 Correct 16 ms 31876 KB Output is correct
25 Correct 13 ms 31752 KB Output is correct
26 Correct 12 ms 31572 KB Output is correct
27 Correct 14 ms 31532 KB Output is correct
28 Correct 15 ms 31956 KB Output is correct
29 Correct 17 ms 32264 KB Output is correct
30 Correct 13 ms 31704 KB Output is correct
31 Correct 16 ms 31872 KB Output is correct
32 Correct 17 ms 31828 KB Output is correct
33 Correct 22 ms 33120 KB Output is correct
34 Correct 22 ms 33120 KB Output is correct
35 Correct 31 ms 35680 KB Output is correct
36 Correct 14 ms 32240 KB Output is correct
37 Correct 28 ms 35580 KB Output is correct
38 Correct 34 ms 36820 KB Output is correct
39 Correct 28 ms 36692 KB Output is correct
40 Correct 33 ms 36780 KB Output is correct
41 Correct 32 ms 36816 KB Output is correct
42 Correct 15 ms 31688 KB Output is correct
43 Correct 15 ms 31640 KB Output is correct
44 Correct 15 ms 31652 KB Output is correct
45 Correct 83 ms 40516 KB Output is correct
46 Correct 65 ms 40524 KB Output is correct

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 31480 KB Output is correct
2 Correct 11 ms 31436 KB Output is correct
3 Correct 12 ms 31440 KB Output is correct
4 Correct 465 ms 31516 KB Output is correct
5 Correct 14 ms 31444 KB Output is correct
6 Correct 15 ms 31368 KB Output is correct
7 Correct 11 ms 31444 KB Output is correct
8 Correct 12 ms 31444 KB Output is correct
9 Correct 12 ms 31468 KB Output is correct
10 Correct 13 ms 31492 KB Output is correct
11 Correct 13 ms 31612 KB Output is correct
12 Correct 12 ms 31444 KB Output is correct
13 Correct 13 ms 31444 KB Output is correct
14 Correct 16 ms 31700 KB Output is correct
15 Correct 13 ms 31792 KB Output is correct
16 Correct 14 ms 31572 KB Output is correct
17 Correct 14 ms 31848 KB Output is correct
18 Correct 13 ms 31692 KB Output is correct
19 Correct 14 ms 31608 KB Output is correct
20 Correct 12 ms 31572 KB Output is correct
21 Correct 13 ms 31600 KB Output is correct
22 Correct 13 ms 31640 KB Output is correct
23 Correct 14 ms 31732 KB Output is correct
24 Correct 13 ms 31828 KB Output is correct
25 Correct 13 ms 31744 KB Output is correct
26 Correct 12 ms 31572 KB Output is correct
27 Correct 13 ms 31552 KB Output is correct
28 Correct 15 ms 31956 KB Output is correct
29 Correct 17 ms 32212 KB Output is correct
30 Correct 13 ms 31700 KB Output is correct
31 Correct 15 ms 31860 KB Output is correct
32 Correct 17 ms 31704 KB Output is correct
33 Correct 27 ms 33048 KB Output is correct
34 Correct 19 ms 33124 KB Output is correct
35 Correct 34 ms 35608 KB Output is correct
36 Correct 15 ms 32264 KB Output is correct
37 Correct 28 ms 35624 KB Output is correct
38 Correct 37 ms 36812 KB Output is correct
39 Correct 28 ms 36784 KB Output is correct
40 Correct 31 ms 36716 KB Output is correct
41 Correct 31 ms 36788 KB Output is correct
42 Correct 15 ms 31584 KB Output is correct
43 Correct 16 ms 31712 KB Output is correct
44 Correct 18 ms 31652 KB Output is correct
45 Correct 90 ms 40500 KB Output is correct
46 Correct 64 ms 40520 KB Output is correct
47 Correct 34 ms 42264 KB Output is correct
48 Correct 25 ms 36504 KB Output is correct
49 Correct 30 ms 35740 KB Output is correct
50 Correct 20 ms 34756 KB Output is correct
51 Correct 40 ms 38280 KB Output is correct
52 Correct 40 ms 38436 KB Output is correct
53 Correct 31 ms 35980 KB Output is correct
54 Correct 493 ms 31772 KB Output is correct
55 Correct 453 ms 31988 KB Output is correct
56 Correct 20 ms 32604 KB Output is correct
57 Correct 15 ms 34708 KB Output is correct
58 Correct 21 ms 31940 KB Output is correct
59 Correct 20 ms 32124 KB Output is correct
60 Correct 25 ms 32496 KB Output is correct
61 Correct 25 ms 32628 KB Output is correct
62 Correct 81 ms 40244 KB Output is correct
63 Correct 306 ms 61544 KB Output is correct
64 Correct 407 ms 67732 KB Output is correct
65 Correct 559 ms 82084 KB Output is correct
66 Execution timed out 1091 ms 113452 KB Time limit exceeded
67 Halted 0 ms 0 KB -