Submission #49992

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
49992	2018-06-06 04:19:02	Diuven	Tropical Garden (IOI11_garden)	C++11	100 / 100	4914 ms	14192 KiB

garden

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 "garden.h"
#include "gardenlib.h"
#include <bits/stdc++.h>
using namespace std;
const int MX=300010, inf=2e9;
int n, nxt[MX], Q1, Q2; // in, out
void debug(){
  for(int i=0; i<n; i++)
    cout<<nxt[i]<<' ';
  cout<<"\n\n";
}
int fir[MX], scd[MX];
void init(int V, int E, int P, int R[][2]){
  fill(fir, fir+n, -1);
  fill(scd, scd+n, -1);
  // u->v: 0, v->u: 1
  for(int i=0; i<E; i++){
    int u=R[i][0], v=R[i][1];
    if(fir[u]<0) fir[u]=2*i;
    else if(scd[u]<0) scd[u]=2*i;
    if(fir[v]<0) fir[v]=2*i+1;
    else if(scd[v]<0) scd[v]=2*i+1;
  }
  for(int i=0; i<E; i++){
    int u=R[i][0], v=R[i][1];
    // u->v, v->u
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 49 / 49
• Subtask 2: 20 / 20
• Subtask 3: 31 / 31