제출 #1268511

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1268511		m_mondzik	Crocodile's Underground City (IOI11_crocodile)	C++20	0 / 100	0 ms	324 KiB

crocodile

#include "crocodile.h"
#include<bits/stdc++.h>
#define F first 
#define S second 
using namespace std;

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]){
    vector<pair<int, int>> graph[N];
    for (int i = 0; i < M; i++) {
        graph[R[i][0]].push_back({R[i][1], L[i]});
        graph[R[i][1]].push_back({R[i][0], L[i]});
    }
    int degree[N];
    priority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<pair<long long, int>>> Q;
    vector<pair<long long, long long>> mini(N, {1e18, 1e18});
    for (int i = 0; i < K; i++){
        degree[P[i]] = 2;
        Q.push({0, P[i]});
        mini[P[i]] = {0, 0};
    }
    while (!Q.empty()){
        pair<int, int> v = Q.top();
        Q.pop();
        for (auto i: graph[v.S]){
            degree[i.F]++;
            if (mini[v.S].S + i.S < mini[i.F].F) mini[i.F].S = mini[i.F].F, mini[i.F].F = mini[v.S].S + i.S;
            else if (mini[v.S].S + i.S < mini[i.F].S) mini[i.F].S = mini[v.S].S + i.S;
            if (degree[i.F] == 2) Q.push({mini[i.F].S, i.F});
        }
    }
    return (int)mini[0].S;
}

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