oj.uz

Submission #946177

# Submission time Handle Problem Language Result Execution time Memory
946177 2024-03-14T11:43:16 Z stdfloat Jakarta Skyscrapers (APIO15_skyscraper) C++17
0 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

int main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);

	int n, m;
	cin >> n >> m;

	vector<int> X(m), P(m);
	for (int i = 0; i < m; i++)
		cin >> X[i] >> P[i];

	vector<int> dis(n, INT_MAX); dis[X[0]] = 0;
	priority_queue<pair<int, pair<int, int>>> q; q.push({0, {X[0], P[0]}});
	while (!q.empty()) {
		int d = q.top().first;
		auto [x, p] = q.top().second; q.pop();
	
		if (x == X[1]) return cout << dis[x], 0;

		if (-d != dis[x]) continue;

		for (int i = x; i >= 0; i -= p) {
			for (int j = 0; j < m; j++) {
				if (!(abs(X[j] - i) % P[j]) && dis[x] + (x - i) / p + abs(X[j] - i) / P[j] < dis[i]) {
					dis[i] = dis[x] + (x - i) / p + abs(X[j] - i) / P[j];
					q.push({-dis[i], {i, P[j]}});
				}
			}
		}
		for (int i = x; i < n; i += p) {
			for (int j = 0; j < m; j++) {
				if (!(abs(X[j] - i) % P[j]) && dis[x] + (i - x) / p + abs(X[j] - i) / P[j] < dis[i]) {
					dis[i] = dis[x] + (i - x) / p + abs(X[j] - i) / P[j];
					q.push({-dis[i], {i, P[j]}});
				}
			}
		}
	}

	cout << -1;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Incorrect 1 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -