Submission #341248

#	Time	Username	Problem	Language	Result	Execution time	Memory
341248		Sho10	Crocodile's Underground City (IOI11_crocodile)	C++14	100 / 100	654 ms	101528 KiB

crocodile

#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 / 46
• Subtask 2: 43 / 43
• Subtask 3: 11 / 11