oj.uz

Submission #787125

# Submission time Handle Problem Language Result Execution time Memory
787125 2023-07-18T20:51:36 Z Sam_a17 Crocodile's Underground City (IOI11_crocodile) C++17
89 / 100
 433 ms 145100 KB 
#include "crocodile.h"
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pii;
typedef pair<ll, ll> pll;
 
#define ff first
#define ss second
 
ll ttt;
const ll INF=1e16;
const ll MOD=1e9+7;
const ll N= 3e6 + 10;
ll n,m,k;
vector<pair<ll,ll>>g[N];
 
int travel_plan(int NN, int MM, int R[][2], int L[], int KK, int P[]){
    n=NN;
    m=MM;
    k=KK;
    for(ll i=0;i<m;i++){
        // cout<<R[i][0]<<" "<<R[i][1]<<endl;
        g[R[i][0]].push_back(make_pair(R[i][1],L[i]));
        g[R[i][1]].push_back(make_pair(R[i][0],L[i]));
    }
    priority_queue<pii,vector<pii>,greater<pii>>q;
    vector<ll>mn(n+1,INF),smn(n+1,INF);
    // cout<<mn[0]<<" "<<smn[0]<<endl;
    for(ll i=0;i<k;i++){
        q.push(make_pair(0,P[i]));
        mn[P[i]]=smn[P[i]]=0;
    }
    while(!q.empty()){
        ll v=q.top().ss;
        ll w=q.top().ff;
        // cout<<v<<" "<<w<<endl;
        // cout<<mn[v]<<" "<<smn[v]<<endl<<endl;
        q.pop();
        if(smn[v]==w){
            for(pii x:g[v]){
                ll to=x.ff;
                ll dist=x.ss;
                // cout<<v<<" "<<to<<" "<<dist<<endl;
                // cout<<mn[to]<<" "<<smn[v]<<endl;
                // cout<<endl;
                if(mn[to]>smn[v]+dist){
                    smn[to]=mn[to];
                    mn[to]=smn[v]+dist;
                    q.push(make_pair(smn[to],to));
                }
                else if(smn[to]>smn[v]+dist){
                    smn[to]=smn[v]+dist;
                    q.push(make_pair(smn[to],to));
                }
            }
        }
    }
    return smn[0];
}

Subtask #1
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 70856 KB Output is correct
2 Correct 31 ms 70668 KB Output is correct
3 Correct 30 ms 70732 KB Output is correct
4 Correct 30 ms 70868 KB Output is correct
5 Correct 32 ms 70796 KB Output is correct
6 Correct 30 ms 70776 KB Output is correct
7 Correct 30 ms 70812 KB Output is correct
8 Correct 30 ms 70732 KB Output is correct

Subtask #2
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 70856 KB Output is correct
2 Correct 31 ms 70668 KB Output is correct
3 Correct 30 ms 70732 KB Output is correct
4 Correct 30 ms 70868 KB Output is correct
5 Correct 32 ms 70796 KB Output is correct
6 Correct 30 ms 70776 KB Output is correct
7 Correct 30 ms 70812 KB Output is correct
8 Correct 30 ms 70732 KB Output is correct
9 Correct 32 ms 71040 KB Output is correct
10 Correct 29 ms 70740 KB Output is correct
11 Correct 31 ms 70920 KB Output is correct
12 Correct 32 ms 71320 KB Output is correct
13 Correct 32 ms 71452 KB Output is correct
14 Correct 29 ms 70800 KB Output is correct
15 Correct 31 ms 70840 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 70856 KB Output is correct
2 Correct 31 ms 70668 KB Output is correct
3 Correct 30 ms 70732 KB Output is correct
4 Correct 30 ms 70868 KB Output is correct
5 Correct 32 ms 70796 KB Output is correct
6 Correct 30 ms 70776 KB Output is correct
7 Correct 30 ms 70812 KB Output is correct
8 Correct 30 ms 70732 KB Output is correct
9 Correct 32 ms 71040 KB Output is correct
10 Correct 29 ms 70740 KB Output is correct
11 Correct 31 ms 70920 KB Output is correct
12 Correct 32 ms 71320 KB Output is correct
13 Correct 32 ms 71452 KB Output is correct
14 Correct 29 ms 70800 KB Output is correct
15 Correct 31 ms 70840 KB Output is correct
16 Correct 338 ms 136924 KB Output is correct
17 Correct 98 ms 84636 KB Output is correct
18 Correct 124 ms 86920 KB Output is correct
19 Correct 433 ms 145100 KB Output is correct
20 Correct 254 ms 123116 KB Output is correct
21 Correct 62 ms 77060 KB Output is correct
22 Incorrect 270 ms 118476 KB Output isn't correct
23 Halted 0 ms 0 KB -