# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
198556 | alexandra_udristoiu | Crocodile's Underground City (IOI11_crocodile) | C++14 | 1226 ms | 61048 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<iostream>
#include<vector>
#include<set>
#define DIM 100005
#define f first
#define s second
using namespace std;
static int viz[DIM];
static pair<int, int> d[DIM];
static vector< pair<int, int> > v[DIM];
static set< pair<int, int> > h;
int travel_plan(int n, int m, int r[][2], int L[], int k, int p[]){
int i, nod, ii, vecin;
set< pair<int, int> > :: iterator it;
for(i = 1; i <= n; i++){
d[i].f = d[i].s = 1000000000;
}
for(i = 0; i < k; i++){
p[i]++;
d[ p[i] ] = make_pair(0, 0);
}
for(i = 0; i < m; i++){
r[i][0]++; r[i][1]++;
v[ r[i][0] ].push_back( make_pair(r[i][1], L[i]) );
v[ r[i][1] ].push_back( make_pair(r[i][0], L[i]) );
}
d[0].s = 1000000001;
for(i = 1; i <= n; i++){
h.insert( make_pair(d[i].s, i) );
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... |