# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
425833 | dxz05 | Crocodile's Underground City (IOI11_crocodile) | C++14 | 2059 ms | 44680 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;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |