oj.uz

답안 #294391

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
294391 2020-09-08T22:02:52 Z eohomegrownapps 장난감 기차 (IOI17_train) C++14
100 / 100
 783 ms 1824 KB 
#include "train.h"
#include <bits/stdc++.h>
using namespace std;

int n,m;

vector<vector<int>> adjlist;
vector<vector<int>> revadjlist;

vector<int> aowns;
vector<int> charging;

vector<int> used; // 0 - eliminated, 1 - unvisited, 2 - in f
vector<int> awins;

void genSet(bool player){
	vector<int> numconnected(n,0);
	queue<int> q;
	for (int i = 0; i<n; i++){
		if (used[i]==2){
			q.push(i);
		}
		if (used[i]==0){
			for (int x : revadjlist[i]){
				numconnected[x]++;
			}
		}
	}
	while (q.size()>0){
		int f = q.front();
		q.pop();
		for (int i : revadjlist[f]){
			if (used[i]!=1){continue;}
			numconnected[i]++;
			bool stat = (player)?aowns[i]:(!aowns[i]);
			if (stat||((!stat)&&numconnected[i]==adjlist[i].size())){
				// i is in s
				used[i]=2;
				q.push(i);
			}
		}
	}
	/*for (int i : used){
		cout<<i<<' ';
	}cout<<'\n';*/
}

bool eliminate(){
	for (int i = 0; i<n; i++){
		if (used[i]!=0){
			used[i]=1;
		}
		if (charging[i]&&used[i]==1){
			used[i]=2;
		}
	}
	genSet(true);
	bool ahasall = true;
	for (int i = 0; i<n; i++){
		if (used[i]==1){
			used[i]=2;
			ahasall=false;
		} else if (used[i]==2){
			used[i]=1;
		}
	}
	/*for (int i : used){
		cout<<i<<' ';
	}cout<<'\n';*/
	if (ahasall){
		for (int i = 0; i<n; i++){
			if (used[i]==1){
				awins[i]=1;
			}
		}
		return true;
	}
	genSet(false);
	for (int i = 0; i<n; i++){
		if (used[i]==2){
			awins[i]=0;
			used[i]=0;
		}
	}
	return false;
}

std::vector<int> who_wins(std::vector<int> _aowns, std::vector<int> _charging, std::vector<int> u, std::vector<int> v) {
	aowns=_aowns;
	charging=_charging;
	n=aowns.size();
	m=u.size();
	//cout<<"blah"<<endl;
	//cout<<n<<endl;
	adjlist.resize(n);
	revadjlist.resize(n);
	for (int i = 0; i<m; i++){
		//cout<<u[i]<<' '<<v[i]<<endl;
		adjlist[u[i]].push_back(v[i]);
		revadjlist[v[i]].push_back(u[i]);
	}
	//cout<<"bleh"<<endl;
	awins.resize(n);
	used.resize(n,1);

	while (!eliminate()){
		continue;
	}

	return awins;
}

Compilation message

train.cpp: In function 'void genSet(bool)':
train.cpp:36:39: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |    if (stat||((!stat)&&numconnected[i]==adjlist[i].size())){

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1152 KB Output is correct
2 Correct 7 ms 1280 KB Output is correct
3 Correct 7 ms 1280 KB Output is correct
4 Correct 7 ms 1280 KB Output is correct
5 Correct 6 ms 1280 KB Output is correct
6 Correct 7 ms 1172 KB Output is correct
7 Correct 5 ms 1280 KB Output is correct
8 Correct 6 ms 1280 KB Output is correct
9 Correct 7 ms 1152 KB Output is correct
10 Correct 6 ms 1152 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 1 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 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 0 ms 384 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 384 KB Output is correct
16 Correct 1 ms 308 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 1 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 112 ms 1564 KB Output is correct
2 Correct 247 ms 1824 KB Output is correct
3 Correct 365 ms 1664 KB Output is correct
4 Correct 10 ms 1664 KB Output is correct
5 Correct 11 ms 1664 KB Output is correct
6 Correct 12 ms 1664 KB Output is correct
7 Correct 10 ms 1664 KB Output is correct
8 Correct 10 ms 1664 KB Output is correct
9 Correct 10 ms 1664 KB Output is correct
10 Correct 10 ms 1664 KB Output is correct
11 Correct 10 ms 1664 KB Output is correct
12 Correct 9 ms 1536 KB Output is correct
13 Correct 10 ms 1664 KB Output is correct
14 Correct 11 ms 1664 KB Output is correct
15 Correct 10 ms 1696 KB Output is correct
16 Correct 11 ms 1664 KB Output is correct
17 Correct 10 ms 1664 KB Output is correct
18 Correct 612 ms 1400 KB Output is correct

Subtask #4
11.0 / 11.0

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

Subtask #5
12.0 / 12.0

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

Subtask #6
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1152 KB Output is correct
2 Correct 7 ms 1280 KB Output is correct
3 Correct 7 ms 1280 KB Output is correct
4 Correct 7 ms 1280 KB Output is correct
5 Correct 6 ms 1280 KB Output is correct
6 Correct 7 ms 1172 KB Output is correct
7 Correct 5 ms 1280 KB Output is correct
8 Correct 6 ms 1280 KB Output is correct
9 Correct 7 ms 1152 KB Output is correct
10 Correct 6 ms 1152 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 1 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 1 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 0 ms 384 KB Output is correct
24 Correct 0 ms 256 KB Output is correct
25 Correct 0 ms 256 KB Output is correct
26 Correct 0 ms 384 KB Output is correct
27 Correct 1 ms 308 KB Output is correct
28 Correct 0 ms 384 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 0 ms 256 KB Output is correct
32 Correct 112 ms 1564 KB Output is correct
33 Correct 247 ms 1824 KB Output is correct
34 Correct 365 ms 1664 KB Output is correct
35 Correct 10 ms 1664 KB Output is correct
36 Correct 11 ms 1664 KB Output is correct
37 Correct 12 ms 1664 KB Output is correct
38 Correct 10 ms 1664 KB Output is correct
39 Correct 10 ms 1664 KB Output is correct
40 Correct 10 ms 1664 KB Output is correct
41 Correct 10 ms 1664 KB Output is correct
42 Correct 10 ms 1664 KB Output is correct
43 Correct 9 ms 1536 KB Output is correct
44 Correct 10 ms 1664 KB Output is correct
45 Correct 11 ms 1664 KB Output is correct
46 Correct 10 ms 1696 KB Output is correct
47 Correct 11 ms 1664 KB Output is correct
48 Correct 10 ms 1664 KB Output is correct
49 Correct 612 ms 1400 KB Output is correct
50 Correct 8 ms 1280 KB Output is correct
51 Correct 9 ms 1536 KB Output is correct
52 Correct 10 ms 1664 KB Output is correct
53 Correct 10 ms 1664 KB Output is correct
54 Correct 11 ms 1664 KB Output is correct
55 Correct 10 ms 1664 KB Output is correct
56 Correct 10 ms 1664 KB Output is correct
57 Correct 10 ms 1664 KB Output is correct
58 Correct 9 ms 1536 KB Output is correct
59 Correct 11 ms 1792 KB Output is correct
60 Correct 10 ms 1664 KB Output is correct
61 Correct 12 ms 1664 KB Output is correct
62 Correct 11 ms 1664 KB Output is correct
63 Correct 10 ms 1536 KB Output is correct
64 Correct 11 ms 1408 KB Output is correct
65 Correct 10 ms 1536 KB Output is correct
66 Correct 11 ms 1664 KB Output is correct
67 Correct 9 ms 1408 KB Output is correct
68 Correct 2 ms 384 KB Output is correct
69 Correct 5 ms 1152 KB Output is correct
70 Correct 6 ms 1024 KB Output is correct
71 Correct 7 ms 1024 KB Output is correct
72 Correct 8 ms 1024 KB Output is correct
73 Correct 2 ms 512 KB Output is correct
74 Correct 6 ms 1024 KB Output is correct
75 Correct 194 ms 1748 KB Output is correct
76 Correct 295 ms 1764 KB Output is correct
77 Correct 450 ms 1784 KB Output is correct
78 Correct 439 ms 1788 KB Output is correct
79 Correct 437 ms 1792 KB Output is correct
80 Correct 14 ms 1664 KB Output is correct
81 Correct 11 ms 1664 KB Output is correct
82 Correct 14 ms 1664 KB Output is correct
83 Correct 13 ms 1664 KB Output is correct
84 Correct 12 ms 1664 KB Output is correct
85 Correct 12 ms 1664 KB Output is correct
86 Correct 12 ms 1664 KB Output is correct
87 Correct 12 ms 1664 KB Output is correct
88 Correct 15 ms 1664 KB Output is correct
89 Correct 15 ms 1664 KB Output is correct
90 Correct 19 ms 1792 KB Output is correct
91 Correct 18 ms 1664 KB Output is correct
92 Correct 30 ms 1664 KB Output is correct
93 Correct 32 ms 1664 KB Output is correct
94 Correct 33 ms 1784 KB Output is correct
95 Correct 35 ms 1792 KB Output is correct
96 Correct 90 ms 1536 KB Output is correct
97 Correct 484 ms 1664 KB Output is correct
98 Correct 694 ms 1784 KB Output is correct
99 Correct 783 ms 1680 KB Output is correct
100 Correct 606 ms 1400 KB Output is correct