oj.uz

Submission #371336

# Submission time Handle Problem Language Result Execution time Memory
371336 2021-02-26T13:51:42 Z Iwanttobreakfree Crocodile's Underground City (IOI11_crocodile) C++
0 / 100
 1 ms 364 KB 
#include "crocodile.h"
#include <iostream>
#include <vector>
#include <queue>
#include <set>
using namespace std;
 
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]){
    vector<int> distancia(N,1e9);
    int maximo=1e9;
    bool primero;
    vector<vector<pair<int,int>>> conexiones(N,vector<pair<int,int>>());
    set <int> salidas;
    for(int i=0;i<M;i++){
        conexiones[R[i][0]].push_back(make_pair(L[i],R[i][1]));
        conexiones[R[i][1]].push_back(make_pair(L[i],R[i][0]));
    }
    for(int i=0;i<K;i++)salidas.insert(P[i]);
    priority_queue <pair<int,int>> q;
    q.push(make_pair(0,0));
    distancia[0]=0;
    priority_queue <pair<int,int>> caminos;
    int nodo;
    while(!q.empty()){
        nodo=q.top().second;
        q.pop();
        for(pair<int,int> con:conexiones[nodo]){
            int arista=con.first;
            int siguiente=con.second;
            caminos.push(make_pair(-arista,siguiente));
        }
        primero=true;
            while(!caminos.empty()){
                if(primero)primero=false;
                else if(distancia[caminos.top().second]>distancia[nodo]-caminos.top().first){
                    distancia[caminos.top().second]=distancia[nodo]-caminos.top().first;
                    q.push(make_pair(caminos.top().first,caminos.top().second));
                }
                caminos.pop();
            }
    }
    for(int i=0;i<K;i++){
    maximo=min(maximo,distancia[P[i]]);
    }
  return maximo;
}

Subtask #1
0 / 46.0

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

Subtask #2
0 / 43.0

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

Subtask #3
0 / 11.0

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