oj.uz

Submission #733614

# Submission time Handle Problem Language Result Execution time Memory
733614 2023-05-01T04:54:42 Z SanguineChameleon Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 120 ms 40368 KB 
#include <bits/stdc++.h>
using namespace std;

void just_do_it();

int main() {
	#ifdef KAMIRULEZ
		freopen("kamirulez.inp", "r", stdin);
		freopen("kamirulez.out", "w", stdout);
	#endif
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	just_do_it();
	return 0;
}

const int maxN = 3e4 + 20;
const int maxC = 4e6 + 20;
const int inf = 1e9 + 20;
int B[maxN];
int P[maxN];
vector<int> adj0[maxN];
bool can_nxt[maxC];
bool can_prv[maxC];
int dist[maxC];
int pos[maxC];
bool flag[maxN];
int id[maxN];

void just_do_it() {
	fill_n(pos, maxC, -1);
	int N, M;
	cin >> N >> M;
	const int lim = sqrt(N);
	int cnt = N;
	for (int i = 0; i < M; i++) {
		cin >> B[i] >> P[i];
		if (P[i] > lim) {
			int cur = B[i] % P[i];
			int nxt = cur + P[i];
			for (; cur < N; cur += P[i], nxt += P[i]) {
				if (nxt < N) {
					can_nxt[cnt] = true;
					can_prv[cnt + 1] = true;
				}
				if (cur == B[i]) {
					adj0[B[i]].emplace_back(cnt);
				}
				pos[cnt] = cur;
				cnt++;
				if (cnt == maxC) {
					exit(0);
				}
			}
		}
	}
	for (int d = 1; d <= lim; d++) {
		for (int i = 0; i < N; i++) {
			flag[i] = false;
		}
		bool found = false;
		for (int i = 0; i < M; i++) {
			if (P[i] == d) {
				found = true;
				break;
			}
		}
		if (!found) {
			continue;
		}
		for (int i = 0; i < d; i++) {
			int cur = i;
			int nxt = cur + d;
			for (; cur < N; cur += d, nxt += d) {
				if (nxt < N) {
					can_nxt[cnt] = true;
					can_prv[cnt + 1] = true;
				}
				id[cur] = cnt;
				pos[cnt] = cur;
				cnt++;
				if (cnt == maxC) {
					exit(0);
				}
			}
		}
		for (int i = 0; i < M; i++) {
			if (P[i] == d && !flag[B[i]]) {
				flag[B[i]] = true;
				adj0[B[i]].emplace_back(id[B[i]]);
			}
		}
	}
	for (int i = 0; i < cnt; i++) {
		dist[i] = inf;
	}
	dist[B[0]] = 0;
	deque<int> q = {B[0]};
	while (!q.empty()) {
		int u = q.front();
		if (u == B[1]) {
			cout << dist[u];
			return;
		}
		q.pop_front();
		if (u < N) {
			for (auto v: adj0[u]) {
				if (dist[u] < dist[v]) {
					dist[v] = dist[u];
					q.push_front(v);
				}
			}
		}
		else {
			if (pos[u] != -1) {
				int v = pos[u];
				if (dist[u] < dist[v]) {
					dist[v] = dist[u];
					q.push_front(v);
				}
			}
			if (can_nxt[u]) {
				int v = u + 1;
				if (dist[u] + 1 < dist[v]) {
					dist[v] = dist[u] + 1;
					q.push_back(v);
				}
			}
			if (can_prv[u]) {
				int v = u - 1;
				if (dist[u] + 1 < dist[v]) {
					dist[v] = dist[u] + 1;
					q.push_back(v);
				}
			}
		}
	}
	cout << -1;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16596 KB Output is correct
2 Correct 8 ms 16596 KB Output is correct
3 Correct 7 ms 16596 KB Output is correct
4 Correct 7 ms 16596 KB Output is correct
5 Correct 8 ms 16724 KB Output is correct
6 Correct 8 ms 16596 KB Output is correct
7 Correct 7 ms 16608 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16596 KB Output is correct
2 Correct 7 ms 16596 KB Output is correct
3 Correct 7 ms 16712 KB Output is correct
4 Correct 8 ms 16688 KB Output is correct
5 Correct 7 ms 16596 KB Output is correct
6 Correct 7 ms 16624 KB Output is correct
7 Correct 9 ms 16596 KB Output is correct
8 Correct 7 ms 16584 KB Output is correct
9 Correct 7 ms 16696 KB Output is correct
10 Correct 7 ms 16724 KB Output is correct
11 Correct 7 ms 16724 KB Output is correct
12 Correct 8 ms 16672 KB Output is correct
13 Correct 7 ms 16724 KB Output is correct
14 Correct 8 ms 16724 KB Output is correct
15 Correct 8 ms 16724 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16596 KB Output is correct
2 Correct 7 ms 16576 KB Output is correct
3 Correct 7 ms 16596 KB Output is correct
4 Correct 7 ms 16596 KB Output is correct
5 Correct 7 ms 16724 KB Output is correct
6 Correct 7 ms 16648 KB Output is correct
7 Correct 8 ms 16596 KB Output is correct
8 Correct 8 ms 16596 KB Output is correct
9 Correct 8 ms 16680 KB Output is correct
10 Correct 8 ms 16676 KB Output is correct
11 Correct 7 ms 16724 KB Output is correct
12 Correct 8 ms 16724 KB Output is correct
13 Correct 8 ms 16648 KB Output is correct
14 Correct 7 ms 16748 KB Output is correct
15 Correct 8 ms 16836 KB Output is correct
16 Correct 8 ms 16740 KB Output is correct
17 Correct 8 ms 16904 KB Output is correct
18 Correct 8 ms 16980 KB Output is correct
19 Correct 8 ms 16852 KB Output is correct
20 Correct 9 ms 16724 KB Output is correct
21 Correct 8 ms 16764 KB Output is correct
22 Correct 9 ms 16852 KB Output is correct
23 Correct 8 ms 16852 KB Output is correct
24 Correct 8 ms 17128 KB Output is correct
25 Correct 8 ms 16724 KB Output is correct
26 Correct 9 ms 17196 KB Output is correct
27 Correct 8 ms 16852 KB Output is correct
28 Correct 8 ms 17236 KB Output is correct
29 Correct 8 ms 17108 KB Output is correct
30 Correct 8 ms 16852 KB Output is correct
31 Correct 8 ms 16912 KB Output is correct
32 Correct 8 ms 16852 KB Output is correct
33 Correct 10 ms 17448 KB Output is correct
34 Correct 9 ms 17492 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16596 KB Output is correct
2 Correct 8 ms 16696 KB Output is correct
3 Correct 8 ms 16596 KB Output is correct
4 Correct 8 ms 16688 KB Output is correct
5 Correct 7 ms 16596 KB Output is correct
6 Correct 8 ms 16596 KB Output is correct
7 Correct 8 ms 16596 KB Output is correct
8 Correct 8 ms 16596 KB Output is correct
9 Correct 10 ms 16668 KB Output is correct
10 Correct 8 ms 16732 KB Output is correct
11 Correct 8 ms 16724 KB Output is correct
12 Correct 9 ms 16724 KB Output is correct
13 Correct 8 ms 16724 KB Output is correct
14 Correct 8 ms 16724 KB Output is correct
15 Correct 8 ms 16724 KB Output is correct
16 Correct 8 ms 16696 KB Output is correct
17 Correct 9 ms 16980 KB Output is correct
18 Correct 8 ms 16980 KB Output is correct
19 Correct 8 ms 16852 KB Output is correct
20 Correct 8 ms 16724 KB Output is correct
21 Correct 7 ms 16724 KB Output is correct
22 Correct 8 ms 16852 KB Output is correct
23 Correct 9 ms 16872 KB Output is correct
24 Correct 9 ms 17108 KB Output is correct
25 Correct 8 ms 16852 KB Output is correct
26 Correct 8 ms 16980 KB Output is correct
27 Correct 8 ms 16852 KB Output is correct
28 Correct 8 ms 17236 KB Output is correct
29 Correct 9 ms 17108 KB Output is correct
30 Correct 8 ms 16832 KB Output is correct
31 Correct 7 ms 16852 KB Output is correct
32 Correct 8 ms 16804 KB Output is correct
33 Correct 10 ms 17492 KB Output is correct
34 Correct 9 ms 17492 KB Output is correct
35 Correct 14 ms 17936 KB Output is correct
36 Correct 8 ms 16988 KB Output is correct
37 Correct 15 ms 18388 KB Output is correct
38 Correct 14 ms 18336 KB Output is correct
39 Correct 14 ms 18388 KB Output is correct
40 Correct 15 ms 18308 KB Output is correct
41 Correct 14 ms 18388 KB Output is correct
42 Correct 13 ms 17192 KB Output is correct
43 Correct 12 ms 17108 KB Output is correct
44 Correct 11 ms 16980 KB Output is correct
45 Correct 22 ms 20104 KB Output is correct
46 Correct 20 ms 20052 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16596 KB Output is correct
2 Correct 7 ms 16596 KB Output is correct
3 Correct 7 ms 16596 KB Output is correct
4 Correct 7 ms 16596 KB Output is correct
5 Correct 7 ms 16596 KB Output is correct
6 Correct 7 ms 16596 KB Output is correct
7 Correct 7 ms 16596 KB Output is correct
8 Correct 9 ms 16628 KB Output is correct
9 Correct 9 ms 16712 KB Output is correct
10 Correct 7 ms 16736 KB Output is correct
11 Correct 7 ms 16724 KB Output is correct
12 Correct 8 ms 16724 KB Output is correct
13 Correct 8 ms 16724 KB Output is correct
14 Correct 8 ms 16724 KB Output is correct
15 Correct 9 ms 16720 KB Output is correct
16 Correct 8 ms 16724 KB Output is correct
17 Correct 8 ms 16852 KB Output is correct
18 Correct 8 ms 16980 KB Output is correct
19 Correct 8 ms 16852 KB Output is correct
20 Correct 8 ms 16748 KB Output is correct
21 Correct 8 ms 16700 KB Output is correct
22 Correct 8 ms 16852 KB Output is correct
23 Correct 9 ms 16852 KB Output is correct
24 Correct 8 ms 17092 KB Output is correct
25 Correct 8 ms 16852 KB Output is correct
26 Correct 8 ms 16940 KB Output is correct
27 Correct 7 ms 16852 KB Output is correct
28 Correct 8 ms 17236 KB Output is correct
29 Correct 8 ms 17128 KB Output is correct
30 Correct 8 ms 16852 KB Output is correct
31 Correct 9 ms 16852 KB Output is correct
32 Correct 8 ms 16812 KB Output is correct
33 Correct 9 ms 17492 KB Output is correct
34 Correct 9 ms 17492 KB Output is correct
35 Correct 13 ms 17876 KB Output is correct
36 Correct 9 ms 16980 KB Output is correct
37 Correct 13 ms 18300 KB Output is correct
38 Correct 15 ms 18368 KB Output is correct
39 Correct 14 ms 18284 KB Output is correct
40 Correct 15 ms 18360 KB Output is correct
41 Correct 15 ms 18416 KB Output is correct
42 Correct 11 ms 17172 KB Output is correct
43 Correct 11 ms 17124 KB Output is correct
44 Correct 11 ms 16992 KB Output is correct
45 Correct 21 ms 20032 KB Output is correct
46 Correct 17 ms 20108 KB Output is correct
47 Correct 24 ms 27692 KB Output is correct
48 Correct 25 ms 30988 KB Output is correct
49 Correct 22 ms 28324 KB Output is correct
50 Correct 20 ms 28448 KB Output is correct
51 Correct 34 ms 37888 KB Output is correct
52 Correct 36 ms 40368 KB Output is correct
53 Correct 16 ms 18516 KB Output is correct
54 Correct 7 ms 17108 KB Output is correct
55 Correct 8 ms 17492 KB Output is correct
56 Correct 15 ms 18268 KB Output is correct
57 Correct 12 ms 19596 KB Output is correct
58 Correct 17 ms 19480 KB Output is correct
59 Correct 17 ms 22920 KB Output is correct
60 Correct 28 ms 32772 KB Output is correct
61 Correct 18 ms 24500 KB Output is correct
62 Correct 34 ms 33616 KB Output is correct
63 Correct 99 ms 30936 KB Output is correct
64 Correct 120 ms 33856 KB Output is correct
65 Incorrect 36 ms 24880 KB Output isn't correct
66 Halted 0 ms 0 KB -