Submission #1079830

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1079830	2024-08-29 02:17:25	_rain_	Crocodile's Underground City (IOI11_crocodile)	C++14	100 / 100	338 ms	54576 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>
using namespace std;
#define ll long long
#define fixbug false
//... READ INPUT
const int INF = 1e9 ;
const int maxn = 1e5;
const int maxm = 1e6;
vector<pair<int,int>> g[maxn+2];
ll d[maxn+2][2];
bool vis[maxn+2];
#define ii pair<ll,int>
#define fi first
#define se second
int travel_plan(int n , int m , int R[][2] , int L[] , int k , int P[]){
    for (int i = 0; i < m; ++i) {
        g[R[i][0]].push_back({R[i][1] , L[i]});
        g[R[i][1]].push_back({R[i][0] , L[i]});
        if (fixbug){
            cout << R[i][0] << ' ' << R[i][1] << ' ' << L[i] << '\n';
        }
    }
    priority_queue<ii,vector<ii>,greater<ii>> q;
    for (int i = 0; i < n; ++i) d[i][0] = d[i][1] = INF;
    ll ans = d[0][0];
    for (int i = 0 ; i < k; ++i){
        d[P[i]][0] = d[P[i]][1] = 0;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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