# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
425814 | dxz05 | Crocodile's Underground City (IOI11_crocodile) | C++14 | 6 ms | 7372 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "crocodile.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MP make_pair
const ll INF = 1e18 + 1e8;
const int N = 3e5 + 3e2;
vector<pair<int, int>> g[N];
ll dp[N];
bool processed[N];
int cnt[N];
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]){
for (int i = 0; i < M; i++){
g[R[i][0]].emplace_back(R[i][1], L[i]);
g[R[i][1]].emplace_back(R[i][0], L[i]);
}
fill(dp, dp + N, INF);
for (int i = 0; i < K; i++){
dp[P[i]] = 0;
}
set<pair<int, int>> s;
for (int i = 0; i < N; i++){
if (dp[i] == 0) continue;
for (auto edge : g[i]){
int j = edge.first, w = edge.second;
if (dp[j] != INF) cnt[i]++;
}
s.insert(MP(cnt[i], i));
}
while (!s.empty()){
int x = s.rbegin()->second;
//assert(s.begin()->first >= 2);
s.erase(MP(cnt[x], x));
vector<ll> vec;
for (auto edge : g[x]){
int y = edge.first, w = edge.second;
vec.push_back(dp[y] + w);
}
sort(vec.begin(), vec.end());
//for (ll val : vec) cout << val << ' '; cout << endl;
dp[x] = vec[1];
//cout << x << ' ' << dp[x] << endl;
for (auto edge : g[x]){
int y = edge.second, w = edge.second;
if (s.find(MP(cnt[y], y)) != s.end()){
s.erase(MP(cnt[y], y));
cnt[y]++;
s.insert(MP(cnt[y], y));
}
}
}
//for (int i = 0; i < N; i++) cout << dp[i] << ' ';
return dp[0];
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |