oj.uz

답안 #1102612

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1102612 2024-10-18T12:35:26 Z asli_bg 악어의 지하 도시 (IOI11_crocodile) C++11
0 / 100
 16 ms 76368 KB 
#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=1e9;
 
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];
 
void bfs(){
    set<pii> s;
    FORE(i,1,n+1){
        if(cikis[i]){
            yol[i].insert({0,i});
            yol[i].insert({0,i});
            yol[i].insert({0,i});
            s.insert({0,i});
        }
        else{
            yol[i].insert({INF,INF});
            yol[i].insert({INF,INF});
            yol[i].insert({INF,INF});
        }
    }
 
    while(!s.empty()){
        auto el=*s.begin();
        s.erase(*s.begin());
 
        int dd=el.fi;
        int nd=el.se;
 
        vis[nd]=true;
 
        for(auto temp:adj[nd]){
            int kom=temp.fi;
            int cost=temp.se;
 
            if(cikis[kom]) continue;
            s.erase({yol[kom].begin()->fi,kom});
            yol[kom].insert({dd+cost,nd});
            //her komsu node için bir tane min degerini sadece tut
            if(yol[kom].size()>3){
                //sonuncu elemanı sil
                yol[kom].erase(yol[kom].find(*yol[kom].rbegin()));
            }
 
            if(vis[kom]) continue;
            s.insert({yol[kom].begin()->fi,kom});
        }
    }
}
 
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==ata or kom==mn) continue;
        if(!vis[kom]) dfs(kom,nd,dd+cost);
    }
}
 
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;
    }
 
    bfs();
    cev=INF;
    
    memset(vis,0,sizeof vis);
    dfs(1,0,0);
 
    return cev;
}

Subtask #1
0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 16 ms 76368 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 16 ms 76368 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 16 ms 76368 KB Output isn't correct
2 Halted 0 ms 0 KB -