Submission #1102625

#	Time	Username	Problem	Language	Result	Execution time	Memory
1102625		asli_bg	Crocodile's Underground City (IOI11_crocodile)	C++11	0 / 100	16 ms	76368 KiB

crocodile

#pragma GCC optimize("O3,unroll-loops")
 
#include<bits/stdc++.h>
using namespace std;
 
#include "crocodile.h"
 
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define FOR(i,a) for(int i=0;i<(a);i++)
#define FORE(i,a,b) for(int i=(a);i<(b);i++)
 
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<pii> vii;
 
#define cont(x) for(auto el:x) {cout<<el<<' ';} cout<<endl;
#define endl '\n'
#define contp(x) for(auto el:x) {cout<<el.fi<<'-'<<el.se<<' ';} cout<<endl;
#define pb push_back
 
#define sp <<' '<<
 
#define DEBUG(x) {cout<<(#x) sp x<<endl;}
 
const int MAXN=1e6+5;
const int INF=15;
 
int n,m,k;
vii adj[MAXN];
//her node için min 3 yolu tut, nereden geldiğiyle birlikte
multiset<pii> yol[MAXN];
bool vis[MAXN];
bool cikis[MAXN];

int cev;
 
void dfs(int nd,int ata,int dd){
    vis[nd]=true;
 
    auto it=yol[nd].begin();
    if(it->fi==0){
        cev=min(cev,dd);
        return;
    }

    if(it->se==ata){
        it++;
    }

    int mn=it->se;

    for(auto el:adj[nd]){
        int kom=el.fi;
        int cost=el.se;
        if(kom==mn) continue;
        if(!vis[kom]) dfs(kom,nd,dd+cost);
    }
}

void dij(int bas){
    yol[bas].clear();

    vi dist(n+1,INF);
    yol[bas].insert({0,bas});
    yol[bas].insert({0,bas});
    yol[bas].insert({0,bas});

    multiset<pii> s;
    s.insert({0,bas});

    while(!s.empty()){
        auto el=*s.begin();
        s.erase(*s.begin());
        
        int dd=el.fi;
        int nd=el.se;

        for(auto ell:adj[nd]){
            int kom=ell.fi;
            int cost=ell.se;

            yol[kom].insert({dd+cost,nd});
            s.insert({dd+cost,kom});
            if(yol[kom].size()>3){
                pii son=*yol[kom].rbegin();
                yol[kom].erase(yol[kom].find(son));
                if(s.find({son.fi,kom})!=s.end()) s.erase(s.find({son.fi,kom}));
            }
        }
    }
}

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]){
    n=N;
    m=M;
    k=K;
    FOR(i,m){
        int bir=R[i][0];
        int iki=R[i][1];
        bir++;iki++;
        adj[bir].pb({iki,L[i]});
        adj[iki].pb({bir,L[i]});
    }
 
    FOR(i,k){
        P[i]++;
        cikis[P[i]]=true;
    }
 
    FORE(i,1,n+1){
        if(cikis[i]){
            dij(i);
        }
    }

    cev=INF;

    FORE(i,1,n+1) vis[i]=false;
    dfs(1,0,0);
 
    return cev;
}

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