제출 #291018

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
291018	2020-09-04 15:36:42	Kastanda	악어의 지하 도시 (IOI11_crocodile)	C++11	89 / 100	746 ms	52324 KiB

crocodile

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
// M
#include<bits/stdc++.h>
#include "crocodile.h"
using namespace std;
typedef long long ll;
const int N = 100005;
int n, m, k;
ll D[N][2];
vector < pair < int , int > > Adj[N];
int travel_plan(int _n, int _m, int R[][2], int L[], int _k, int P[])
{
        n = _n; m = _m; k = _k;
        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]});
        }
        memset(D, 63, sizeof(D));
        priority_queue < pair < ll , int > > Pq;
        for (int i = 0; i < k; i ++)
                D[P[i]][0] = D[P[i]][1] = 0, Pq.push({0, P[i]});
        while (Pq.size())
        {
                int v = Pq.top().second;
                ll d = - Pq.top().first;
                Pq.pop();
                if (d > D[v][1])
                        continue;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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