oj.uz

답안 #821827

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
821827 2023-08-11T18:05:59 Z ttamx 장난감 기차 (IOI17_train) C++14
100 / 100
 231 ms 1728 KB 
#include "train.h"
#include<bits/stdc++.h>

using namespace std;

const int N=5005;

int n,m;
int all;
int a[N],cnt[N];
int deg[N];
bool vis[N],vis2[N],used[N];
vector<int> r;
vector<int> adj[N],rev[N];

vector<int> who_wins(vector<int> _a, vector<int> _r, vector<int> _u, vector<int> _v){
	n=_a.size();
	m=_u.size();
	all=n;
	for(int i=0;i<n;i++)a[i]=_a[i];
	for(int i=0;i<n;i++)if(_r[i])r.emplace_back(i);
	for(int i=0;i<m;i++){
		int u=_u[i],v=_v[i];
		adj[u].emplace_back(v);
		rev[v].emplace_back(u);
		deg[u]++;
	}
	vector<int> ans(n);
	while(all>0){
		vector<int> q;
		for(int i=0;i<n;i++){
			vis[i]=false;
			cnt[i]=0;
		}
		for(auto x:r){
			if(used[x])continue;
			q.emplace_back(x);
			vis[x]=true;
		}
		for(int i=0;i<q.size();i++){
			int u=q[i];
			for(auto v:rev[u]){
				if(vis[v]||used[v])continue;
				if(a[v]){
					vis[v]=true;
					q.emplace_back(v);
				}else if(++cnt[v]==adj[v].size()){
					vis[v]=true;
					q.emplace_back(v);
				}
			}
		}
		if(q.size()==all){
			for(auto x:q){
				ans[x]=1;
				used[x]=true;
				all--;
				for(auto v:rev[x])deg[v]--;
			}
			break;
		}
		vector<int> q2;
		for(int i=0;i<n;i++){
			vis2[i]=false;
			cnt[i]=0;
		}
		for(int i=0;i<n;i++){
			if(used[i])continue;
			if(!vis[i]){
				q2.emplace_back(i);
				vis2[i]=true;
			}
		}
		for(int i=0;i<q2.size();i++){
			int u=q2[i];
			for(auto v:rev[u]){
				if(vis2[v]||used[v])continue;
				if(!a[v]){
					vis2[v]=true;
					q2.emplace_back(v);
				}else if(++cnt[v]==deg[v]){
					vis2[v]=true;
					q2.emplace_back(v);
				}
			}
		}
		for(auto x:q2){
			ans[x]=0;
			used[x]=true;
			all--;
			for(auto v:rev[x])deg[v]--;
		}
	}
	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:40:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |   for(int i=0;i<q.size();i++){
      |               ~^~~~~~~~~
train.cpp:47:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |     }else if(++cnt[v]==adj[v].size()){
      |              ~~~~~~~~^~~~~~~~~~~~~~~
train.cpp:53:14: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   53 |   if(q.size()==all){
      |      ~~~~~~~~^~~~~
train.cpp:74:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |   for(int i=0;i<q2.size();i++){
      |               ~^~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 1528 KB Output is correct
2 Correct 63 ms 1516 KB Output is correct
3 Correct 80 ms 1492 KB Output is correct
4 Correct 6 ms 1492 KB Output is correct
5 Correct 6 ms 1464 KB Output is correct
6 Correct 7 ms 1616 KB Output is correct
7 Correct 6 ms 1712 KB Output is correct
8 Correct 8 ms 1580 KB Output is correct
9 Correct 6 ms 1584 KB Output is correct
10 Correct 6 ms 1540 KB Output is correct
11 Correct 7 ms 1620 KB Output is correct
12 Correct 5 ms 1536 KB Output is correct
13 Correct 6 ms 1620 KB Output is correct
14 Correct 6 ms 1620 KB Output is correct
15 Correct 6 ms 1716 KB Output is correct
16 Correct 6 ms 1712 KB Output is correct
17 Correct 6 ms 1620 KB Output is correct
18 Correct 109 ms 1364 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1364 KB Output is correct
2 Correct 6 ms 1348 KB Output is correct
3 Correct 6 ms 1372 KB Output is correct
4 Correct 6 ms 1492 KB Output is correct
5 Correct 6 ms 1472 KB Output is correct
6 Correct 6 ms 1364 KB Output is correct
7 Correct 6 ms 1364 KB Output is correct
8 Correct 7 ms 1364 KB Output is correct
9 Correct 5 ms 1364 KB Output is correct
10 Correct 6 ms 1436 KB Output is correct
11 Correct 6 ms 1464 KB Output is correct
12 Correct 6 ms 1516 KB Output is correct
13 Correct 6 ms 1372 KB Output is correct
14 Correct 6 ms 1364 KB Output is correct

Subtask #5
12.0 / 12.0

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

Subtask #6
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1108 KB Output is correct
2 Correct 4 ms 1108 KB Output is correct
3 Correct 4 ms 1108 KB Output is correct
4 Correct 3 ms 1108 KB Output is correct
5 Correct 3 ms 1108 KB Output is correct
6 Correct 3 ms 1108 KB Output is correct
7 Correct 3 ms 1108 KB Output is correct
8 Correct 3 ms 1108 KB Output is correct
9 Correct 3 ms 1108 KB Output is correct
10 Correct 3 ms 1108 KB Output is correct
11 Correct 3 ms 1108 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 0 ms 468 KB Output is correct
14 Correct 0 ms 468 KB Output is correct
15 Correct 0 ms 468 KB Output is correct
16 Correct 0 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 0 ms 468 KB Output is correct
19 Correct 0 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 0 ms 468 KB Output is correct
22 Correct 1 ms 544 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 0 ms 468 KB Output is correct
26 Correct 0 ms 540 KB Output is correct
27 Correct 0 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 540 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 544 KB Output is correct
32 Correct 38 ms 1528 KB Output is correct
33 Correct 63 ms 1516 KB Output is correct
34 Correct 80 ms 1492 KB Output is correct
35 Correct 6 ms 1492 KB Output is correct
36 Correct 6 ms 1464 KB Output is correct
37 Correct 7 ms 1616 KB Output is correct
38 Correct 6 ms 1712 KB Output is correct
39 Correct 8 ms 1580 KB Output is correct
40 Correct 6 ms 1584 KB Output is correct
41 Correct 6 ms 1540 KB Output is correct
42 Correct 7 ms 1620 KB Output is correct
43 Correct 5 ms 1536 KB Output is correct
44 Correct 6 ms 1620 KB Output is correct
45 Correct 6 ms 1620 KB Output is correct
46 Correct 6 ms 1716 KB Output is correct
47 Correct 6 ms 1712 KB Output is correct
48 Correct 6 ms 1620 KB Output is correct
49 Correct 109 ms 1364 KB Output is correct
50 Correct 5 ms 1364 KB Output is correct
51 Correct 6 ms 1348 KB Output is correct
52 Correct 6 ms 1372 KB Output is correct
53 Correct 6 ms 1492 KB Output is correct
54 Correct 6 ms 1472 KB Output is correct
55 Correct 6 ms 1364 KB Output is correct
56 Correct 6 ms 1364 KB Output is correct
57 Correct 7 ms 1364 KB Output is correct
58 Correct 5 ms 1364 KB Output is correct
59 Correct 6 ms 1436 KB Output is correct
60 Correct 6 ms 1464 KB Output is correct
61 Correct 6 ms 1516 KB Output is correct
62 Correct 6 ms 1372 KB Output is correct
63 Correct 6 ms 1364 KB Output is correct
64 Correct 6 ms 1492 KB Output is correct
65 Correct 6 ms 1492 KB Output is correct
66 Correct 6 ms 1364 KB Output is correct
67 Correct 7 ms 1364 KB Output is correct
68 Correct 1 ms 596 KB Output is correct
69 Correct 3 ms 1108 KB Output is correct
70 Correct 4 ms 1108 KB Output is correct
71 Correct 4 ms 1136 KB Output is correct
72 Correct 4 ms 1108 KB Output is correct
73 Correct 1 ms 724 KB Output is correct
74 Correct 4 ms 980 KB Output is correct
75 Correct 71 ms 1688 KB Output is correct
76 Correct 88 ms 1728 KB Output is correct
77 Correct 102 ms 1724 KB Output is correct
78 Correct 102 ms 1724 KB Output is correct
79 Correct 102 ms 1620 KB Output is correct
80 Correct 6 ms 1688 KB Output is correct
81 Correct 6 ms 1620 KB Output is correct
82 Correct 7 ms 1620 KB Output is correct
83 Correct 8 ms 1700 KB Output is correct
84 Correct 7 ms 1584 KB Output is correct
85 Correct 6 ms 1612 KB Output is correct
86 Correct 7 ms 1620 KB Output is correct
87 Correct 6 ms 1620 KB Output is correct
88 Correct 8 ms 1620 KB Output is correct
89 Correct 7 ms 1576 KB Output is correct
90 Correct 12 ms 1700 KB Output is correct
91 Correct 9 ms 1620 KB Output is correct
92 Correct 13 ms 1728 KB Output is correct
93 Correct 16 ms 1696 KB Output is correct
94 Correct 15 ms 1716 KB Output is correct
95 Correct 16 ms 1708 KB Output is correct
96 Correct 49 ms 1612 KB Output is correct
97 Correct 127 ms 1692 KB Output is correct
98 Correct 231 ms 1656 KB Output is correct
99 Correct 187 ms 1656 KB Output is correct
100 Correct 103 ms 1236 KB Output is correct