제출 #72588

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
72588		Bruteforceman	악어의 지하 도시 (IOI11_crocodile)	C++11	100 / 100	1284 ms	104408 KiB

crocodile

#include <bits/stdc++.h>
#include "crocodile.h"
using namespace std;
const long long inf = 1e15;

struct data {
    int node;
    long long dist;
    data (int node, long long dist) {
        this -> node = node;
        this -> dist = dist;
    }
    data ( ) {}
    bool operator < (data x) const {
        return dist > x.dist;
    }
};

vector <int> g[100010];
vector <int> c[100010];
long long d[100010][2];
bool vis[100010];

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
    // freopen("in.txt", "r", stdin);

    int n, m, k;
    n = N;
    m = M;
    k = K;
    for(int i = 0; i < m; i++) {
        int p = R[i][0], q = R[i][1], r = L[i];
        g[p].push_back(q);
        g[q].push_back(p);
        c[p].push_back(r);
        c[q].push_back(r);
    }
    for(int i = 0; i < n; i++) {
        d[i][0] = d[i][1] = inf;
    }

    priority_queue <data> Q;
    for(int i = 0; i < k; i++) {
        int x = P[i];
        d[x][1] = d[x][0] = 0;
        Q.push(data(x, 0));
    }
    while(not Q.empty()) {
        data x = Q.top();
        Q.pop();
        int p = x.node;
        long long dist = x.dist;
        if(vis[p] == true) continue;

        vis[p] = true;
        for(unsigned i = 0; i < g[p].size(); i++) {
            long long cost = c[p][i] + dist;
            int q = g[p][i];

            if(d[q][0] >= cost) {
                d[q][1] = d[q][0];
                d[q][0] = cost;
                Q.push( data(q, d[q][1]) );
            } else if (d[q][1] > cost) {
                d[q][1] = cost;
                Q.push( data(q, cost) );
            }
        }
    }
  	if(d[0][1] == inf) d[0][1] = -1;
    return d[0][1];
}

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