oj.uz

답안 #120917

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
120917 2019-06-25T18:07:55 Z Runtime_error_ 악어의 지하 도시 (IOI11_crocodile) C++14
0 / 100
 3 ms 384 KB 
#include "crocodile.h"
#include <bits/stdc++.h>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
 
const int inf=1e3+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(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
0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Incorrect 3 ms 384 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Incorrect 3 ms 384 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Incorrect 3 ms 384 KB Output isn't correct
5 Halted 0 ms 0 KB -