| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 108261 | SecretAgent007 | Crocodile's Underground City (IOI11_crocodile) | C++17 | 3 ms | 384 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 <bits/stdc++.h>
using namespace std;
//#define int long long
const long long INF = 1e18;
int travel_plan(int n, int m, int r[][2], int l[], int k, int p[]){
set< int > exit;
for(int i = 0; i < k; i++){
exit.insert(p[i]);
}
vector< vector< pair<long long, long long> > > Graph(n);
for(int i = 0; i < m; i++){
Graph[r[i][0]].push_back(make_pair(l[i], r[i][1]));
Graph[r[i][1]].push_back(make_pair(l[i], r[i][0]));
}
for(int i = 0; i < n; i++){
sort(Graph[i].begin(), Graph[i].end());
}
priority_queue< pair<long long, long long>, vector< pair<long long, long long> >, greater< pair<long long, long long> > > pq;
vector< long long > dist(n, INF);
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||