Submission #74375

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
74375	2018-08-31 12:48:54	Diuven	Toy Train (IOI17_train)	C++14	100 / 100	856 ms	9548 KiB

train

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 "train.h"
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
const int MX=5010;
vector<int> G[MX], H[MX];
int n;
bool tmp[MX];
vi win, A, R;
const vi& find(const vi &S, bool c){
  static bool in[MX]={}; int deg[MX]={};
  static vi T; static queue<int> Q;
  for(int i=0; i<n; i++) in[i]=false, deg[i]=0;
  T.clear();
  for(int i=0; i<n; i++) if(win[i]<0)
    for(int x:G[i]) deg[i]+=win[x]<0;
  for(int x:S) in[x]=true, Q.push(x);
  while(!Q.empty()){
    int v=Q.front(); Q.pop();
    for(int x:H[v]){
      if(in[x] || win[x]>=0) continue;
      if(A[x]==c) in[x]=true, Q.push(x);
      else{
        deg[x]--;
        if(deg[x]==0) in[x]=true, Q.push(x);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 11 / 11
• Subtask 4: 11 / 11
• Subtask 5: 12 / 12
• Subtask 6: 51 / 51