oj.uz

답안 #341808

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
341808 2020-12-31T05:18:51 Z egod1537 Jakarta Skyscrapers (APIO15_skyscraper) C++14
36 / 100
 400 ms 262148 KB 
#include <bits/stdc++.h>

using namespace std;

const int INF = 0x3f3f3f3f;

typedef pair<int, int> pi;
#define to first
#define cost second
#define pos first
#define range second

struct Q {
	int pos, cost;
};
bool operator<(const Q& a, const Q& b) {
	return a.cost > b.cost;
}

vector<pi> V[30001];
int dst[30001];

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);

	memset(dst, INF, sizeof(dst));

	int n, m; cin >> n >> m;
	vector<pi> doge(m);
	vector<int> posdoge(n + 1, -1);

	int s = 0, e = 0;
	for (int i = 0; i < m; i++) {
		cin >> doge[i].pos >> doge[i].range;
		if (i == 0) s = doge[i].pos;
		if (i == 1) e = doge[i].pos;
	}

	for (int i = 0; i < m; i++) {
		pi& now = doge[i];
		for (int j = now.pos + now.range; j < n; j += now.range) {
			int dst = j - now.pos;
			V[now.pos].push_back({ j, dst / now.range });
		}
		for (int j = now.pos - now.range; j >= 0; j -= now.range) {
			int dst = now.pos - j;
			V[now.pos].push_back({ j, dst / now.range });
		}
	}

	priority_queue<Q> pq;
	pq.push({ s, 0 });
	while (!pq.empty()) {
		Q top = pq.top(); pq.pop();

		if (top.pos == e) {
			cout << top.cost;
			return 0;
		}

		for (pi w : V[top.pos]) {
			if (dst[w.to] > top.cost + w.cost) {
				dst[w.to] = top.cost + w.cost;
				pq.push({ w.to, dst[w.to] });
			}
		}
	}

	cout << -1;

	return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1132 KB Output is correct
2 Correct 1 ms 1132 KB Output is correct
3 Correct 1 ms 1132 KB Output is correct
4 Correct 1 ms 1132 KB Output is correct
5 Correct 1 ms 1132 KB Output is correct
6 Correct 1 ms 1132 KB Output is correct
7 Correct 1 ms 1132 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1132 KB Output is correct
2 Correct 1 ms 1132 KB Output is correct
3 Correct 1 ms 1132 KB Output is correct
4 Correct 1 ms 1132 KB Output is correct
5 Correct 1 ms 1132 KB Output is correct
6 Correct 1 ms 1132 KB Output is correct
7 Correct 1 ms 1132 KB Output is correct
8 Correct 1 ms 1132 KB Output is correct
9 Correct 1 ms 1132 KB Output is correct
10 Correct 1 ms 1132 KB Output is correct
11 Correct 2 ms 1260 KB Output is correct
12 Correct 5 ms 3304 KB Output is correct
13 Correct 5 ms 3312 KB Output is correct
14 Correct 1 ms 1260 KB Output is correct
15 Correct 1 ms 1260 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1132 KB Output is correct
2 Correct 1 ms 1132 KB Output is correct
3 Correct 1 ms 1132 KB Output is correct
4 Correct 1 ms 1132 KB Output is correct
5 Correct 1 ms 1132 KB Output is correct
6 Correct 1 ms 1132 KB Output is correct
7 Correct 1 ms 1132 KB Output is correct
8 Correct 1 ms 1132 KB Output is correct
9 Correct 1 ms 1152 KB Output is correct
10 Correct 1 ms 1132 KB Output is correct
11 Correct 2 ms 1280 KB Output is correct
12 Correct 5 ms 3304 KB Output is correct
13 Correct 5 ms 3312 KB Output is correct
14 Correct 1 ms 1260 KB Output is correct
15 Correct 2 ms 1260 KB Output is correct
16 Correct 1 ms 1260 KB Output is correct
17 Correct 2 ms 1388 KB Output is correct
18 Correct 1 ms 1260 KB Output is correct
19 Correct 1 ms 1260 KB Output is correct
20 Correct 69 ms 33260 KB Output is correct
21 Correct 1 ms 1132 KB Output is correct
22 Correct 1 ms 1260 KB Output is correct
23 Correct 1 ms 1260 KB Output is correct
24 Correct 2 ms 1388 KB Output is correct
25 Correct 2 ms 1260 KB Output is correct
26 Correct 70 ms 34232 KB Output is correct
27 Correct 68 ms 34228 KB Output is correct
28 Correct 2 ms 1388 KB Output is correct
29 Correct 3 ms 2028 KB Output is correct
30 Correct 2 ms 1516 KB Output is correct
31 Correct 2 ms 1644 KB Output is correct
32 Correct 2 ms 1516 KB Output is correct
33 Correct 5 ms 2796 KB Output is correct
34 Correct 5 ms 2688 KB Output is correct

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1132 KB Output is correct
2 Correct 1 ms 1132 KB Output is correct
3 Correct 1 ms 1260 KB Output is correct
4 Correct 1 ms 1132 KB Output is correct
5 Correct 1 ms 1132 KB Output is correct
6 Correct 1 ms 1132 KB Output is correct
7 Correct 1 ms 1132 KB Output is correct
8 Correct 1 ms 1132 KB Output is correct
9 Correct 1 ms 1132 KB Output is correct
10 Correct 1 ms 1132 KB Output is correct
11 Correct 1 ms 1260 KB Output is correct
12 Correct 5 ms 3304 KB Output is correct
13 Correct 6 ms 3312 KB Output is correct
14 Correct 1 ms 1260 KB Output is correct
15 Correct 1 ms 1260 KB Output is correct
16 Correct 1 ms 1260 KB Output is correct
17 Correct 2 ms 1388 KB Output is correct
18 Correct 1 ms 1260 KB Output is correct
19 Correct 1 ms 1260 KB Output is correct
20 Correct 66 ms 33260 KB Output is correct
21 Correct 1 ms 1132 KB Output is correct
22 Correct 1 ms 1260 KB Output is correct
23 Correct 2 ms 1260 KB Output is correct
24 Correct 2 ms 1388 KB Output is correct
25 Correct 2 ms 1260 KB Output is correct
26 Correct 69 ms 34232 KB Output is correct
27 Correct 68 ms 34244 KB Output is correct
28 Correct 2 ms 1388 KB Output is correct
29 Correct 3 ms 2028 KB Output is correct
30 Correct 2 ms 1516 KB Output is correct
31 Correct 2 ms 1644 KB Output is correct
32 Correct 2 ms 1516 KB Output is correct
33 Correct 5 ms 2796 KB Output is correct
34 Correct 5 ms 2688 KB Output is correct
35 Correct 9 ms 2924 KB Output is correct
36 Correct 3 ms 1388 KB Output is correct
37 Correct 11 ms 4716 KB Output is correct
38 Correct 12 ms 3948 KB Output is correct
39 Correct 11 ms 4076 KB Output is correct
40 Correct 12 ms 4076 KB Output is correct
41 Correct 11 ms 3948 KB Output is correct
42 Runtime error 393 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
43 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1132 KB Output is correct
2 Correct 1 ms 1132 KB Output is correct
3 Correct 1 ms 1132 KB Output is correct
4 Correct 1 ms 1132 KB Output is correct
5 Correct 1 ms 1132 KB Output is correct
6 Correct 1 ms 1132 KB Output is correct
7 Correct 1 ms 1132 KB Output is correct
8 Correct 1 ms 1132 KB Output is correct
9 Correct 1 ms 1132 KB Output is correct
10 Correct 1 ms 1132 KB Output is correct
11 Correct 2 ms 1260 KB Output is correct
12 Correct 5 ms 3304 KB Output is correct
13 Correct 5 ms 3312 KB Output is correct
14 Correct 1 ms 1260 KB Output is correct
15 Correct 1 ms 1260 KB Output is correct
16 Correct 1 ms 1260 KB Output is correct
17 Correct 2 ms 1388 KB Output is correct
18 Correct 1 ms 1260 KB Output is correct
19 Correct 1 ms 1260 KB Output is correct
20 Correct 66 ms 33260 KB Output is correct
21 Correct 1 ms 1132 KB Output is correct
22 Correct 1 ms 1260 KB Output is correct
23 Correct 2 ms 1260 KB Output is correct
24 Correct 2 ms 1388 KB Output is correct
25 Correct 2 ms 1260 KB Output is correct
26 Correct 70 ms 34248 KB Output is correct
27 Correct 66 ms 34252 KB Output is correct
28 Correct 2 ms 1388 KB Output is correct
29 Correct 3 ms 2028 KB Output is correct
30 Correct 2 ms 1516 KB Output is correct
31 Correct 2 ms 1676 KB Output is correct
32 Correct 3 ms 1516 KB Output is correct
33 Correct 5 ms 2796 KB Output is correct
34 Correct 5 ms 2668 KB Output is correct
35 Correct 9 ms 2924 KB Output is correct
36 Correct 2 ms 1388 KB Output is correct
37 Correct 11 ms 4716 KB Output is correct
38 Correct 12 ms 3948 KB Output is correct
39 Correct 12 ms 4076 KB Output is correct
40 Correct 12 ms 4076 KB Output is correct
41 Correct 11 ms 3948 KB Output is correct
42 Runtime error 400 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
43 Halted 0 ms 0 KB -