oj.uz

Submission #733605

# Submission time Handle Problem Language Result Execution time Memory
733605 2023-05-01T04:39:28 Z SanguineChameleon Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 339 ms 262144 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 = 2e6 + 20;
const int inf = 1e9 + 20;
int B[maxN];
int P[maxN];
vector<pair<int, bool>> adj[maxC];
int dist[maxC];
bool flag[maxN];
int id[maxN];

void just_do_it() {
	int N, M;
	cin >> N >> M;
	const int lim = 500;
	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) {
					adj[cnt].emplace_back(cnt + 1, 1);
					adj[cnt + 1].emplace_back(cnt, 1);
				}
				if (cur == B[i]) {
					adj[B[i]].emplace_back(cnt, 0);
				}
				adj[cnt].emplace_back(cur, 0);
				cnt++;
			}
		}
	}
	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) {
					adj[cnt].emplace_back(cnt + 1, 1);
					adj[cnt + 1].emplace_back(cnt, 1);
				}
				id[cur] = cnt;
				adj[cnt].emplace_back(cur, 0);
				cnt++;
			}
		}
		for (int i = 0; i < M; i++) {
			if (P[i] == d && !flag[B[i]]) {
				flag[B[i]] = true;
				adj[B[i]].emplace_back(id[B[i]], 0);
			}
		}
	}
	assert(cnt < maxC);
	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();
		q.pop_front();
		for (auto p: adj[u]) {
			int v = p.first;
			int w = p.second;
			if (dist[u] + w < dist[v]) {
				dist[v] = dist[u] + w;
				if (w == 0) {
					q.push_front(v);
				}
				else {
					q.push_back(v);
				}
			}
		}
	}
	if (dist[B[1]] == inf) {
		cout << -1;
	}
	else {
		cout << dist[B[1]];
	}
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 47188 KB Output is correct
2 Correct 26 ms 47188 KB Output is correct
3 Correct 23 ms 47216 KB Output is correct
4 Correct 25 ms 47208 KB Output is correct
5 Correct 25 ms 47180 KB Output is correct
6 Correct 24 ms 47300 KB Output is correct
7 Correct 25 ms 47276 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 47316 KB Output is correct
2 Correct 24 ms 47280 KB Output is correct
3 Correct 25 ms 47316 KB Output is correct
4 Correct 25 ms 47272 KB Output is correct
5 Correct 24 ms 47248 KB Output is correct
6 Correct 26 ms 47304 KB Output is correct
7 Correct 25 ms 47188 KB Output is correct
8 Correct 24 ms 47256 KB Output is correct
9 Correct 27 ms 47392 KB Output is correct
10 Correct 25 ms 47664 KB Output is correct
11 Correct 27 ms 47700 KB Output is correct
12 Correct 26 ms 47344 KB Output is correct
13 Correct 25 ms 47316 KB Output is correct
14 Correct 26 ms 47548 KB Output is correct
15 Correct 26 ms 47516 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 47188 KB Output is correct
2 Correct 25 ms 47248 KB Output is correct
3 Correct 27 ms 47268 KB Output is correct
4 Correct 27 ms 47180 KB Output is correct
5 Correct 25 ms 47308 KB Output is correct
6 Correct 25 ms 47336 KB Output is correct
7 Correct 26 ms 47188 KB Output is correct
8 Correct 26 ms 47296 KB Output is correct
9 Correct 25 ms 47316 KB Output is correct
10 Correct 26 ms 47700 KB Output is correct
11 Correct 26 ms 47692 KB Output is correct
12 Correct 25 ms 47392 KB Output is correct
13 Correct 25 ms 47316 KB Output is correct
14 Correct 27 ms 47544 KB Output is correct
15 Correct 27 ms 47560 KB Output is correct
16 Correct 28 ms 48868 KB Output is correct
17 Correct 59 ms 60744 KB Output is correct
18 Correct 64 ms 63704 KB Output is correct
19 Correct 51 ms 59300 KB Output is correct
20 Correct 27 ms 47488 KB Output is correct
21 Correct 30 ms 50392 KB Output is correct
22 Correct 52 ms 59800 KB Output is correct
23 Correct 58 ms 61644 KB Output is correct
24 Correct 87 ms 75040 KB Output is correct
25 Correct 27 ms 47828 KB Output is correct
26 Correct 46 ms 57408 KB Output is correct
27 Correct 45 ms 56396 KB Output is correct
28 Correct 68 ms 65596 KB Output is correct
29 Correct 35 ms 50488 KB Output is correct
30 Correct 27 ms 48172 KB Output is correct
31 Correct 30 ms 48924 KB Output is correct
32 Correct 27 ms 48468 KB Output is correct
33 Correct 47 ms 53804 KB Output is correct
34 Correct 49 ms 53796 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 47188 KB Output is correct
2 Correct 25 ms 47188 KB Output is correct
3 Correct 25 ms 47216 KB Output is correct
4 Correct 26 ms 47220 KB Output is correct
5 Correct 30 ms 47208 KB Output is correct
6 Correct 25 ms 47272 KB Output is correct
7 Correct 25 ms 47188 KB Output is correct
8 Correct 26 ms 47316 KB Output is correct
9 Correct 29 ms 47284 KB Output is correct
10 Correct 26 ms 47688 KB Output is correct
11 Correct 26 ms 47728 KB Output is correct
12 Correct 25 ms 47308 KB Output is correct
13 Correct 24 ms 47288 KB Output is correct
14 Correct 27 ms 47572 KB Output is correct
15 Correct 26 ms 47596 KB Output is correct
16 Correct 30 ms 48852 KB Output is correct
17 Correct 57 ms 60788 KB Output is correct
18 Correct 64 ms 63668 KB Output is correct
19 Correct 52 ms 59352 KB Output is correct
20 Correct 26 ms 47460 KB Output is correct
21 Correct 31 ms 50436 KB Output is correct
22 Correct 55 ms 59764 KB Output is correct
23 Correct 59 ms 61800 KB Output is correct
24 Correct 89 ms 75132 KB Output is correct
25 Correct 27 ms 47820 KB Output is correct
26 Correct 46 ms 57488 KB Output is correct
27 Correct 45 ms 56416 KB Output is correct
28 Correct 66 ms 65596 KB Output is correct
29 Correct 35 ms 50524 KB Output is correct
30 Correct 30 ms 48120 KB Output is correct
31 Correct 29 ms 49000 KB Output is correct
32 Correct 27 ms 48468 KB Output is correct
33 Correct 45 ms 53712 KB Output is correct
34 Correct 47 ms 53716 KB Output is correct
35 Correct 123 ms 81508 KB Output is correct
36 Correct 76 ms 68800 KB Output is correct
37 Correct 159 ms 94112 KB Output is correct
38 Correct 167 ms 96572 KB Output is correct
39 Correct 171 ms 96584 KB Output is correct
40 Correct 168 ms 96540 KB Output is correct
41 Correct 168 ms 96492 KB Output is correct
42 Correct 57 ms 57676 KB Output is correct
43 Correct 54 ms 56632 KB Output is correct
44 Correct 33 ms 47700 KB Output is correct
45 Correct 159 ms 71960 KB Output is correct
46 Correct 151 ms 71984 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 47256 KB Output is correct
2 Correct 25 ms 47292 KB Output is correct
3 Correct 25 ms 47288 KB Output is correct
4 Correct 28 ms 47312 KB Output is correct
5 Correct 28 ms 47288 KB Output is correct
6 Correct 24 ms 47316 KB Output is correct
7 Correct 24 ms 47188 KB Output is correct
8 Correct 25 ms 47232 KB Output is correct
9 Correct 27 ms 47368 KB Output is correct
10 Correct 29 ms 47604 KB Output is correct
11 Correct 29 ms 47692 KB Output is correct
12 Correct 26 ms 47388 KB Output is correct
13 Correct 25 ms 47256 KB Output is correct
14 Correct 30 ms 47572 KB Output is correct
15 Correct 27 ms 47556 KB Output is correct
16 Correct 32 ms 48840 KB Output is correct
17 Correct 57 ms 60784 KB Output is correct
18 Correct 62 ms 63764 KB Output is correct
19 Correct 52 ms 59420 KB Output is correct
20 Correct 28 ms 47444 KB Output is correct
21 Correct 32 ms 50364 KB Output is correct
22 Correct 52 ms 59868 KB Output is correct
23 Correct 60 ms 61644 KB Output is correct
24 Correct 91 ms 75076 KB Output is correct
25 Correct 28 ms 47924 KB Output is correct
26 Correct 52 ms 57420 KB Output is correct
27 Correct 47 ms 56376 KB Output is correct
28 Correct 66 ms 65612 KB Output is correct
29 Correct 34 ms 50564 KB Output is correct
30 Correct 27 ms 48212 KB Output is correct
31 Correct 29 ms 48948 KB Output is correct
32 Correct 27 ms 48516 KB Output is correct
33 Correct 46 ms 53728 KB Output is correct
34 Correct 44 ms 53708 KB Output is correct
35 Correct 121 ms 81492 KB Output is correct
36 Correct 75 ms 68904 KB Output is correct
37 Correct 169 ms 94160 KB Output is correct
38 Correct 173 ms 96632 KB Output is correct
39 Correct 177 ms 96524 KB Output is correct
40 Correct 168 ms 96616 KB Output is correct
41 Correct 168 ms 96620 KB Output is correct
42 Correct 56 ms 57608 KB Output is correct
43 Correct 57 ms 56580 KB Output is correct
44 Correct 33 ms 47688 KB Output is correct
45 Correct 150 ms 72024 KB Output is correct
46 Correct 151 ms 72068 KB Output is correct
47 Runtime error 339 ms 262144 KB Execution killed with signal 11
48 Halted 0 ms 0 KB -