Submission #1143957

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1143957	2025-02-02 04:55:46	gyg	Toy Train (IOI17_train)	C++20	5 / 100	3 ms	840 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;
#define sig signed
#define int long long
#define arr array
#define vec vector
const int N = 5e3 + 5;
int n, m;
arr<bool, N> a, ch;
arr<bool, N> cyc, lst;
vec<int> a_wn, b_wn;
vec<sig> who_wins(vec<sig> _a, vec<sig> _ch, vec<sig> _u, vec<sig> _v) {
  n = _a.size(), m = _u.size();
  for (int u = 1; u <= n; u++) a[u] = _a[u - 1], ch[u] = _ch[u - 1];
  lst.fill(true);
  for (int i = 1; i <= m; i++) {
    int u = _u[i - 1] + 1, v = _v[i - 1] + 1;
    if (u == v) cyc[u] = true;
    else lst[u] = false;
  }
  for (int u = 1; u <= n; u++) {
    if (cyc[u] && ch[u] && a[u]) a_wn.push_back(u);
    if (cyc[u] && ch[u] && lst[u] && !a[u]) a_wn.push_back(u);
    if (cyc[u] && !ch[u] && !a[u]) b_wn.push_back(u);
    if (cyc[u] && !ch[u] && lst[u] && a[u]) b_wn.push_back(u);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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