oj.uz

Submission #733599

# Submission time Handle Problem Language Result Execution time Memory
733599 2023-05-01T04:27:58 Z SanguineChameleon Jakarta Skyscrapers (APIO15_skyscraper) C++17
22 / 100
 546 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 = 3e6 + 20;
const int inf = 1e9 + 20;
int B[maxN];
int P[maxN];
vector<pair<int, bool>> adj[maxC];
int dist[maxC];

void just_do_it() {
	int N, M;
	cin >> N >> M;
	const int lim = 0;
	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++;
			}
		}
	}
	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 33 ms 70736 KB Output is correct
2 Correct 35 ms 70732 KB Output is correct
3 Correct 34 ms 70732 KB Output is correct
4 Correct 35 ms 70768 KB Output is correct
5 Correct 36 ms 70732 KB Output is correct
6 Correct 35 ms 70740 KB Output is correct
7 Correct 35 ms 70780 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 70740 KB Output is correct
2 Correct 36 ms 70768 KB Output is correct
3 Correct 36 ms 70716 KB Output is correct
4 Correct 37 ms 70760 KB Output is correct
5 Correct 36 ms 70696 KB Output is correct
6 Correct 36 ms 70648 KB Output is correct
7 Correct 40 ms 70680 KB Output is correct
8 Correct 35 ms 70740 KB Output is correct
9 Correct 38 ms 70696 KB Output is correct
10 Correct 37 ms 70868 KB Output is correct
11 Correct 36 ms 71260 KB Output is correct
12 Correct 68 ms 80704 KB Output is correct
13 Correct 70 ms 80904 KB Output is correct
14 Correct 35 ms 71056 KB Output is correct
15 Correct 37 ms 70976 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 70780 KB Output is correct
2 Correct 37 ms 70704 KB Output is correct
3 Correct 35 ms 70644 KB Output is correct
4 Correct 37 ms 70740 KB Output is correct
5 Correct 35 ms 70732 KB Output is correct
6 Correct 38 ms 70672 KB Output is correct
7 Correct 35 ms 70672 KB Output is correct
8 Correct 35 ms 70800 KB Output is correct
9 Correct 36 ms 70740 KB Output is correct
10 Correct 35 ms 70836 KB Output is correct
11 Correct 37 ms 71220 KB Output is correct
12 Correct 69 ms 80704 KB Output is correct
13 Correct 70 ms 80844 KB Output is correct
14 Correct 35 ms 70988 KB Output is correct
15 Correct 35 ms 70988 KB Output is correct
16 Correct 37 ms 70996 KB Output is correct
17 Correct 38 ms 71868 KB Output is correct
18 Correct 41 ms 71068 KB Output is correct
19 Correct 37 ms 70988 KB Output is correct
20 Runtime error 546 ms 262144 KB Execution killed with signal 11
21 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 70836 KB Output is correct
2 Correct 37 ms 70744 KB Output is correct
3 Correct 37 ms 70740 KB Output is correct
4 Correct 38 ms 70660 KB Output is correct
5 Correct 37 ms 70768 KB Output is correct
6 Correct 37 ms 70700 KB Output is correct
7 Correct 39 ms 70684 KB Output is correct
8 Correct 37 ms 70728 KB Output is correct
9 Correct 37 ms 70764 KB Output is correct
10 Correct 38 ms 70848 KB Output is correct
11 Correct 38 ms 71240 KB Output is correct
12 Correct 71 ms 80716 KB Output is correct
13 Correct 72 ms 80948 KB Output is correct
14 Correct 43 ms 70972 KB Output is correct
15 Correct 38 ms 71056 KB Output is correct
16 Correct 38 ms 71072 KB Output is correct
17 Correct 41 ms 71940 KB Output is correct
18 Correct 38 ms 71124 KB Output is correct
19 Correct 39 ms 70984 KB Output is correct
20 Runtime error 515 ms 262144 KB Execution killed with signal 11
21 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 70740 KB Output is correct
2 Correct 37 ms 70724 KB Output is correct
3 Correct 38 ms 70792 KB Output is correct
4 Correct 41 ms 70720 KB Output is correct
5 Correct 43 ms 70652 KB Output is correct
6 Correct 36 ms 70704 KB Output is correct
7 Correct 42 ms 70660 KB Output is correct
8 Correct 38 ms 70708 KB Output is correct
9 Correct 37 ms 70732 KB Output is correct
10 Correct 37 ms 70800 KB Output is correct
11 Correct 39 ms 71244 KB Output is correct
12 Correct 70 ms 80800 KB Output is correct
13 Correct 72 ms 80940 KB Output is correct
14 Correct 37 ms 71060 KB Output is correct
15 Correct 38 ms 71056 KB Output is correct
16 Correct 38 ms 71052 KB Output is correct
17 Correct 41 ms 71884 KB Output is correct
18 Correct 39 ms 71068 KB Output is correct
19 Correct 41 ms 70996 KB Output is correct
20 Runtime error 521 ms 262144 KB Execution killed with signal 11
21 Halted 0 ms 0 KB -