제출 #309301

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
309301	2020-10-03 07:20:40	amunduzbaev	악어의 지하 도시 (IOI11_crocodile)	C++14	100 / 100	1444 ms	94644 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 <bits/stdc++.h>
using namespace std;
#include "crocodile.h"
//#include "grader.cpp"
const int N1 = 2e5+5 ;
const int INF = 1e9+7 ;
vector<pair<int, int> > v[N1];
multiset<int> d[N1];
int travel_plan(int n, int m, int r[][2], int l[], int k, int p[]){
    for(int i=0;i<m;i++){
        v[r[i][0]].push_back({r[i][1],l[i]});
        v[r[i][1]].push_back({r[i][0],l[i]});
    }
    set<pair<int,int>>q;
    for(int i=0;i<k;i++){
        d[p[i]].insert(0);
        d[p[i]].insert(0);
        q.insert({0,p[i]});
    }
    for(int i=0;i<n;i++){
        if(d[i].empty()) {
            d[i].insert(INF);
            d[i].insert(INF);
        }
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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