Submission #137172

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
137172	2019-07-27 07:42:13	random0029	Toy Train (IOI17_train)	C++14	100 / 100	370 ms	1656 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
// ItnoE
#include<bits/stdc++.h>
using namespace std;
const int N = 5005, MXM = 20004;
int n, m, D[N], F[N], M[N], qu[N], DD[N];
bool Bad[N], Can[N];
vector < int > Adj[N], Adt[N];
vector < int > who_wins(vector < int > B, vector < int > S, vector < int > U, vector < int > V)
{
  n = (int)B.size();
  m = (int)U.size();
  for (int i = 0; i < m; i ++)
  {
    Adt[V[i]].push_back(U[i]);
    DD[U[i]] ++;
    D[U[i]] ++;
    F[U[i]] ++;
  }
  bool YAY = 1;
  while (YAY)
  {
    YAY = 0;
    int l = 0, r = 0;
    memset(Bad, 0, sizeof(Bad));
    for (int i = 0; i < n; i ++)
      if (S[i] && !Can[i])
        Bad[i] = 1, qu[r ++] = i;
    for (int i = 0; i < n; i ++)
      D[i] = DD[i];
    while (r - l)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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