제출 #737819

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

crocodile

#include <bits/stdc++.h>
//#include "grader.h"
using namespace std;
 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define pb push_back
#define mp make_pair
#define f first
#define s second

const int maxn = 100001, maxm = 1000001, INF = 2e9;
vector<vector<pi>> adj(maxn);
int dist[maxn][2], visited[maxn];
set<pi> s;

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]){
    for(int i = 0; i < M; i++){
        adj[R[i][0]].pb({R[i][1], L[i]});
        adj[R[i][1]].pb({R[i][0], L[i]});
    }
    for(int i = 0; i <= N; i++)
        dist[i][0] = dist[i][1] = INF;

    for(int i = 0; i < K; i++){
        dist[P[i]][0] = dist[P[i]][1] = 0;
        s.insert({0, P[i]});
    }

    while(!s.empty()){
        int a = s.begin()->second;
        s.erase(s.begin());
        if(visited[a])
            continue;
        visited[a] = 1;
        for(auto i : adj[a]){
            int b = i.f, w = i.s;
            if(visited[b])
                continue;
            if(dist[b][0] > dist[a][1] + w){
                dist[b][1] = dist[b][0];
                dist[b][0] = dist[a][1] + w;
                if(dist[b][1] != INF)
                    s.insert({dist[b][1], b});
            } else if(dist[b][1] > dist[a][1] + w){
                dist[b][1] = dist[a][1] + w;
                s.insert({dist[b][1], b});
            }
        }
    }
    return dist[0][1];
}

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