Submission #986817

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
986817	2024-05-21 09:32:27	huutuan	Crocodile's Underground City (IOI11_crocodile)	C++14	100 / 100	441 ms	96580 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 int long long
const int N=1e5+10, inf=1e18;
int n, m, vis[N];
pair<int, int> f[N][2];
vector<pair<int, int>> g[N];
void optimize(int i, pair<int, int> x){
   if (x.second==f[i][0].second || x.second==f[i][1].second){
      if (x.second==f[i][0].second) f[i][0].first=min(f[i][0].first, x.first);
      else f[i][1].first=min(f[i][1].first, x.first);
      if (f[i][0]>f[i][1]) swap(f[i][0], f[i][1]);
      return;
   }
   if (x<f[i][0]) f[i][1]=f[i][0], f[i][0]=x;
   else f[i][1]=min(f[i][1], x);
}
int32_t travel_plan(int32_t _N, int32_t M, int32_t R[][2], int32_t L[], int32_t K, int32_t P[])
{
   n=_N, m=M;
   for (int i=0; i<m; ++i){
      int u=R[i][0]+1, v=R[i][1]+1, w=L[i];
      g[u].emplace_back(v, w);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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