oj.uz

답안 #877125

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
877125 2023-11-22T22:44:38 Z MilosMilutinovic 장난감 기차 (IOI17_train) C++14
100 / 100
 482 ms 1884 KB 
#include "train.h"
#include <bits/stdc++.h>

using namespace std;

vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
  int n = (int) a.size();
  int m = (int) u.size();
  vector<vector<int>> g(n);
  vector<vector<int>> t(n);
  for (int i = 0; i < m; i++) {
    g[u[i]].push_back(v[i]);
    t[v[i]].push_back(u[i]);
  }
  vector<bool> rem(n);
  auto CalcA = [&](vector<int> f) {
    vector<int> que = f;
    vector<int> deg(n);
    for (int i = 0; i < n; i++) {
      if (rem[i]) {
        continue;
      }
      if (a[i] == 0) {
        for (int j : g[i]) {
          if (!rem[j]) {
            deg[i] += 1;
          }
        }
      } else {
        deg[i] = 1;
      }
    }
    for (int x : que) {
      deg[x] = 0;
    }
    for (int b = 0; b < (int) que.size(); b++) {
      int x = que[b];
      for (int y : t[x]) {
        if (deg[y] <= 0) {
          continue;
        }
        deg[y] -= 1;
        if (deg[y] == 0) {
          que.push_back(y);
        }
      }
    }
    return que;
  };
  auto CalcB = [&](vector<int> f) {
    vector<int> que = f;
    vector<int> deg(n);
    for (int i = 0; i < n; i++) {
      if (rem[i]) {
        continue;
      }
      if (a[i] == 0) {
        deg[i] = 1;
      } else {
        for (int j : g[i]) {
          if (!rem[j]) {
            deg[i] += 1;
          }
        }
      }
    }
    for (int x : que) {
      deg[x] = 0;
    }
    for (int b = 0; b < (int) que.size(); b++) {
      int x = que[b];
      for (int y : t[x]) {
        if (deg[y] <= 0) {
          continue;
        }
        deg[y] -= 1;
        if (deg[y] == 0) {
          que.push_back(y);
        }
      }
    }
    return que;
  };
  vector<int> ans(n);
  while (true) {
    vector<int> c;
    for (int i = 0; i < n; i++) {
      if (r[i] == 1 && !rem[i]) {
        c.push_back(i);
      }
    }
    vector<int> v = CalcA(c);
    int cnt = 0;
    for (int i = 0; i < n; i++) {
      if (!rem[i]) {
        cnt += 1;
      }
    }
    if (v.size() == cnt) {
      for (int x : v) {
        ans[x] = 1;
      }
      break;
    }
    vector<bool> in(n);
    for (int x : v) {
      in[x] = true;
    }
    vector<int> vec;
    for (int i = 0; i < n; i++) {
      if (!rem[i] && !in[i]) {
        vec.push_back(i);
      }
    }
    vector<int> bad = CalcB(vec);
    for (int x : bad) {
      rem[x] = true;
    }
  }
  return ans;
}

Compilation message

train.cpp: In function 'std::vector<int> who_wins(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
train.cpp:99:18: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   99 |     if (v.size() == cnt) {
      |         ~~~~~~~~~^~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1372 KB Output is correct
2 Correct 4 ms 1116 KB Output is correct
3 Correct 5 ms 1372 KB Output is correct
4 Correct 4 ms 1372 KB Output is correct
5 Correct 3 ms 1116 KB Output is correct
6 Correct 4 ms 1172 KB Output is correct
7 Correct 3 ms 1528 KB Output is correct
8 Correct 4 ms 1112 KB Output is correct
9 Correct 5 ms 1116 KB Output is correct
10 Correct 3 ms 1116 KB Output is correct
11 Correct 3 ms 1212 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 436 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 600 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 432 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 1840 KB Output is correct
2 Correct 151 ms 1628 KB Output is correct
3 Correct 185 ms 1628 KB Output is correct
4 Correct 6 ms 1628 KB Output is correct
5 Correct 7 ms 1628 KB Output is correct
6 Correct 7 ms 1564 KB Output is correct
7 Correct 7 ms 1628 KB Output is correct
8 Correct 7 ms 1672 KB Output is correct
9 Correct 7 ms 1628 KB Output is correct
10 Correct 6 ms 1628 KB Output is correct
11 Correct 6 ms 1572 KB Output is correct
12 Correct 5 ms 1472 KB Output is correct
13 Correct 6 ms 1628 KB Output is correct
14 Correct 6 ms 1764 KB Output is correct
15 Correct 6 ms 1628 KB Output is correct
16 Correct 6 ms 1604 KB Output is correct
17 Correct 6 ms 1628 KB Output is correct
18 Correct 254 ms 1628 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1372 KB Output is correct
2 Correct 5 ms 1628 KB Output is correct
3 Correct 6 ms 1628 KB Output is correct
4 Correct 6 ms 1628 KB Output is correct
5 Correct 6 ms 1624 KB Output is correct
6 Correct 6 ms 1624 KB Output is correct
7 Correct 6 ms 1628 KB Output is correct
8 Correct 6 ms 1628 KB Output is correct
9 Correct 6 ms 1628 KB Output is correct
10 Correct 6 ms 1764 KB Output is correct
11 Correct 6 ms 1628 KB Output is correct
12 Correct 6 ms 1604 KB Output is correct
13 Correct 6 ms 1628 KB Output is correct
14 Correct 6 ms 1624 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1756 KB Output is correct
2 Correct 9 ms 1628 KB Output is correct
3 Correct 6 ms 1692 KB Output is correct
4 Correct 5 ms 1624 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 3 ms 1152 KB Output is correct
7 Correct 4 ms 1116 KB Output is correct
8 Correct 4 ms 1368 KB Output is correct
9 Correct 4 ms 1116 KB Output is correct
10 Correct 1 ms 424 KB Output is correct
11 Correct 3 ms 1112 KB Output is correct

Subtask #6
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1372 KB Output is correct
2 Correct 4 ms 1116 KB Output is correct
3 Correct 5 ms 1372 KB Output is correct
4 Correct 4 ms 1372 KB Output is correct
5 Correct 3 ms 1116 KB Output is correct
6 Correct 4 ms 1172 KB Output is correct
7 Correct 3 ms 1528 KB Output is correct
8 Correct 4 ms 1112 KB Output is correct
9 Correct 5 ms 1116 KB Output is correct
10 Correct 3 ms 1116 KB Output is correct
11 Correct 3 ms 1212 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 436 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 600 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 432 KB Output is correct
32 Correct 68 ms 1840 KB Output is correct
33 Correct 151 ms 1628 KB Output is correct
34 Correct 185 ms 1628 KB Output is correct
35 Correct 6 ms 1628 KB Output is correct
36 Correct 7 ms 1628 KB Output is correct
37 Correct 7 ms 1564 KB Output is correct
38 Correct 7 ms 1628 KB Output is correct
39 Correct 7 ms 1672 KB Output is correct
40 Correct 7 ms 1628 KB Output is correct
41 Correct 6 ms 1628 KB Output is correct
42 Correct 6 ms 1572 KB Output is correct
43 Correct 5 ms 1472 KB Output is correct
44 Correct 6 ms 1628 KB Output is correct
45 Correct 6 ms 1764 KB Output is correct
46 Correct 6 ms 1628 KB Output is correct
47 Correct 6 ms 1604 KB Output is correct
48 Correct 6 ms 1628 KB Output is correct
49 Correct 254 ms 1628 KB Output is correct
50 Correct 5 ms 1372 KB Output is correct
51 Correct 5 ms 1628 KB Output is correct
52 Correct 6 ms 1628 KB Output is correct
53 Correct 6 ms 1628 KB Output is correct
54 Correct 6 ms 1624 KB Output is correct
55 Correct 6 ms 1624 KB Output is correct
56 Correct 6 ms 1628 KB Output is correct
57 Correct 6 ms 1628 KB Output is correct
58 Correct 6 ms 1628 KB Output is correct
59 Correct 6 ms 1764 KB Output is correct
60 Correct 6 ms 1628 KB Output is correct
61 Correct 6 ms 1604 KB Output is correct
62 Correct 6 ms 1628 KB Output is correct
63 Correct 6 ms 1624 KB Output is correct
64 Correct 6 ms 1756 KB Output is correct
65 Correct 9 ms 1628 KB Output is correct
66 Correct 6 ms 1692 KB Output is correct
67 Correct 5 ms 1624 KB Output is correct
68 Correct 1 ms 348 KB Output is correct
69 Correct 3 ms 1152 KB Output is correct
70 Correct 4 ms 1116 KB Output is correct
71 Correct 4 ms 1368 KB Output is correct
72 Correct 4 ms 1116 KB Output is correct
73 Correct 1 ms 424 KB Output is correct
74 Correct 3 ms 1112 KB Output is correct
75 Correct 93 ms 1884 KB Output is correct
76 Correct 150 ms 1836 KB Output is correct
77 Correct 213 ms 1796 KB Output is correct
78 Correct 209 ms 1876 KB Output is correct
79 Correct 206 ms 1700 KB Output is correct
80 Correct 6 ms 1628 KB Output is correct
81 Correct 6 ms 1728 KB Output is correct
82 Correct 7 ms 1624 KB Output is correct
83 Correct 7 ms 1628 KB Output is correct
84 Correct 7 ms 1880 KB Output is correct
85 Correct 7 ms 1628 KB Output is correct
86 Correct 7 ms 1628 KB Output is correct
87 Correct 6 ms 1604 KB Output is correct
88 Correct 9 ms 1628 KB Output is correct
89 Correct 6 ms 1624 KB Output is correct
90 Correct 11 ms 1600 KB Output is correct
91 Correct 13 ms 1628 KB Output is correct
92 Correct 19 ms 1628 KB Output is correct
93 Correct 19 ms 1780 KB Output is correct
94 Correct 20 ms 1628 KB Output is correct
95 Correct 21 ms 1824 KB Output is correct
96 Correct 63 ms 1624 KB Output is correct
97 Correct 317 ms 1772 KB Output is correct
98 Correct 473 ms 1876 KB Output is correct
99 Correct 482 ms 1756 KB Output is correct
100 Correct 253 ms 1372 KB Output is correct