oj.uz

Submission #10431

# Submission time Handle Problem Language Result Execution time Memory
10431 2014-10-29T14:37:43 Z gs14004 Crocodile's Underground City (IOI11_crocodile) C++
100 / 100
 576 ms 161392 KB 
#include <vector>
#include <queue>
#include <utility>
#include "crocodile.h"
using namespace std;
typedef pair<int,int> pi;

int v0[100005], v1[100005];
priority_queue<pi,vector<pi>,greater<pi> > pq;
vector<pi> graph[100005];

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]){
    for (int i=0; i<M; i++) {
        graph[R[i][0]].push_back(pi(L[i],R[i][1]));
        graph[R[i][1]].push_back(pi(L[i],R[i][0]));
    }
    for (int i=0; i<K; i++) {
        v0[P[i]] = 1;
        pq.push(pi(0,P[i]));
    }
    while (!pq.empty()) {
        pi x = pq.top();
        pq.pop();
        if(v0[x.second] == 0){
            v0[x.second] = 1;
            continue;
        }
        if(v1[x.second]) continue;
        v1[x.second] = 1;
        if(x.second == 0) return x.first;
        for (int i=0; i<graph[x.second].size(); i++) {
            pi t = graph[x.second][i];
            if(v1[t.second]) continue;
            pq.push(pi(t.first + x.first,t.second));
        }
    }
    return -1;
}

Subtask #1
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 121716 KB Output is correct
2 Correct 0 ms 121716 KB Output is correct
3 Correct 0 ms 121716 KB Output is correct
4 Correct 0 ms 121716 KB Output is correct
5 Correct 0 ms 121716 KB Output is correct
6 Correct 0 ms 121716 KB Output is correct
7 Correct 0 ms 121716 KB Output is correct
8 Correct 0 ms 121716 KB Output is correct

Subtask #2
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 121848 KB Output is correct
2 Correct 0 ms 121716 KB Output is correct
3 Correct 0 ms 121716 KB Output is correct
4 Correct 0 ms 122132 KB Output is correct
5 Correct 4 ms 121980 KB Output is correct
6 Correct 0 ms 121716 KB Output is correct
7 Correct 0 ms 121716 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 532 ms 159008 KB Output is correct
2 Correct 68 ms 126336 KB Output is correct
3 Correct 96 ms 127524 KB Output is correct
4 Correct 576 ms 161392 KB Output is correct
5 Correct 320 ms 144608 KB Output is correct
6 Correct 40 ms 123960 KB Output is correct
7 Correct 492 ms 140388 KB Output is correct