oj.uz

Submission #561653

# Submission time Handle Problem Language Result Execution time Memory
561653 2022-05-13T10:26:47 Z iancu Toy Train (IOI17_train) C++14
100 / 100
 437 ms 1620 KB 
#include "train.h"
#include <vector>
#include <queue>

using namespace std;

vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
  int n = a.size(), m = u.size();
  vector<int> w(n, false);
  vector<bool> curr(n, true);
  vector<vector<int>> prv(n, vector<int>()), nxt(n, vector<int>());
  for (int i = 0; i < m; ++i) {
    prv[v[i]].push_back(u[i]);
    nxt[u[i]].push_back(v[i]);
  }
  while (true) {
    vector<bool> s(n, false);
    queue<int> q;
    for (int i = 0; i < n; ++i)
      if (curr[i] && r[i]) {
        s[i] = true;
        q.push(i);
      }
    while (!q.empty()) {
      auto y = q.front();
      q.pop();
      for (auto x: prv[y])
        if (curr[x] && !s[x]) {
          if (!a[x]) {
            bool isGood = true;
            for (auto z: nxt[x])
              if (curr[z] && !s[z]) {
                isGood = false;
                break;
              }
            if (!isGood)
              continue;
          }
          s[x] = true;
          q.push(x);
        }
    }
    bool allS = true;
    for (int i = 0; i < n; ++i)
      if (s[i] != curr[i]) {
        allS = false;
        break;
      }
    if (allS) {
      for (int i = 0; i < n; ++i)
        w[i] = s[i];
      break;
    }
    vector<bool> nonS(n, false);
    for (int i = 0; i < n; ++i)
      if (curr[i])
        nonS[i] = !s[i];
    for (int i = 0; i < n; ++i)
      if (curr[i] && nonS[i])
        q.push(i);
    while (!q.empty()) {
      auto y = q.front();
      q.pop();
      for (auto x: prv[y])
        if (curr[x] && !nonS[x]) {
          if (a[x]) {
            bool isGood = true;
            for (auto z: nxt[x])
              if (curr[z] && !nonS[z]) {
                isGood = false;
                break;
              }
            if (!isGood)
              continue;
          }
          nonS[x] = true;
          q.push(x);
        }
    }
    for (int i = 0; i < n; ++i)
      if (curr[i] && nonS[i])
        curr[i] = false;
  }
  return w;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1068 KB Output is correct
2 Correct 6 ms 1108 KB Output is correct
3 Correct 8 ms 1108 KB Output is correct
4 Correct 6 ms 1108 KB Output is correct
5 Correct 5 ms 1100 KB Output is correct
6 Correct 6 ms 1064 KB Output is correct
7 Correct 5 ms 1108 KB Output is correct
8 Correct 5 ms 1068 KB Output is correct
9 Correct 5 ms 1108 KB Output is correct
10 Correct 6 ms 980 KB Output is correct
11 Correct 4 ms 980 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 288 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 292 KB Output is correct
11 Correct 1 ms 272 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 1600 KB Output is correct
2 Correct 200 ms 1592 KB Output is correct
3 Correct 230 ms 1584 KB Output is correct
4 Correct 8 ms 1492 KB Output is correct
5 Correct 9 ms 1492 KB Output is correct
6 Correct 9 ms 1492 KB Output is correct
7 Correct 8 ms 1492 KB Output is correct
8 Correct 8 ms 1580 KB Output is correct
9 Correct 9 ms 1448 KB Output is correct
10 Correct 10 ms 1492 KB Output is correct
11 Correct 8 ms 1472 KB Output is correct
12 Correct 8 ms 1448 KB Output is correct
13 Correct 8 ms 1456 KB Output is correct
14 Correct 8 ms 1584 KB Output is correct
15 Correct 9 ms 1620 KB Output is correct
16 Correct 8 ms 1492 KB Output is correct
17 Correct 11 ms 1616 KB Output is correct
18 Correct 344 ms 1108 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1364 KB Output is correct
2 Correct 8 ms 1364 KB Output is correct
3 Correct 9 ms 1448 KB Output is correct
4 Correct 9 ms 1452 KB Output is correct
5 Correct 13 ms 1492 KB Output is correct
6 Correct 9 ms 1480 KB Output is correct
7 Correct 9 ms 1492 KB Output is correct
8 Correct 9 ms 1512 KB Output is correct
9 Correct 8 ms 1364 KB Output is correct
10 Correct 9 ms 1492 KB Output is correct
11 Correct 8 ms 1492 KB Output is correct
12 Correct 12 ms 1572 KB Output is correct
13 Correct 11 ms 1492 KB Output is correct
14 Correct 8 ms 1492 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 1492 KB Output is correct
2 Correct 9 ms 1492 KB Output is correct
3 Correct 9 ms 1488 KB Output is correct
4 Correct 7 ms 1364 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 4 ms 1108 KB Output is correct
7 Correct 5 ms 940 KB Output is correct
8 Correct 6 ms 980 KB Output is correct
9 Correct 5 ms 928 KB Output is correct
10 Correct 2 ms 424 KB Output is correct
11 Correct 6 ms 852 KB Output is correct

Subtask #6
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1068 KB Output is correct
2 Correct 6 ms 1108 KB Output is correct
3 Correct 8 ms 1108 KB Output is correct
4 Correct 6 ms 1108 KB Output is correct
5 Correct 5 ms 1100 KB Output is correct
6 Correct 6 ms 1064 KB Output is correct
7 Correct 5 ms 1108 KB Output is correct
8 Correct 5 ms 1068 KB Output is correct
9 Correct 5 ms 1108 KB Output is correct
10 Correct 6 ms 980 KB Output is correct
11 Correct 4 ms 980 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 288 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 292 KB Output is correct
22 Correct 1 ms 272 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 87 ms 1600 KB Output is correct
33 Correct 200 ms 1592 KB Output is correct
34 Correct 230 ms 1584 KB Output is correct
35 Correct 8 ms 1492 KB Output is correct
36 Correct 9 ms 1492 KB Output is correct
37 Correct 9 ms 1492 KB Output is correct
38 Correct 8 ms 1492 KB Output is correct
39 Correct 8 ms 1580 KB Output is correct
40 Correct 9 ms 1448 KB Output is correct
41 Correct 10 ms 1492 KB Output is correct
42 Correct 8 ms 1472 KB Output is correct
43 Correct 8 ms 1448 KB Output is correct
44 Correct 8 ms 1456 KB Output is correct
45 Correct 8 ms 1584 KB Output is correct
46 Correct 9 ms 1620 KB Output is correct
47 Correct 8 ms 1492 KB Output is correct
48 Correct 11 ms 1616 KB Output is correct
49 Correct 344 ms 1108 KB Output is correct
50 Correct 7 ms 1364 KB Output is correct
51 Correct 8 ms 1364 KB Output is correct
52 Correct 9 ms 1448 KB Output is correct
53 Correct 9 ms 1452 KB Output is correct
54 Correct 13 ms 1492 KB Output is correct
55 Correct 9 ms 1480 KB Output is correct
56 Correct 9 ms 1492 KB Output is correct
57 Correct 9 ms 1512 KB Output is correct
58 Correct 8 ms 1364 KB Output is correct
59 Correct 9 ms 1492 KB Output is correct
60 Correct 8 ms 1492 KB Output is correct
61 Correct 12 ms 1572 KB Output is correct
62 Correct 11 ms 1492 KB Output is correct
63 Correct 8 ms 1492 KB Output is correct
64 Correct 9 ms 1492 KB Output is correct
65 Correct 9 ms 1492 KB Output is correct
66 Correct 9 ms 1488 KB Output is correct
67 Correct 7 ms 1364 KB Output is correct
68 Correct 1 ms 340 KB Output is correct
69 Correct 4 ms 1108 KB Output is correct
70 Correct 5 ms 940 KB Output is correct
71 Correct 6 ms 980 KB Output is correct
72 Correct 5 ms 928 KB Output is correct
73 Correct 2 ms 424 KB Output is correct
74 Correct 6 ms 852 KB Output is correct
75 Correct 165 ms 1492 KB Output is correct
76 Correct 229 ms 1592 KB Output is correct
77 Correct 337 ms 1584 KB Output is correct
78 Correct 285 ms 1584 KB Output is correct
79 Correct 334 ms 1588 KB Output is correct
80 Correct 10 ms 1492 KB Output is correct
81 Correct 9 ms 1492 KB Output is correct
82 Correct 10 ms 1456 KB Output is correct
83 Correct 9 ms 1492 KB Output is correct
84 Correct 9 ms 1492 KB Output is correct
85 Correct 10 ms 1556 KB Output is correct
86 Correct 9 ms 1456 KB Output is correct
87 Correct 8 ms 1456 KB Output is correct
88 Correct 12 ms 1576 KB Output is correct
89 Correct 8 ms 1476 KB Output is correct
90 Correct 15 ms 1564 KB Output is correct
91 Correct 14 ms 1492 KB Output is correct
92 Correct 27 ms 1472 KB Output is correct
93 Correct 38 ms 1544 KB Output is correct
94 Correct 30 ms 1560 KB Output is correct
95 Correct 31 ms 1492 KB Output is correct
96 Correct 99 ms 1452 KB Output is correct
97 Correct 270 ms 1552 KB Output is correct
98 Correct 437 ms 1520 KB Output is correct
99 Correct 435 ms 1512 KB Output is correct
100 Correct 338 ms 1196 KB Output is correct