oj.uz

Submission #1013475

# Submission time Handle Problem Language Result Execution time Memory
1013475 2024-07-03T14:54:19 Z Error404 Crocodile's Underground City (IOI11_crocodile) C++17
89 / 100
 269 ms 73024 KB 
#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define f first
#define s second
#define pi pair<ll,ll>
#define vi vector<ll>
#define vpi vector<pi>
#define pb push_back
#define INF 1000000000000000
#define endl '\n'
//#define int ll
#define pii pair<pi,ll>

const int MAX = 1e5+1;

vpi g[MAX];
ll dis[MAX][2];


ll travel_plan(int n,int m, int R[][2], int L[],int k, int P[]){
    ll a,b,c,from;
    
    for(int i = 0; i < m; i++){
       a = R[i][0];
       b = R[i][1];
       c = L[i];
       g[a].pb({b,c});
       g[b].pb({a,c});
    }

    priority_queue<pi, vector<pi>, greater<pi>>pq;
     for(int i = 0; i < n; i++){
        dis[i][0]=INF;
        dis[i][1]=INF;
    }

    for(int i =0 ; i < k; i++){
        dis[P[i]][0]=0;
        dis[P[i]][1]=0;
        pq.push({0,P[i]});   
    }

   

    while(!pq.empty()){
        b = pq.top().f;
        from = pq.top().s;

        pq.pop();
        if(b!=dis[from][1]) {
            continue;
        }
        for(pi i : g[from]){
            int to = i.f;
            int w= i.s;
      
            if(dis[to][0]> b+w){
                bool flag = false;
                if(dis[to][0]!=INF ) flag = true;
                dis[to][1] = dis[to][0];
                dis[to][0] = b+w;
                if(flag)pq.push({dis[to][1], to});
            }
            else if(dis[to][1]>b+w){
                dis[to][1]=b+w;
                pq.push({dis[to][1], to});
            }
           
        }
       
    }

   
     return dis[0][1]; 

}


/*

5 7 2

0 2 4
0 3 3
3 2  2
2 1 10
0 1 100
0 4 7
3 4 9




5 4 3 
0 1 2
 0 2 3 
 3 2 1 
 2 4 4 
 1
 3
 4

1
3



*/

Subtask #1
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2648 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 2 ms 2908 KB Output is correct
5 Correct 2 ms 2908 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2908 KB Output is correct
8 Correct 1 ms 2904 KB Output is correct

Subtask #2
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2648 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 2 ms 2908 KB Output is correct
5 Correct 2 ms 2908 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2908 KB Output is correct
8 Correct 1 ms 2904 KB Output is correct
9 Correct 2 ms 3160 KB Output is correct
10 Correct 1 ms 2648 KB Output is correct
11 Correct 1 ms 2908 KB Output is correct
12 Correct 3 ms 3420 KB Output is correct
13 Correct 3 ms 3492 KB Output is correct
14 Correct 1 ms 2652 KB Output is correct
15 Correct 2 ms 2908 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2648 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 2 ms 2908 KB Output is correct
5 Correct 2 ms 2908 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2908 KB Output is correct
8 Correct 1 ms 2904 KB Output is correct
9 Correct 2 ms 3160 KB Output is correct
10 Correct 1 ms 2648 KB Output is correct
11 Correct 1 ms 2908 KB Output is correct
12 Correct 3 ms 3420 KB Output is correct
13 Correct 3 ms 3492 KB Output is correct
14 Correct 1 ms 2652 KB Output is correct
15 Correct 2 ms 2908 KB Output is correct
16 Correct 221 ms 66976 KB Output is correct
17 Correct 47 ms 14416 KB Output is correct
18 Correct 51 ms 16728 KB Output is correct
19 Correct 269 ms 73024 KB Output is correct
20 Correct 162 ms 55124 KB Output is correct
21 Correct 23 ms 8284 KB Output is correct
22 Incorrect 181 ms 50260 KB Output isn't correct
23 Halted 0 ms 0 KB -