oj.uz

답안 #341813

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
341813 2020-12-31T05:44:48 Z egod1537 Jakarta Skyscrapers (APIO15_skyscraper) C++14
36 / 100
 1000 ms 191400 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;
}

set<pi> V[30001];
set<int> inpos[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);

	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;
		inpos[doge[i].pos].insert(doge[i].range);
	}
	sort(doge.begin(), doge.end(), [](pi& a, pi& b) -> bool {
		if (a.range != b.range) return a.range > b.range;
		return a.pos < b.pos;
		});

	for (int i = 0; i < m; i++) {
		pi& now = doge[i];
		set<pi>& nV = V[now.pos];

		for (int j = now.pos + now.range; j < n; j += now.range) {
			if (inpos[j].size() == 0) continue;
			int dst = j - now.pos;

			nV.insert({ j, dst / now.range });
			//if (inpos[j].find(now.range) != inpos[j].end()) break;
		}
		for (int j = now.pos - now.range; j >= 0; j -= now.range) {
			if (inpos[j].size() == 0) continue;
			int dst = now.pos - j;

			nV.insert({ j, dst / now.range });
			//if (inpos[j].find(now.range) != inpos[j].end()) break;
		}
	}

	vector<int> vit(n, -1);

	int num = 0;
	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 (vit[w.to] == num) continue;
			if (dst[w.to] > top.cost + w.cost) {
				dst[w.to] = top.cost + w.cost;
				pq.push({ w.to, dst[w.to] });
			}
			vit[w.to] = num;
		}

		num++;
	}

	cout << -1;

	return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3308 KB Output is correct
2 Correct 2 ms 3308 KB Output is correct
3 Correct 2 ms 3308 KB Output is correct
4 Correct 2 ms 3308 KB Output is correct
5 Correct 2 ms 3308 KB Output is correct
6 Correct 2 ms 3308 KB Output is correct
7 Correct 2 ms 3308 KB Output is correct
8 Correct 2 ms 3308 KB Output is correct
9 Correct 2 ms 3308 KB Output is correct
10 Correct 3 ms 3308 KB Output is correct
11 Correct 4 ms 3692 KB Output is correct
12 Correct 3 ms 3308 KB Output is correct
13 Correct 8 ms 3820 KB Output is correct
14 Correct 3 ms 3436 KB Output is correct
15 Correct 4 ms 3436 KB Output is correct
16 Correct 3 ms 3564 KB Output is correct
17 Correct 6 ms 4332 KB Output is correct
18 Correct 3 ms 3436 KB Output is correct
19 Correct 3 ms 3328 KB Output is correct
20 Correct 634 ms 191340 KB Output is correct
21 Correct 3 ms 3436 KB Output is correct
22 Correct 3 ms 3456 KB Output is correct
23 Correct 3 ms 3436 KB Output is correct
24 Correct 5 ms 3692 KB Output is correct
25 Correct 4 ms 3692 KB Output is correct
26 Correct 13 ms 3308 KB Output is correct
27 Correct 11 ms 3308 KB Output is correct
28 Correct 6 ms 4332 KB Output is correct
29 Correct 3 ms 3308 KB Output is correct
30 Correct 3 ms 3308 KB Output is correct
31 Correct 3 ms 3308 KB Output is correct
32 Correct 3 ms 3308 KB Output is correct
33 Correct 4 ms 3436 KB Output is correct
34 Correct 4 ms 3436 KB Output is correct

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3308 KB Output is correct
2 Correct 2 ms 3308 KB Output is correct
3 Correct 2 ms 3308 KB Output is correct
4 Correct 2 ms 3308 KB Output is correct
5 Correct 2 ms 3308 KB Output is correct
6 Correct 2 ms 3308 KB Output is correct
7 Correct 2 ms 3308 KB Output is correct
8 Correct 3 ms 3308 KB Output is correct
9 Correct 3 ms 3308 KB Output is correct
10 Correct 3 ms 3308 KB Output is correct
11 Correct 4 ms 3692 KB Output is correct
12 Correct 3 ms 3328 KB Output is correct
13 Correct 8 ms 3840 KB Output is correct
14 Correct 3 ms 3436 KB Output is correct
15 Correct 3 ms 3436 KB Output is correct
16 Correct 3 ms 3564 KB Output is correct
17 Correct 6 ms 4332 KB Output is correct
18 Correct 3 ms 3436 KB Output is correct
19 Correct 3 ms 3308 KB Output is correct
20 Correct 627 ms 191400 KB Output is correct
21 Correct 3 ms 3436 KB Output is correct
22 Correct 3 ms 3456 KB Output is correct
23 Correct 3 ms 3436 KB Output is correct
24 Correct 4 ms 3692 KB Output is correct
25 Correct 4 ms 3584 KB Output is correct
26 Correct 13 ms 3308 KB Output is correct
27 Correct 11 ms 3308 KB Output is correct
28 Correct 6 ms 4332 KB Output is correct
29 Correct 3 ms 3308 KB Output is correct
30 Correct 2 ms 3308 KB Output is correct
31 Correct 3 ms 3308 KB Output is correct
32 Correct 3 ms 3308 KB Output is correct
33 Correct 4 ms 3456 KB Output is correct
34 Correct 4 ms 3436 KB Output is correct
35 Correct 38 ms 10880 KB Output is correct
36 Correct 6 ms 4332 KB Output is correct
37 Correct 62 ms 17388 KB Output is correct
38 Correct 58 ms 14956 KB Output is correct
39 Correct 55 ms 15852 KB Output is correct
40 Correct 53 ms 15212 KB Output is correct
41 Correct 60 ms 14828 KB Output is correct
42 Correct 175 ms 3564 KB Output is correct
43 Correct 150 ms 3692 KB Output is correct
44 Execution timed out 1100 ms 191236 KB Time limit exceeded
45 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3308 KB Output is correct
2 Correct 2 ms 3308 KB Output is correct
3 Correct 2 ms 3308 KB Output is correct
4 Correct 3 ms 3308 KB Output is correct
5 Correct 2 ms 3308 KB Output is correct
6 Correct 3 ms 3308 KB Output is correct
7 Correct 2 ms 3308 KB Output is correct
8 Correct 3 ms 3308 KB Output is correct
9 Correct 2 ms 3308 KB Output is correct
10 Correct 3 ms 3308 KB Output is correct
11 Correct 4 ms 3692 KB Output is correct
12 Correct 3 ms 3308 KB Output is correct
13 Correct 8 ms 3820 KB Output is correct
14 Correct 4 ms 3436 KB Output is correct
15 Correct 4 ms 3436 KB Output is correct
16 Correct 3 ms 3564 KB Output is correct
17 Correct 6 ms 4332 KB Output is correct
18 Correct 3 ms 3436 KB Output is correct
19 Correct 3 ms 3308 KB Output is correct
20 Correct 629 ms 191212 KB Output is correct
21 Correct 3 ms 3436 KB Output is correct
22 Correct 3 ms 3436 KB Output is correct
23 Correct 3 ms 3436 KB Output is correct
24 Correct 4 ms 3692 KB Output is correct
25 Correct 4 ms 3692 KB Output is correct
26 Correct 13 ms 3308 KB Output is correct
27 Correct 11 ms 3308 KB Output is correct
28 Correct 7 ms 4332 KB Output is correct
29 Correct 3 ms 3308 KB Output is correct
30 Correct 3 ms 3308 KB Output is correct
31 Correct 3 ms 3308 KB Output is correct
32 Correct 3 ms 3308 KB Output is correct
33 Correct 4 ms 3436 KB Output is correct
34 Correct 4 ms 3436 KB Output is correct
35 Correct 39 ms 10988 KB Output is correct
36 Correct 6 ms 4332 KB Output is correct
37 Correct 64 ms 17516 KB Output is correct
38 Correct 57 ms 14956 KB Output is correct
39 Correct 55 ms 15852 KB Output is correct
40 Correct 53 ms 15212 KB Output is correct
41 Correct 56 ms 14828 KB Output is correct
42 Correct 175 ms 3564 KB Output is correct
43 Correct 151 ms 3564 KB Output is correct
44 Execution timed out 1103 ms 191212 KB Time limit exceeded
45 Halted 0 ms 0 KB -