oj.uz

답안 #756592

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
756592 2023-06-12T01:04:41 Z pavement 악어의 지하 도시 (IOI11_crocodile) C++17
89 / 100
 527 ms 72992 KB 
#include "crocodile.h"
#include <bits/stdc++.h>
using namespace std;

#define eb emplace_back
using ll = long long;
using ii = pair<int, int>;

ll fd[100005], sd[100005];
bool vis[100005];
vector<pair<int, ll> > adj[100005];
priority_queue<pair<ll, int>, vector<pair<ll, int> >, greater<pair<ll, int> > > pq;

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]) {
	for (int i = 0; i < M; i++) {
		adj[R[i][0]].eb(R[i][1], L[i]);
		adj[R[i][1]].eb(R[i][0], L[i]);
	}
	for (int i = 0; i < N; i++) {
		fd[i] = sd[i] = (ll)1e16;
	}
	for (int i = 0; i < K; i++) {
		fd[P[i]] = sd[P[i]] = 0;
		pq.emplace(0, P[i]);
	}
	while (!pq.empty()) {
		auto [d, v] = pq.top();
		pq.pop();
		if (sd[v] != d) continue;
		if (v == 0) return d;
		vis[v] = 1;
		for (auto [u, w] : adj[v]) {
			ll c = d + w;
			if (c < sd[u]) {
				assert(!vis[u]);
				sd[u] = c;
				if (sd[u] < fd[u]) swap(fd[u], sd[u]);
				if (sd[u] != (ll)1e16) pq.emplace(sd[u], u);
			}
		}
	}
	assert(0);
}

Subtask #1
46.0 / 46.0

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

Subtask #2
43.0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2696 KB Output is correct
5 Correct 3 ms 2772 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2772 KB Output is correct
8 Correct 2 ms 2772 KB Output is correct
9 Correct 3 ms 3028 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2740 KB Output is correct
12 Correct 4 ms 3284 KB Output is correct
13 Correct 5 ms 3412 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2772 KB Output is correct

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2696 KB Output is correct
5 Correct 3 ms 2772 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2772 KB Output is correct
8 Correct 2 ms 2772 KB Output is correct
9 Correct 3 ms 3028 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2740 KB Output is correct
12 Correct 4 ms 3284 KB Output is correct
13 Correct 5 ms 3412 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2772 KB Output is correct
16 Correct 402 ms 66840 KB Output is correct
17 Correct 81 ms 14384 KB Output is correct
18 Correct 83 ms 16640 KB Output is correct
19 Correct 527 ms 72992 KB Output is correct
20 Correct 258 ms 55016 KB Output is correct
21 Correct 35 ms 8272 KB Output is correct
22 Incorrect 303 ms 49932 KB Output isn't correct
23 Halted 0 ms 0 KB -