oj.uz

답안 #269367

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
269367 2020-08-17T06:43:23 Z kdh9949 장난감 기차 (IOI17_train) C++17
100 / 100
 467 ms 1784 KB 
#include "train.h"
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;

using vint = vector<int>;
using vll = vector<ll>;
using vld = vector<ld>;
using vpii = vector<pii>;
using vpil = vector<pil>;
using vpli = vector<pli>;
using vpll = vector<pll>;

#define x first
#define y second
#define all(v) v.begin(),v.end()

vint who_wins(vint a, vint r, vint u, vint v) {
  int n = a.size(), m = u.size();
  vector<vint> e(n), re(n);
  for(int i = 0; i < m; i++) {
    e[u[i]].push_back(v[i]);
    re[v[i]].push_back(u[i]);
  }

  vint elim(n), ch(n), vis(n), deg(n), cur(n), ans(n, 1), ev;
  queue<int> q;
  int leftn = n;
  for(int i = 0; i < n; i++) deg[i] = e[i].size();

  while(leftn) {
    fill(all(ch), 0);
    fill(all(vis), 0);
    copy(all(deg), cur.begin());
    for(int i = 0; i < n; i++) if(!elim[i] && r[i]) { ch[i] = vis[i] = 1; q.push(i); }
    while(!q.empty()) {
      int x = q.front();
      q.pop();
      for(int i : re[x]) {
        if(elim[i] || vis[i]) continue;
        cur[i]--;
        if(a[i] || !cur[i]) {
          ch[i] = vis[i] = 1;
          q.push(i);
        }
      }
    }
    if(count(all(ch), 1) == leftn) break;
    
    copy(all(deg), cur.begin());
    ev.resize(0);
    for(int i = 0; i < n; i++) if(!elim[i] && !ch[i]) {
      ev.push_back(i); elim[i] = 1; q.push(i);
    }
    while(!q.empty()) {
      int x = q.front();
      q.pop();
      for(int i : re[x]) {
        if(elim[i]) continue;
        cur[i]--;
        if(!a[i] || !cur[i]) {
          ev.push_back(i);
          elim[i] = 1;
          q.push(i);
        }
      }
    }

    leftn -= int(ev.size());
    for(int x : ev) {
      ans[x] = 0;
      for(int i : re[x]) deg[i]--;
    }
  }

  return ans;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 1152 KB Output is correct
2 Correct 7 ms 1184 KB Output is correct
3 Correct 6 ms 1152 KB Output is correct
4 Correct 6 ms 1152 KB Output is correct
5 Correct 6 ms 1152 KB Output is correct
6 Correct 6 ms 1152 KB Output is correct
7 Correct 7 ms 1152 KB Output is correct
8 Correct 6 ms 1152 KB Output is correct
9 Correct 6 ms 1152 KB Output is correct
10 Correct 5 ms 1280 KB Output is correct
11 Correct 5 ms 1152 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 106 ms 1656 KB Output is correct
2 Correct 178 ms 1784 KB Output is correct
3 Correct 229 ms 1536 KB Output is correct
4 Correct 11 ms 1536 KB Output is correct
5 Correct 14 ms 1536 KB Output is correct
6 Correct 11 ms 1536 KB Output is correct
7 Correct 13 ms 1536 KB Output is correct
8 Correct 11 ms 1536 KB Output is correct
9 Correct 10 ms 1536 KB Output is correct
10 Correct 10 ms 1408 KB Output is correct
11 Correct 11 ms 1536 KB Output is correct
12 Correct 9 ms 1408 KB Output is correct
13 Correct 11 ms 1536 KB Output is correct
14 Correct 10 ms 1536 KB Output is correct
15 Correct 11 ms 1536 KB Output is correct
16 Correct 10 ms 1536 KB Output is correct
17 Correct 11 ms 1536 KB Output is correct
18 Correct 328 ms 1400 KB Output is correct

Subtask #4
11.0 / 11.0

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

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 1536 KB Output is correct
2 Correct 10 ms 1536 KB Output is correct
3 Correct 11 ms 1536 KB Output is correct
4 Correct 9 ms 1408 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 5 ms 1152 KB Output is correct
7 Correct 6 ms 896 KB Output is correct
8 Correct 7 ms 896 KB Output is correct
9 Correct 7 ms 896 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 6 ms 896 KB Output is correct

Subtask #6
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 1152 KB Output is correct
2 Correct 7 ms 1184 KB Output is correct
3 Correct 6 ms 1152 KB Output is correct
4 Correct 6 ms 1152 KB Output is correct
5 Correct 6 ms 1152 KB Output is correct
6 Correct 6 ms 1152 KB Output is correct
7 Correct 7 ms 1152 KB Output is correct
8 Correct 6 ms 1152 KB Output is correct
9 Correct 6 ms 1152 KB Output is correct
10 Correct 5 ms 1280 KB Output is correct
11 Correct 5 ms 1152 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 0 ms 256 KB Output is correct
21 Correct 0 ms 256 KB Output is correct
22 Correct 0 ms 256 KB Output is correct
23 Correct 0 ms 256 KB Output is correct
24 Correct 1 ms 256 KB Output is correct
25 Correct 0 ms 256 KB Output is correct
26 Correct 0 ms 256 KB Output is correct
27 Correct 0 ms 256 KB Output is correct
28 Correct 0 ms 256 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 0 ms 256 KB Output is correct
32 Correct 106 ms 1656 KB Output is correct
33 Correct 178 ms 1784 KB Output is correct
34 Correct 229 ms 1536 KB Output is correct
35 Correct 11 ms 1536 KB Output is correct
36 Correct 14 ms 1536 KB Output is correct
37 Correct 11 ms 1536 KB Output is correct
38 Correct 13 ms 1536 KB Output is correct
39 Correct 11 ms 1536 KB Output is correct
40 Correct 10 ms 1536 KB Output is correct
41 Correct 10 ms 1408 KB Output is correct
42 Correct 11 ms 1536 KB Output is correct
43 Correct 9 ms 1408 KB Output is correct
44 Correct 11 ms 1536 KB Output is correct
45 Correct 10 ms 1536 KB Output is correct
46 Correct 11 ms 1536 KB Output is correct
47 Correct 10 ms 1536 KB Output is correct
48 Correct 11 ms 1536 KB Output is correct
49 Correct 328 ms 1400 KB Output is correct
50 Correct 9 ms 1280 KB Output is correct
51 Correct 10 ms 1408 KB Output is correct
52 Correct 10 ms 1536 KB Output is correct
53 Correct 11 ms 1536 KB Output is correct
54 Correct 12 ms 1536 KB Output is correct
55 Correct 12 ms 1536 KB Output is correct
56 Correct 11 ms 1536 KB Output is correct
57 Correct 10 ms 1536 KB Output is correct
58 Correct 10 ms 1408 KB Output is correct
59 Correct 10 ms 1536 KB Output is correct
60 Correct 11 ms 1536 KB Output is correct
61 Correct 11 ms 1536 KB Output is correct
62 Correct 12 ms 1536 KB Output is correct
63 Correct 10 ms 1408 KB Output is correct
64 Correct 11 ms 1536 KB Output is correct
65 Correct 10 ms 1536 KB Output is correct
66 Correct 11 ms 1536 KB Output is correct
67 Correct 9 ms 1408 KB Output is correct
68 Correct 1 ms 384 KB Output is correct
69 Correct 5 ms 1152 KB Output is correct
70 Correct 6 ms 896 KB Output is correct
71 Correct 7 ms 896 KB Output is correct
72 Correct 7 ms 896 KB Output is correct
73 Correct 2 ms 512 KB Output is correct
74 Correct 6 ms 896 KB Output is correct
75 Correct 168 ms 1536 KB Output is correct
76 Correct 214 ms 1656 KB Output is correct
77 Correct 284 ms 1656 KB Output is correct
78 Correct 289 ms 1560 KB Output is correct
79 Correct 302 ms 1656 KB Output is correct
80 Correct 15 ms 1536 KB Output is correct
81 Correct 11 ms 1536 KB Output is correct
82 Correct 12 ms 1536 KB Output is correct
83 Correct 12 ms 1536 KB Output is correct
84 Correct 14 ms 1536 KB Output is correct
85 Correct 14 ms 1536 KB Output is correct
86 Correct 12 ms 1536 KB Output is correct
87 Correct 11 ms 1536 KB Output is correct
88 Correct 15 ms 1536 KB Output is correct
89 Correct 14 ms 1536 KB Output is correct
90 Correct 17 ms 1536 KB Output is correct
91 Correct 16 ms 1536 KB Output is correct
92 Correct 28 ms 1536 KB Output is correct
93 Correct 32 ms 1528 KB Output is correct
94 Correct 30 ms 1528 KB Output is correct
95 Correct 28 ms 1528 KB Output is correct
96 Correct 82 ms 1408 KB Output is correct
97 Correct 263 ms 1528 KB Output is correct
98 Correct 467 ms 1512 KB Output is correct
99 Correct 418 ms 1528 KB Output is correct
100 Correct 323 ms 1280 KB Output is correct