Submission #543207

#	Time	Username	Problem	Language	Result	Execution time	Memory
543207		__Variatto	Crocodile's Underground City (IOI11_crocodile)	C++17	0 / 100	2 ms	2804 KiB

crocodile

#include "crocodile.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define ll long long
const ll MAX=1e5+10, MAXV=1e18;
int n, m, k, ileSpe[MAX], odw[MAX];
ll odl[MAX];
bool spe[MAX];
vector<pair<int,int>>g[MAX];
priority_queue<pair<ll,int>>kol;
ll obl(int x){
    set<ll>se;
    for(auto s: g[x])
        if(spe[s.fi])
            se.insert(odl[s.fi]+s.se);
    se.erase(se.begin());
    return(*se.begin());
}
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]){
    n=N, k=K, m=M;
    for(int i=1; i<=m; i++)
        g[R[i-1][0]+1].pb({R[i-1][1]+1, L[i-1]}), g[R[i-1][1]+1].pb({R[i-1][0]+1, L[i-1]});
    for(int i=1; i<=k; i++){
        int v=P[i-1]+1;
        spe[v]=true;
    }
    for(int i=1; i<=n; i++){
        odl[i]=MAXV;
        if(spe[i])
            kol.push({0, i}), odl[i]=0;
    }
    while(kol.size()){
        auto v=kol.top().se;
        kol.pop();
        if(odw[v]) continue;
        odw[v]=spe[v]=true;
        for(auto s: g[v]){
            ileSpe[s.fi]++;
            if(ileSpe[s.fi]>=2){
                int nowy=obl(s.fi);
                if(odl[s.fi]>nowy)
                    odl[s.fi]=nowy, kol.push({-nowy, s.fi});
            }
        }
    }
    return odl[1];
}

• Subtask 1: 0 / 46
• Subtask 2: 0 / 43
• Subtask 3: 0 / 11