oj.uz

Submission #733615

# Submission time Handle Problem Language Result Execution time Memory
733615 2023-05-01T04:55:10 Z SanguineChameleon Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 124 ms 44312 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 = 5e6 + 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 9 ms 20564 KB Output is correct
2 Correct 9 ms 20564 KB Output is correct
3 Correct 9 ms 20564 KB Output is correct
4 Correct 10 ms 20564 KB Output is correct
5 Correct 10 ms 20564 KB Output is correct
6 Correct 9 ms 20608 KB Output is correct
7 Correct 9 ms 20604 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 20564 KB Output is correct
2 Correct 8 ms 20564 KB Output is correct
3 Correct 10 ms 20564 KB Output is correct
4 Correct 9 ms 20564 KB Output is correct
5 Correct 8 ms 20564 KB Output is correct
6 Correct 8 ms 20692 KB Output is correct
7 Correct 11 ms 20532 KB Output is correct
8 Correct 9 ms 20592 KB Output is correct
9 Correct 9 ms 20564 KB Output is correct
10 Correct 9 ms 20564 KB Output is correct
11 Correct 10 ms 20692 KB Output is correct
12 Correct 12 ms 20652 KB Output is correct
13 Correct 9 ms 20588 KB Output is correct
14 Correct 9 ms 20704 KB Output is correct
15 Correct 9 ms 20592 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 20564 KB Output is correct
2 Correct 8 ms 20564 KB Output is correct
3 Correct 9 ms 20604 KB Output is correct
4 Correct 9 ms 20564 KB Output is correct
5 Correct 9 ms 20540 KB Output is correct
6 Correct 10 ms 20592 KB Output is correct
7 Correct 9 ms 20564 KB Output is correct
8 Correct 10 ms 20564 KB Output is correct
9 Correct 9 ms 20524 KB Output is correct
10 Correct 9 ms 20576 KB Output is correct
11 Correct 11 ms 20692 KB Output is correct
12 Correct 9 ms 20564 KB Output is correct
13 Correct 9 ms 20564 KB Output is correct
14 Correct 12 ms 20656 KB Output is correct
15 Correct 9 ms 20664 KB Output is correct
16 Correct 9 ms 20564 KB Output is correct
17 Correct 10 ms 20776 KB Output is correct
18 Correct 10 ms 20820 KB Output is correct
19 Correct 9 ms 20692 KB Output is correct
20 Correct 9 ms 20692 KB Output is correct
21 Correct 9 ms 20564 KB Output is correct
22 Correct 9 ms 20692 KB Output is correct
23 Correct 9 ms 20820 KB Output is correct
24 Correct 10 ms 21060 KB Output is correct
25 Correct 9 ms 20720 KB Output is correct
26 Correct 9 ms 20856 KB Output is correct
27 Correct 9 ms 20820 KB Output is correct
28 Correct 9 ms 21076 KB Output is correct
29 Correct 10 ms 20948 KB Output is correct
30 Correct 9 ms 20680 KB Output is correct
31 Correct 9 ms 20784 KB Output is correct
32 Correct 10 ms 20784 KB Output is correct
33 Correct 11 ms 21332 KB Output is correct
34 Correct 11 ms 21332 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 20564 KB Output is correct
2 Correct 9 ms 20564 KB Output is correct
3 Correct 9 ms 20616 KB Output is correct
4 Correct 9 ms 20576 KB Output is correct
5 Correct 9 ms 20564 KB Output is correct
6 Correct 8 ms 20552 KB Output is correct
7 Correct 9 ms 20564 KB Output is correct
8 Correct 10 ms 20564 KB Output is correct
9 Correct 8 ms 20564 KB Output is correct
10 Correct 9 ms 20540 KB Output is correct
11 Correct 10 ms 20692 KB Output is correct
12 Correct 9 ms 20564 KB Output is correct
13 Correct 9 ms 20564 KB Output is correct
14 Correct 9 ms 20692 KB Output is correct
15 Correct 9 ms 20692 KB Output is correct
16 Correct 9 ms 20564 KB Output is correct
17 Correct 9 ms 20844 KB Output is correct
18 Correct 10 ms 20820 KB Output is correct
19 Correct 9 ms 20692 KB Output is correct
20 Correct 11 ms 20692 KB Output is correct
21 Correct 9 ms 20564 KB Output is correct
22 Correct 9 ms 20696 KB Output is correct
23 Correct 10 ms 20820 KB Output is correct
24 Correct 10 ms 21060 KB Output is correct
25 Correct 9 ms 20692 KB Output is correct
26 Correct 9 ms 20936 KB Output is correct
27 Correct 10 ms 20820 KB Output is correct
28 Correct 10 ms 21076 KB Output is correct
29 Correct 10 ms 20948 KB Output is correct
30 Correct 9 ms 20728 KB Output is correct
31 Correct 10 ms 20784 KB Output is correct
32 Correct 9 ms 20692 KB Output is correct
33 Correct 10 ms 21332 KB Output is correct
34 Correct 10 ms 21332 KB Output is correct
35 Correct 15 ms 21832 KB Output is correct
36 Correct 10 ms 20948 KB Output is correct
37 Correct 16 ms 22216 KB Output is correct
38 Correct 18 ms 22280 KB Output is correct
39 Correct 18 ms 22212 KB Output is correct
40 Correct 17 ms 22256 KB Output is correct
41 Correct 17 ms 22280 KB Output is correct
42 Correct 13 ms 21116 KB Output is correct
43 Correct 13 ms 21032 KB Output is correct
44 Correct 13 ms 20948 KB Output is correct
45 Correct 24 ms 24020 KB Output is correct
46 Correct 21 ms 24020 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 20520 KB Output is correct
2 Correct 8 ms 20668 KB Output is correct
3 Correct 9 ms 20532 KB Output is correct
4 Correct 9 ms 20564 KB Output is correct
5 Correct 9 ms 20564 KB Output is correct
6 Correct 10 ms 20504 KB Output is correct
7 Correct 9 ms 20564 KB Output is correct
8 Correct 9 ms 20568 KB Output is correct
9 Correct 9 ms 20536 KB Output is correct
10 Correct 9 ms 20644 KB Output is correct
11 Correct 10 ms 20692 KB Output is correct
12 Correct 9 ms 20564 KB Output is correct
13 Correct 10 ms 20608 KB Output is correct
14 Correct 10 ms 20692 KB Output is correct
15 Correct 9 ms 20620 KB Output is correct
16 Correct 9 ms 20564 KB Output is correct
17 Correct 10 ms 20820 KB Output is correct
18 Correct 10 ms 20820 KB Output is correct
19 Correct 9 ms 20692 KB Output is correct
20 Correct 9 ms 20692 KB Output is correct
21 Correct 9 ms 20612 KB Output is correct
22 Correct 9 ms 20736 KB Output is correct
23 Correct 11 ms 20820 KB Output is correct
24 Correct 10 ms 20948 KB Output is correct
25 Correct 10 ms 20692 KB Output is correct
26 Correct 10 ms 20928 KB Output is correct
27 Correct 9 ms 20744 KB Output is correct
28 Correct 11 ms 21076 KB Output is correct
29 Correct 10 ms 20944 KB Output is correct
30 Correct 9 ms 20648 KB Output is correct
31 Correct 10 ms 20820 KB Output is correct
32 Correct 10 ms 20780 KB Output is correct
33 Correct 11 ms 21408 KB Output is correct
34 Correct 10 ms 21332 KB Output is correct
35 Correct 15 ms 21844 KB Output is correct
36 Correct 10 ms 20948 KB Output is correct
37 Correct 16 ms 22228 KB Output is correct
38 Correct 17 ms 22356 KB Output is correct
39 Correct 16 ms 22216 KB Output is correct
40 Correct 16 ms 22288 KB Output is correct
41 Correct 16 ms 22312 KB Output is correct
42 Correct 14 ms 21076 KB Output is correct
43 Correct 13 ms 21060 KB Output is correct
44 Correct 12 ms 20860 KB Output is correct
45 Correct 24 ms 24056 KB Output is correct
46 Correct 22 ms 23940 KB Output is correct
47 Correct 27 ms 31572 KB Output is correct
48 Correct 28 ms 34900 KB Output is correct
49 Correct 24 ms 32288 KB Output is correct
50 Correct 22 ms 32424 KB Output is correct
51 Correct 36 ms 41760 KB Output is correct
52 Correct 37 ms 44312 KB Output is correct
53 Correct 18 ms 22420 KB Output is correct
54 Correct 9 ms 20948 KB Output is correct
55 Correct 9 ms 21332 KB Output is correct
56 Correct 17 ms 22196 KB Output is correct
57 Correct 12 ms 23592 KB Output is correct
58 Correct 17 ms 23312 KB Output is correct
59 Correct 19 ms 26888 KB Output is correct
60 Correct 26 ms 36664 KB Output is correct
61 Correct 21 ms 28492 KB Output is correct
62 Correct 38 ms 37588 KB Output is correct
63 Correct 101 ms 34800 KB Output is correct
64 Correct 124 ms 37812 KB Output is correct
65 Incorrect 40 ms 30900 KB Output isn't correct
66 Halted 0 ms 0 KB -