Submission #139653

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
139653	2019-08-01 08:23:16	muradeyn	Crocodile's Underground City (IOI11_crocodile)	C++14	46 / 100	256 ms	262144 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 F first
#define S second
using namespace std;
const int maxx = 1000;
int ext[maxx];
vector< pair<int,int> >adj[maxx];
vector< int > thru[maxx];
void dfs(int s,int p) {
  if (ext[s])return;
  for (auto to : adj[s]) {
    if (to.F == p)continue;
    dfs(to.F , s);
    if (ext[to.F])thru[s].push_back(to.S);
    else if (thru[to.F].size() == 2) thru[s].push_back(max(thru[to.F][0] , thru[to.F][1] + to.S));
  }
  if (thru[s].size() < 2)thru[s].clear();
  sort(thru[s].begin(),thru[s].end());
  while (thru[s].size() > 2)thru[s].pop_back();
}
int travel_plan(int n, int m, int R[][2], int L[], int k, int P[]) {
  for (int i = 0;i<m;i++) {
    int x = R[i][0] , y = R[i][1];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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