Submission #53431

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
53431	2018-06-30 02:24:24	ainta	Toy Train (IOI17_train)	C++17	37 / 100	2061 ms	1464 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<cstdio>
#include<algorithm>
using namespace std;
int n, m, D[5010], TD[5010], U[5010];
vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
  n = a.size();
  m = u.size();
  int i, j, k;
  for (i = 0; i < n; i++) {
    if (r[i] == 1)D[i] = 1;
    else D[i] = 0;
  }
  for (i = 0; i < 15000; i++) {
    for (k = 0; k < n; k++) {
      if (a[k] == 1)TD[k] = 0;
      else TD[k] = 1e9;
    }
    for (j = 0; j < m; j++) {
      if (a[u[j]] == 1) {
        TD[u[j]] = max(TD[u[j]], r[u[j]] + D[v[j]]);
      }
      else {
        TD[u[j]] = min(TD[u[j]], r[u[j]] + D[v[j]]);
      }
    }
    for (j = 0; j < n; j++) {
      if (i == 9999)U[j] = TD[j];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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