oj.uz

답안 #321122

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
321122 2020-11-11T04:37:57 Z VROOM_VARUN 장난감 기차 (IOI17_train) C++14
100 / 100
 512 ms 1516 KB 
/*
ID: varunra2
LANG: C++
TASK: trains
*/

#include<bits/stdc++.h>
using namespace std;

#ifdef DEBUG
#include "lib/debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define debug_arr(...) \
  cerr << "[" << #__VA_ARGS__ << "]:", debug_arr(__VA_ARGS__)
#pragma GCC diagnostic ignored "-Wsign-compare"
//#pragma GCC diagnostic ignored "-Wunused-parameter"
//#pragma GCC diagnostic ignored "-Wunused-variable"
#else
#define debug(...) 42
#endif

#define EPS 1e-9
#define IN(A, B, C) assert(B <= A && A <= C)
#define INF (int)1e9
#define MEM(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define MP make_pair
#define PB push_back
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define x first
#define y second

const double PI = acos(-1.0);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef map<int, int> MPII;
typedef multiset<int> MSETI;
typedef set<int> SETI;
typedef set<string> SETS;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<string> VS;

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef vector<int> vi;
#pragma GCC diagnostic ignored "-Wsign-compare"
// util functions

VVI adj;
int n, m;
VI charge;
VI deg;

void dfs(int u) {
  for(auto& x: adj[u]) {
    deg[x]--;
    if(!charge[x] and !deg[x]) dfs(x);
  }
}

VI who_wins(VI as, VI charge, VI u, VI v) {
  n = sz(as);
  m = sz(u);
  adj.resize(n);
  for(int i = 0; i < m; i++) {
    adj[v[i]].PB(u[i]);
  }
  ::charge = charge;
  vector<bool> ret(n, true);
  deg.assign(n, 0);
  VI tot(n, 0);
  for(int i = 0; i < m; i++) {
    tot[u[i]]++;
  }
  bool work = true;
  while(work) {
    work = false;
    for(int i = 0; i < n; i++) {
      if(as[i]) deg[i] = 1;
      else deg[i] = tot[i];
    }
    for(int i = 0; i < n; i++) {
      if(charge[i] and ret[i]) dfs(i);
    }
    for(int i = 0; i < n; i++) {
      if(charge[i] and ret[i] and deg[i] > 0) {
        work = true;
        ret[i] = false;
      }
    }
  }
  for(int i = 0; i < n; i++) {
    if(deg[i] > 0) ret[i] = false;
  }
  VI rr(n);
  for(int i = 0; i < n; i++) {
    rr[i] = ret[i];
  }
  return rr;
}

// int main() {
// #ifndef ONLINE_JUDGE
//   freopen("trains.in", "r", stdin);
//   freopen("trains.out", "w", stdout);
// #endif
//   cin.sync_with_stdio(0); cin.tie(0);

//   return 0;
// }

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 90 ms 1516 KB Output is correct
2 Correct 179 ms 1508 KB Output is correct
3 Correct 238 ms 1388 KB Output is correct
4 Correct 8 ms 1388 KB Output is correct
5 Correct 12 ms 1388 KB Output is correct
6 Correct 10 ms 1388 KB Output is correct
7 Correct 8 ms 1388 KB Output is correct
8 Correct 8 ms 1388 KB Output is correct
9 Correct 7 ms 1260 KB Output is correct
10 Correct 8 ms 1260 KB Output is correct
11 Correct 8 ms 1260 KB Output is correct
12 Correct 9 ms 1260 KB Output is correct
13 Correct 8 ms 1516 KB Output is correct
14 Correct 10 ms 1516 KB Output is correct
15 Correct 10 ms 1516 KB Output is correct
16 Correct 8 ms 1516 KB Output is correct
17 Correct 8 ms 1516 KB Output is correct
18 Correct 339 ms 1124 KB Output is correct

Subtask #4
11.0 / 11.0

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

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 1388 KB Output is correct
2 Correct 8 ms 1516 KB Output is correct
3 Correct 8 ms 1388 KB Output is correct
4 Correct 8 ms 1388 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 4 ms 876 KB Output is correct
7 Correct 5 ms 876 KB Output is correct
8 Correct 5 ms 1004 KB Output is correct
9 Correct 6 ms 1004 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 5 ms 876 KB Output is correct

Subtask #6
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 1004 KB Output is correct
2 Correct 7 ms 1004 KB Output is correct
3 Correct 6 ms 1000 KB Output is correct
4 Correct 7 ms 1004 KB Output is correct
5 Correct 6 ms 1004 KB Output is correct
6 Correct 7 ms 1004 KB Output is correct
7 Correct 6 ms 1004 KB Output is correct
8 Correct 7 ms 1004 KB Output is correct
9 Correct 5 ms 876 KB Output is correct
10 Correct 5 ms 876 KB Output is correct
11 Correct 4 ms 1004 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 90 ms 1516 KB Output is correct
33 Correct 179 ms 1508 KB Output is correct
34 Correct 238 ms 1388 KB Output is correct
35 Correct 8 ms 1388 KB Output is correct
36 Correct 12 ms 1388 KB Output is correct
37 Correct 10 ms 1388 KB Output is correct
38 Correct 8 ms 1388 KB Output is correct
39 Correct 8 ms 1388 KB Output is correct
40 Correct 7 ms 1260 KB Output is correct
41 Correct 8 ms 1260 KB Output is correct
42 Correct 8 ms 1260 KB Output is correct
43 Correct 9 ms 1260 KB Output is correct
44 Correct 8 ms 1516 KB Output is correct
45 Correct 10 ms 1516 KB Output is correct
46 Correct 10 ms 1516 KB Output is correct
47 Correct 8 ms 1516 KB Output is correct
48 Correct 8 ms 1516 KB Output is correct
49 Correct 339 ms 1124 KB Output is correct
50 Correct 7 ms 1132 KB Output is correct
51 Correct 9 ms 1260 KB Output is correct
52 Correct 8 ms 1260 KB Output is correct
53 Correct 9 ms 1388 KB Output is correct
54 Correct 8 ms 1388 KB Output is correct
55 Correct 8 ms 1388 KB Output is correct
56 Correct 8 ms 1388 KB Output is correct
57 Correct 8 ms 1260 KB Output is correct
58 Correct 8 ms 1260 KB Output is correct
59 Correct 8 ms 1388 KB Output is correct
60 Correct 8 ms 1388 KB Output is correct
61 Correct 8 ms 1388 KB Output is correct
62 Correct 8 ms 1388 KB Output is correct
63 Correct 7 ms 1260 KB Output is correct
64 Correct 8 ms 1388 KB Output is correct
65 Correct 8 ms 1516 KB Output is correct
66 Correct 8 ms 1388 KB Output is correct
67 Correct 8 ms 1388 KB Output is correct
68 Correct 1 ms 364 KB Output is correct
69 Correct 4 ms 876 KB Output is correct
70 Correct 5 ms 876 KB Output is correct
71 Correct 5 ms 1004 KB Output is correct
72 Correct 6 ms 1004 KB Output is correct
73 Correct 2 ms 492 KB Output is correct
74 Correct 5 ms 876 KB Output is correct
75 Correct 120 ms 1388 KB Output is correct
76 Correct 174 ms 1508 KB Output is correct
77 Correct 249 ms 1400 KB Output is correct
78 Correct 251 ms 1384 KB Output is correct
79 Correct 252 ms 1380 KB Output is correct
80 Correct 8 ms 1388 KB Output is correct
81 Correct 9 ms 1388 KB Output is correct
82 Correct 9 ms 1388 KB Output is correct
83 Correct 11 ms 1388 KB Output is correct
84 Correct 11 ms 1388 KB Output is correct
85 Correct 9 ms 1380 KB Output is correct
86 Correct 11 ms 1388 KB Output is correct
87 Correct 8 ms 1388 KB Output is correct
88 Correct 14 ms 1388 KB Output is correct
89 Correct 9 ms 1388 KB Output is correct
90 Correct 18 ms 1388 KB Output is correct
91 Correct 21 ms 1380 KB Output is correct
92 Correct 34 ms 1388 KB Output is correct
93 Correct 28 ms 1388 KB Output is correct
94 Correct 31 ms 1380 KB Output is correct
95 Correct 32 ms 1504 KB Output is correct
96 Correct 66 ms 1260 KB Output is correct
97 Correct 304 ms 1384 KB Output is correct
98 Correct 461 ms 1380 KB Output is correct
99 Correct 512 ms 1260 KB Output is correct
100 Correct 346 ms 1004 KB Output is correct