oj.uz

답안 #802083

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
802083 2023-08-02T09:36:03 Z kirakaminski968 장난감 기차 (IOI17_train) C++17
100 / 100
 504 ms 1492 KB 
#include "train.h"
#include <bits/stdc++.h>
using namespace std;
int n,m;
vector<int> adj[5005];
vector<int> exc; 
vector<int> calc(vector<int> &a, vector<int> &v, int winner){
  vector<int> deg(n); 
  queue<int> q; 
  for(int i = 0;i<n;++i){
    if(exc[i]) continue; 
    for(auto x : adj[i]){
      if(!exc[x]) deg[x]++; 
    }
  }
  for(auto x : v){
    if(deg[x] > 0){
      deg[x] = 0; 
    }
    q.push(x); 
  }
  vector<int> res; 
  while(!q.empty()){
    int u = q.front(); q.pop(); 
    res.push_back(u); 
    for(auto x : adj[u]){
      if(exc[x]) continue; 
      if(a[x] == winner && deg[x] > 0){
        deg[x] = 0; 
        q.push(x); 
      }
      else if(a[x] != winner){
        deg[x]--; 
        if(deg[x] == 0) q.push(x); 
      }
    }
  }
  return res; 
}
vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v){
  n = a.size(); m = u.size(); 
  vector<int> ans(n); 
  exc.resize(n); 
  for(int i = 0;i<m;++i){
    adj[v[i]].push_back(u[i]); 
  }
  while(true){
    int alive = count(exc.begin(),exc.end(),0); 
    if(alive == 0) break; 
    vector<int> R; 
    for(int i = 0;i<n;++i){
      if(!exc[i] && r[i]) R.push_back(i); 
    }
    R = calc(a,R,1); 
    if(R.size() == alive){
      for(auto x : R){
        exc[x] = 1; 
        ans[x] = 1; 
      }
    }
    else{
      vector<int> rem(n); 
      for(auto x : R) rem[x] = 1; 
      R.clear(); 
      for(int i = 0;i<n;++i){
        if(!exc[i] && !rem[i]) R.push_back(i); 
      }
      R = calc(a,R,0); 
      for(auto x : R){
        exc[x] = 1; 
        ans[x] = 0; 
      }
    }
  }
  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:55:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   55 |     if(R.size() == alive){
      |        ~~~~~~~~~^~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 87 ms 1144 KB Output is correct
2 Correct 164 ms 1180 KB Output is correct
3 Correct 234 ms 1160 KB Output is correct
4 Correct 5 ms 1108 KB Output is correct
5 Correct 6 ms 1328 KB Output is correct
6 Correct 6 ms 1236 KB Output is correct
7 Correct 5 ms 1364 KB Output is correct
8 Correct 6 ms 1328 KB Output is correct
9 Correct 6 ms 1364 KB Output is correct
10 Correct 5 ms 1236 KB Output is correct
11 Correct 6 ms 1236 KB Output is correct
12 Correct 5 ms 1236 KB Output is correct
13 Correct 6 ms 1236 KB Output is correct
14 Correct 5 ms 1364 KB Output is correct
15 Correct 5 ms 1336 KB Output is correct
16 Correct 5 ms 1364 KB Output is correct
17 Correct 6 ms 1364 KB Output is correct
18 Correct 243 ms 1064 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 980 KB Output is correct
2 Correct 5 ms 1196 KB Output is correct
3 Correct 5 ms 1328 KB Output is correct
4 Correct 5 ms 1368 KB Output is correct
5 Correct 5 ms 1324 KB Output is correct
6 Correct 5 ms 1236 KB Output is correct
7 Correct 5 ms 1236 KB Output is correct
8 Correct 5 ms 1236 KB Output is correct
9 Correct 5 ms 1236 KB Output is correct
10 Correct 5 ms 1364 KB Output is correct
11 Correct 6 ms 1492 KB Output is correct
12 Correct 5 ms 1364 KB Output is correct
13 Correct 6 ms 1364 KB Output is correct
14 Correct 5 ms 1268 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1108 KB Output is correct
2 Correct 5 ms 1364 KB Output is correct
3 Correct 6 ms 1236 KB Output is correct
4 Correct 5 ms 1216 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 3 ms 980 KB Output is correct
7 Correct 4 ms 980 KB Output is correct
8 Correct 4 ms 980 KB Output is correct
9 Correct 4 ms 980 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 3 ms 852 KB Output is correct

Subtask #6
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 852 KB Output is correct
2 Correct 4 ms 980 KB Output is correct
3 Correct 3 ms 980 KB Output is correct
4 Correct 4 ms 980 KB Output is correct
5 Correct 3 ms 980 KB Output is correct
6 Correct 5 ms 852 KB Output is correct
7 Correct 3 ms 980 KB Output is correct
8 Correct 4 ms 948 KB Output is correct
9 Correct 3 ms 852 KB Output is correct
10 Correct 3 ms 852 KB Output is correct
11 Correct 3 ms 852 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 416 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 424 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 1 ms 428 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 424 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 87 ms 1144 KB Output is correct
33 Correct 164 ms 1180 KB Output is correct
34 Correct 234 ms 1160 KB Output is correct
35 Correct 5 ms 1108 KB Output is correct
36 Correct 6 ms 1328 KB Output is correct
37 Correct 6 ms 1236 KB Output is correct
38 Correct 5 ms 1364 KB Output is correct
39 Correct 6 ms 1328 KB Output is correct
40 Correct 6 ms 1364 KB Output is correct
41 Correct 5 ms 1236 KB Output is correct
42 Correct 6 ms 1236 KB Output is correct
43 Correct 5 ms 1236 KB Output is correct
44 Correct 6 ms 1236 KB Output is correct
45 Correct 5 ms 1364 KB Output is correct
46 Correct 5 ms 1336 KB Output is correct
47 Correct 5 ms 1364 KB Output is correct
48 Correct 6 ms 1364 KB Output is correct
49 Correct 243 ms 1064 KB Output is correct
50 Correct 5 ms 980 KB Output is correct
51 Correct 5 ms 1196 KB Output is correct
52 Correct 5 ms 1328 KB Output is correct
53 Correct 5 ms 1368 KB Output is correct
54 Correct 5 ms 1324 KB Output is correct
55 Correct 5 ms 1236 KB Output is correct
56 Correct 5 ms 1236 KB Output is correct
57 Correct 5 ms 1236 KB Output is correct
58 Correct 5 ms 1236 KB Output is correct
59 Correct 5 ms 1364 KB Output is correct
60 Correct 6 ms 1492 KB Output is correct
61 Correct 5 ms 1364 KB Output is correct
62 Correct 6 ms 1364 KB Output is correct
63 Correct 5 ms 1268 KB Output is correct
64 Correct 6 ms 1108 KB Output is correct
65 Correct 5 ms 1364 KB Output is correct
66 Correct 6 ms 1236 KB Output is correct
67 Correct 5 ms 1216 KB Output is correct
68 Correct 2 ms 468 KB Output is correct
69 Correct 3 ms 980 KB Output is correct
70 Correct 4 ms 980 KB Output is correct
71 Correct 4 ms 980 KB Output is correct
72 Correct 4 ms 980 KB Output is correct
73 Correct 1 ms 596 KB Output is correct
74 Correct 3 ms 852 KB Output is correct
75 Correct 120 ms 1364 KB Output is correct
76 Correct 180 ms 1376 KB Output is correct
77 Correct 233 ms 1372 KB Output is correct
78 Correct 228 ms 1368 KB Output is correct
79 Correct 225 ms 1376 KB Output is correct
80 Correct 5 ms 1236 KB Output is correct
81 Correct 6 ms 1364 KB Output is correct
82 Correct 7 ms 1236 KB Output is correct
83 Correct 7 ms 1328 KB Output is correct
84 Correct 6 ms 1364 KB Output is correct
85 Correct 6 ms 1324 KB Output is correct
86 Correct 6 ms 1328 KB Output is correct
87 Correct 5 ms 1312 KB Output is correct
88 Correct 9 ms 1236 KB Output is correct
89 Correct 6 ms 1332 KB Output is correct
90 Correct 11 ms 1236 KB Output is correct
91 Correct 10 ms 1328 KB Output is correct
92 Correct 20 ms 1332 KB Output is correct
93 Correct 22 ms 1332 KB Output is correct
94 Correct 21 ms 1368 KB Output is correct
95 Correct 22 ms 1364 KB Output is correct
96 Correct 73 ms 1244 KB Output is correct
97 Correct 280 ms 1476 KB Output is correct
98 Correct 478 ms 1320 KB Output is correct
99 Correct 504 ms 1340 KB Output is correct
100 Correct 246 ms 1060 KB Output is correct