Submission #120920

#	Time	Username	Problem	Language	Result	Execution time	Memory
120920		Runtime_error_	Crocodile's Underground City (IOI11_crocodile)	C++14	0 / 100	4 ms	2816 KiB

crocodile

#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];
set<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.begin());
        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( u == 0)
            return dis;
        if(vis[u])
            continue;
        vis[u] = 1;

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

• Subtask 1: 0 / 46
• Subtask 2: 0 / 43
• Subtask 3: 0 / 11