oj.uz

Submission #10432

# Submission time Handle Problem Language Result Execution time Memory
10432 2014-10-29T14:42:15 Z gs14004 Crocodile's Underground City (IOI11_crocodile) C++
0 / 100
 472 ms 147056 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 is_exit[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++) {
        is_exit[P[i]] = 1;
    }
    v0[0] = 1;
    pq.push(pi(0,0));
    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(is_exit[x.second]) 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
0.0 / 46.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 122108 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 43.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 122240 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 472 ms 147056 KB Output isn't correct
2 Halted 0 ms 0 KB -