oj.uz

Submission #733616

# Submission time Handle Problem Language Result Execution time Memory
733616 2023-05-01T04:56:18 Z SanguineChameleon Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 196 ms 55184 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 = 6e6 + 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 11 ms 24532 KB Output is correct
2 Correct 11 ms 24532 KB Output is correct
3 Correct 10 ms 24532 KB Output is correct
4 Correct 12 ms 24436 KB Output is correct
5 Correct 11 ms 24532 KB Output is correct
6 Correct 10 ms 24460 KB Output is correct
7 Correct 10 ms 24544 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 24532 KB Output is correct
2 Correct 10 ms 24532 KB Output is correct
3 Correct 10 ms 24532 KB Output is correct
4 Correct 12 ms 24480 KB Output is correct
5 Correct 11 ms 24532 KB Output is correct
6 Correct 10 ms 24476 KB Output is correct
7 Correct 10 ms 24532 KB Output is correct
8 Correct 12 ms 24536 KB Output is correct
9 Correct 10 ms 24532 KB Output is correct
10 Correct 10 ms 24484 KB Output is correct
11 Correct 10 ms 24532 KB Output is correct
12 Correct 10 ms 24532 KB Output is correct
13 Correct 10 ms 24468 KB Output is correct
14 Correct 11 ms 24516 KB Output is correct
15 Correct 10 ms 24532 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 24464 KB Output is correct
2 Correct 10 ms 24532 KB Output is correct
3 Correct 11 ms 24432 KB Output is correct
4 Correct 10 ms 24460 KB Output is correct
5 Correct 11 ms 24532 KB Output is correct
6 Correct 10 ms 24444 KB Output is correct
7 Correct 10 ms 24532 KB Output is correct
8 Correct 10 ms 24532 KB Output is correct
9 Correct 10 ms 24524 KB Output is correct
10 Correct 11 ms 24532 KB Output is correct
11 Correct 11 ms 24532 KB Output is correct
12 Correct 12 ms 24516 KB Output is correct
13 Correct 10 ms 24516 KB Output is correct
14 Correct 11 ms 24512 KB Output is correct
15 Correct 11 ms 24532 KB Output is correct
16 Correct 11 ms 24532 KB Output is correct
17 Correct 11 ms 24660 KB Output is correct
18 Correct 11 ms 24788 KB Output is correct
19 Correct 11 ms 24660 KB Output is correct
20 Correct 10 ms 24604 KB Output is correct
21 Correct 11 ms 24564 KB Output is correct
22 Correct 10 ms 24660 KB Output is correct
23 Correct 11 ms 24788 KB Output is correct
24 Correct 12 ms 24916 KB Output is correct
25 Correct 12 ms 24568 KB Output is correct
26 Correct 11 ms 24788 KB Output is correct
27 Correct 11 ms 24720 KB Output is correct
28 Correct 14 ms 24944 KB Output is correct
29 Correct 11 ms 24912 KB Output is correct
30 Correct 11 ms 24644 KB Output is correct
31 Correct 13 ms 24660 KB Output is correct
32 Correct 12 ms 24660 KB Output is correct
33 Correct 12 ms 25360 KB Output is correct
34 Correct 12 ms 25300 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 24500 KB Output is correct
2 Correct 10 ms 24424 KB Output is correct
3 Correct 11 ms 24532 KB Output is correct
4 Correct 11 ms 24432 KB Output is correct
5 Correct 10 ms 24520 KB Output is correct
6 Correct 11 ms 24532 KB Output is correct
7 Correct 10 ms 24532 KB Output is correct
8 Correct 10 ms 24532 KB Output is correct
9 Correct 11 ms 24532 KB Output is correct
10 Correct 10 ms 24504 KB Output is correct
11 Correct 12 ms 24584 KB Output is correct
12 Correct 12 ms 24532 KB Output is correct
13 Correct 11 ms 24552 KB Output is correct
14 Correct 12 ms 24520 KB Output is correct
15 Correct 10 ms 24532 KB Output is correct
16 Correct 10 ms 24520 KB Output is correct
17 Correct 13 ms 24660 KB Output is correct
18 Correct 11 ms 24792 KB Output is correct
19 Correct 11 ms 24788 KB Output is correct
20 Correct 11 ms 24660 KB Output is correct
21 Correct 12 ms 24516 KB Output is correct
22 Correct 10 ms 24720 KB Output is correct
23 Correct 11 ms 24660 KB Output is correct
24 Correct 11 ms 24916 KB Output is correct
25 Correct 12 ms 24604 KB Output is correct
26 Correct 11 ms 24788 KB Output is correct
27 Correct 10 ms 24732 KB Output is correct
28 Correct 11 ms 25044 KB Output is correct
29 Correct 11 ms 24904 KB Output is correct
30 Correct 10 ms 24672 KB Output is correct
31 Correct 11 ms 24732 KB Output is correct
32 Correct 11 ms 24660 KB Output is correct
33 Correct 12 ms 25300 KB Output is correct
34 Correct 13 ms 25348 KB Output is correct
35 Correct 19 ms 25684 KB Output is correct
36 Correct 11 ms 24788 KB Output is correct
37 Correct 15 ms 26124 KB Output is correct
38 Correct 19 ms 26196 KB Output is correct
39 Correct 19 ms 26104 KB Output is correct
40 Correct 19 ms 26196 KB Output is correct
41 Correct 17 ms 26196 KB Output is correct
42 Correct 14 ms 25044 KB Output is correct
43 Correct 14 ms 24948 KB Output is correct
44 Correct 14 ms 24788 KB Output is correct
45 Correct 28 ms 27988 KB Output is correct
46 Correct 27 ms 27896 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 24532 KB Output is correct
2 Correct 12 ms 24464 KB Output is correct
3 Correct 10 ms 24544 KB Output is correct
4 Correct 11 ms 24532 KB Output is correct
5 Correct 11 ms 24532 KB Output is correct
6 Correct 11 ms 24532 KB Output is correct
7 Correct 10 ms 24532 KB Output is correct
8 Correct 10 ms 24504 KB Output is correct
9 Correct 10 ms 24548 KB Output is correct
10 Correct 10 ms 24532 KB Output is correct
11 Correct 11 ms 24548 KB Output is correct
12 Correct 10 ms 24532 KB Output is correct
13 Correct 11 ms 24484 KB Output is correct
14 Correct 11 ms 24656 KB Output is correct
15 Correct 11 ms 24628 KB Output is correct
16 Correct 10 ms 24532 KB Output is correct
17 Correct 12 ms 24660 KB Output is correct
18 Correct 11 ms 24744 KB Output is correct
19 Correct 13 ms 24660 KB Output is correct
20 Correct 12 ms 24532 KB Output is correct
21 Correct 10 ms 24532 KB Output is correct
22 Correct 11 ms 24684 KB Output is correct
23 Correct 12 ms 24768 KB Output is correct
24 Correct 11 ms 24972 KB Output is correct
25 Correct 11 ms 24660 KB Output is correct
26 Correct 12 ms 24788 KB Output is correct
27 Correct 11 ms 24760 KB Output is correct
28 Correct 11 ms 25028 KB Output is correct
29 Correct 11 ms 24904 KB Output is correct
30 Correct 10 ms 24660 KB Output is correct
31 Correct 11 ms 24660 KB Output is correct
32 Correct 13 ms 24684 KB Output is correct
33 Correct 12 ms 25300 KB Output is correct
34 Correct 12 ms 25292 KB Output is correct
35 Correct 17 ms 25796 KB Output is correct
36 Correct 12 ms 24904 KB Output is correct
37 Correct 16 ms 26196 KB Output is correct
38 Correct 18 ms 26196 KB Output is correct
39 Correct 19 ms 26196 KB Output is correct
40 Correct 18 ms 26172 KB Output is correct
41 Correct 21 ms 26216 KB Output is correct
42 Correct 15 ms 25012 KB Output is correct
43 Correct 13 ms 24904 KB Output is correct
44 Correct 14 ms 24792 KB Output is correct
45 Correct 25 ms 27924 KB Output is correct
46 Correct 24 ms 27860 KB Output is correct
47 Correct 26 ms 35512 KB Output is correct
48 Correct 28 ms 38816 KB Output is correct
49 Correct 26 ms 36096 KB Output is correct
50 Correct 23 ms 36264 KB Output is correct
51 Correct 37 ms 45704 KB Output is correct
52 Correct 39 ms 48200 KB Output is correct
53 Correct 19 ms 26312 KB Output is correct
54 Correct 11 ms 24876 KB Output is correct
55 Correct 11 ms 25300 KB Output is correct
56 Correct 18 ms 26052 KB Output is correct
57 Correct 14 ms 27504 KB Output is correct
58 Correct 17 ms 27220 KB Output is correct
59 Correct 21 ms 30804 KB Output is correct
60 Correct 30 ms 40660 KB Output is correct
61 Correct 22 ms 32372 KB Output is correct
62 Correct 37 ms 41520 KB Output is correct
63 Correct 112 ms 38720 KB Output is correct
64 Correct 137 ms 41728 KB Output is correct
65 Correct 196 ms 55184 KB Output is correct
66 Incorrect 44 ms 36876 KB Output isn't correct
67 Halted 0 ms 0 KB -