제출 #214141

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
214141	2020-03-26 10:29:37	rapture	악어의 지하 도시 (IOI11_crocodile)	C++14	100 / 100	821 ms	87212 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
#include "crocodile.h"
#include <bits/stdc++.h>
#define ll long long
#define INF 1e+18
#define pb push_back
using namespace std;
 
struct edge{ ll to,cost; };
typedef pair<int,int> P;
 
ll n,m,d1[100010],d2[100010];
vector<edge> G[100010];
 
int travel_plan(int N, int M, int R[][2], int L[], int K, int Q[]){
  n = N,m = M;
  for(int i = 0;i < n;i++){
    d1[i] = INF;
    d2[i] = INF;
  }
  for(int i = 0;i < m;i++){
    G[R[i][0]].pb({R[i][1],L[i]});
    G[R[i][1]].pb({R[i][0],L[i]});
  }
  priority_queue<P,vector<P>,greater<P>> que;
  for(int i = 0;i < K;i++){
    d1[Q[i]] = 0;
    d2[Q[i]] = 0;
    que.push(P(0,Q[i]));
  }
  while(!que.empty()){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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