oj.uz

Submission #562641

# Submission time Handle Problem Language Result Execution time Memory
562641 2022-05-14T20:46:02 Z Iwanttobreakfree Crocodile's Underground City (IOI11_crocodile) C++
89 / 100
 494 ms 44768 KB 
#include <iostream>
#include <vector>
#include <queue>
#include "crocodile.h"
using namespace std;
typedef long long ll;
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]){
    vector<pair<int,int>> d(N,{1e9+1,1e9+1});
    vector<vector<pair<int,int>>> g(N,vector<pair<int,int>>());
    for(int i=0;i<M;i++){
        g[R[i][0]].push_back({R[i][1],L[i]});
        g[R[i][1]].push_back({R[i][0],L[i]});
    }
    priority_queue<pair<int,int>> pq;
    for(int i=0;i<K;i++){
        pq.push({0,P[i]});
        d[P[i]].first=d[P[i]].second=0;
    }
    while(!pq.empty()){
        int dist=-pq.top().first,u=pq.top().second;
        pq.pop();
        //cout<<u<<' ';
        if(dist!=d[u].second)continue;
        for(auto v:g[u]){
            if(dist+v.second<d[v.first].first){
                d[v.first].second=d[v.first].first;
                d[v.first].first=dist+v.second;
                if(d[v.first].second<=1e9)pq.push({-d[v.first].second,v.first});
            }
            else if(dist+v.second<d[v.first].second){
                d[v.first].second=dist+v.second;
                pq.push({-d[v.first].second,v.first});
            }
        }
    }
    return d[0].second;
}
/*int main(){
    int n,m,k;
    cin>>n>>m>>k;
    int R[m][2],l[m],e[k];
    for(int i=0;i<m;i++)cin>>R[i][0]>>R[i][1]>>l[i];
    for(int i=0;i<k;i++)cin>>e[i];
    cout<<travel_plan(n,m,R,l,k,e);
}*/

Subtask #1
46.0 / 46.0

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

Subtask #2
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 3 ms 596 KB Output is correct
13 Correct 3 ms 724 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 3 ms 596 KB Output is correct
13 Correct 3 ms 724 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 383 ms 39656 KB Output is correct
17 Correct 67 ms 10444 KB Output is correct
18 Correct 86 ms 11800 KB Output is correct
19 Correct 494 ms 44768 KB Output is correct
20 Correct 243 ms 34124 KB Output is correct
21 Correct 30 ms 4544 KB Output is correct
22 Incorrect 263 ms 30252 KB Output isn't correct
23 Halted 0 ms 0 KB -