oj.uz

Submission #341248

# Submission time Handle Problem Language Result Execution time Memory
341248 2020-12-29T10:05:43 Z Sho10 Crocodile's Underground City (IOI11_crocodile) C++14
100 / 100
 654 ms 101528 KB 
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long
#define double long double
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000000007
#define PI 3.14159265359
#define MAXN 100005
#define INF 1000000005
#define LINF 1000000000000000005ll
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll dpc[100005],dp[100005];
struct edge{
    ll f,s;
    bool operator < (edge const &a) const{
        return s>a.s;
    }
};
vector<edge>g[100005];
int travel_plan(int N,int M,int R[][2],int L[],int K,int P[]){
for(ll i=0;i<M;i++)
{
    g[R[i][0]].pb({R[i][1],L[i]});
    g[R[i][1]].pb({R[i][0],L[i]});
}
priority_queue<edge>q;
for(ll i=0;i<K;i++)
{
    dpc[P[i]]=1;
    q.push({P[i],0});
}
while(!q.empty()){
    ll node,c;
    node=q.top().f;
    c=q.top().s;
    q.pop();
    dpc[node]++;
    if(dpc[node]==2){
        dp[node]=c;
        if(node==0){
            break;
        }
        for(auto it : g[node]){
            edge e=it;
            if(dpc[e.f]<2){
                q.push({e.f,dp[node]+e.s});
            }
        }
    }
}
if(dpc[0]<2){
return -1;
}else return dp[0];
}
/*
int32_t main(){
CODE_START;
*/

Subtask #1
46.0 / 46.0

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

Subtask #2
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 2 ms 2668 KB Output is correct
3 Correct 2 ms 2796 KB Output is correct
4 Correct 3 ms 2796 KB Output is correct
5 Correct 3 ms 2796 KB Output is correct
6 Correct 3 ms 2796 KB Output is correct
7 Correct 3 ms 2796 KB Output is correct
8 Correct 3 ms 2796 KB Output is correct
9 Correct 4 ms 3180 KB Output is correct
10 Correct 2 ms 2668 KB Output is correct
11 Correct 3 ms 2924 KB Output is correct
12 Correct 7 ms 3820 KB Output is correct
13 Correct 6 ms 3948 KB Output is correct
14 Correct 2 ms 2796 KB Output is correct
15 Correct 3 ms 2796 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 2 ms 2668 KB Output is correct
3 Correct 2 ms 2796 KB Output is correct
4 Correct 3 ms 2796 KB Output is correct
5 Correct 3 ms 2796 KB Output is correct
6 Correct 3 ms 2796 KB Output is correct
7 Correct 3 ms 2796 KB Output is correct
8 Correct 3 ms 2796 KB Output is correct
9 Correct 4 ms 3180 KB Output is correct
10 Correct 2 ms 2668 KB Output is correct
11 Correct 3 ms 2924 KB Output is correct
12 Correct 7 ms 3820 KB Output is correct
13 Correct 6 ms 3948 KB Output is correct
14 Correct 2 ms 2796 KB Output is correct
15 Correct 3 ms 2796 KB Output is correct
16 Correct 569 ms 97472 KB Output is correct
17 Correct 88 ms 17792 KB Output is correct
18 Correct 107 ms 20204 KB Output is correct
19 Correct 654 ms 101528 KB Output is correct
20 Correct 343 ms 84640 KB Output is correct
21 Correct 46 ms 9836 KB Output is correct
22 Correct 461 ms 64620 KB Output is correct