oj.uz

Submission #120930

# Submission time Handle Problem Language Result Execution time Memory
120930 2019-06-25T18:23:00 Z Runtime_error_ Crocodile's Underground City (IOI11_crocodile) C++14
89 / 100
 2000 ms 77852 KB 
#include "crocodile.h"
#include <bits/stdc++.h>
#include <stdio.h>
#include <stdlib.h>
using namespace std;


const int inf=1e5+9,MX=1e9+9;
vector< pair<int,int> > adj[inf];
bool ex[inf],vis[inf];
multiset<pair<int,int> > s;

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]){

    for(int i=0;i<M;i++)
        adj[ R[i][0] ].push_back( make_pair( R[i][1] , L[i] ) ),
        adj[ R[i][1] ].push_back(make_pair( R[i][0] , L[i] ));

    for(int i=0;i<K;i++)
        ex[ P[i] ] = 1,s.insert(make_pair(0, P[i] ));

    while(!s.empty()){
        pair<int,int> p = *s.begin();
        s.erase(s.find(p));
        int u = p.second , dis = p.first;

        if( ex[u] == 0 ){
            // we want the second minimum distance so when we reach a node that are not an exit for the first time we abort
            //and make that we visited it once
            ex[u] = 1;
            continue;
        }

        if(vis[u])
            continue;
        vis[u] = 1;
        if( u == 0)
            return dis;
        for(auto v:adj[u])
            if(!vis[v.first])
                s.insert(make_pair(dis+v.second,v.first));
    }
    return -1;
}

Subtask #1
46.0 / 46.0

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

Subtask #2
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2688 KB Output is correct
2 Correct 4 ms 2688 KB Output is correct
3 Correct 4 ms 2688 KB Output is correct
4 Correct 5 ms 2816 KB Output is correct
5 Correct 5 ms 2816 KB Output is correct
6 Correct 4 ms 2816 KB Output is correct
7 Correct 4 ms 2816 KB Output is correct
8 Correct 5 ms 2816 KB Output is correct
9 Correct 6 ms 3072 KB Output is correct
10 Correct 5 ms 2688 KB Output is correct
11 Correct 5 ms 2816 KB Output is correct
12 Correct 10 ms 3456 KB Output is correct
13 Correct 7 ms 3072 KB Output is correct
14 Correct 4 ms 2688 KB Output is correct
15 Correct 4 ms 2816 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2688 KB Output is correct
2 Correct 4 ms 2688 KB Output is correct
3 Correct 4 ms 2688 KB Output is correct
4 Correct 5 ms 2816 KB Output is correct
5 Correct 5 ms 2816 KB Output is correct
6 Correct 4 ms 2816 KB Output is correct
7 Correct 4 ms 2816 KB Output is correct
8 Correct 5 ms 2816 KB Output is correct
9 Correct 6 ms 3072 KB Output is correct
10 Correct 5 ms 2688 KB Output is correct
11 Correct 5 ms 2816 KB Output is correct
12 Correct 10 ms 3456 KB Output is correct
13 Correct 7 ms 3072 KB Output is correct
14 Correct 4 ms 2688 KB Output is correct
15 Correct 4 ms 2816 KB Output is correct
16 Execution timed out 2053 ms 77852 KB Time limit exceeded
17 Halted 0 ms 0 KB -