제출 #492334

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
492334		ponytail	악어의 지하 도시 (IOI11_crocodile)	C++17	100 / 100	589 ms	93328 KiB

crocodile

#include "crocodile.h"
#include <stdio.h>
#include <stdlib.h>
#include <bits/stdc++.h>
using namespace std;

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]);


int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
    long long dist[N][2];
    for(int i=0; i<N; i++) dist[i][0] = dist[i][1] = 1e15;
    for(int i=0; i<K; i++) dist[P[i]][0] = dist[P[i]][1] = 0;
    bool vis[N];
    for(int i=0; i<N; i++) vis[i] = 0;
    priority_queue<pair<long long, int>, vector<pair<long long, int> >, greater<pair<long long, int> > >pq;
    for(int i=0; i<N; i++) pq.push({dist[i][1], i});
    vector<pair<int, long long> > adj[N];
    for(int i=0; i<M; i++) {
        adj[R[i][0]].push_back({R[i][1], L[i]});
        adj[R[i][1]].push_back({R[i][0], L[i]});
    }
    while(pq.size()) {
        pair<long long, int> t = pq.top(); pq.pop();
        if(!vis[t.second]) {
            vis[t.second] = 1;
            for(pair<int, long long> x : adj[t.second]) {
                if(!vis[x.first] && dist[t.second][1] != 1e15) {
                    int now = dist[t.second][1] + x.second;
                    if(now >= dist[x.first][0] && now < dist[x.first][1]) {
                        dist[x.first][1] = now;
                        pq.push({dist[x.first][1], x.first});
                    }
                    else if(now < dist[x.first][0]) {
                        dist[x.first][1] = dist[x.first][0];
                        dist[x.first][0] = now;
                        pq.push({dist[x.first][1], x.first});
                    }
                }
            }
        }
    }
    return (int)dist[0][1];
    
}

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