oj.uz

Submission #8129

# Submission time Handle Problem Language Result Execution time Memory
8129 2014-08-31T06:10:31 Z baneling100 Sightseeing (NOI14_sightseeing) C++
15 / 25
 3500 ms 139584 KB 
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
#define INF 0x7fffffff

using namespace std;

typedef pair <int,int> ppair;
vector <ppair> A[500001];
pair <int,int> Heap[5000001];
int V, E, Q, D[500001], Check[500001], Size;


void input(void) {

    int i, v1, v2, q;

    scanf("%d %d %d",&V,&E,&Q);
    for(i=1 ; i<=E ; i++) {
        scanf("%d %d %d",&v1,&v2,&q);
        A[v1].push_back(make_pair(v2,q));
        A[v2].push_back(make_pair(v1,q));
    }
}

void process(void) {

    int i, j, Now, Value;

    for(i=2 ; i<=V ; i++)
        D[i]=-1;
    D[1]=INF;
    Size=1;
    Heap[0]=make_pair(D[1],1);
    while(Size) {
        Now=Heap[0].second;
        pop_heap(Heap,Heap+Size);
        Size--;
        if(Check[Now])
            continue;
        Check[Now]=1;
        j=A[Now].size();
        for(i=0 ; i<j ; i++) {
            Value=min(D[Now],A[Now][i].second);
            if(D[A[Now][i].first]<Value) {
                D[A[Now][i].first]=Value;
                Heap[Size++]=make_pair(Value,A[Now][i].first);
                push_heap(Heap,Heap+Size);
            }
        }
    }
}

void output(void) {

    int i, X;

    for(i=1 ; i<=Q ; i++) {
        scanf("%d",&X);
        printf("%d\n",D[X]);
    }
}

int main(void) {

    input();
    process();
    output();

    return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 55896 KB Output is correct
2 Correct 4 ms 55896 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 55896 KB Output is correct
2 Correct 8 ms 55896 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 57612 KB Output is correct
2 Correct 44 ms 57216 KB Output is correct

Subtask #4
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2976 ms 139584 KB Output is correct
2 Execution timed out 3500 ms 0 KB Program timed out