제출 #1181021

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1181021		HappyCapybara	장난감 기차 (IOI17_train)	C++20	5 / 100	13 ms	1236 KiB

train

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

int n, m;
vector<vector<int>> g;
vector<int> a, r, w;

bool find_cycle(int s){
	vector<bool> seen(n, false);
	queue<int> q;
	q.push(s);
	while (!q.empty()){
		int cur = q.front();
		q.pop();
		if (seen[cur]) continue;
		seen[cur] = true;
		for (int next : g[cur]){
			if (next == s) return true;
			q.push(next);
		}
	}
	return false;
}

bool win(int s){
	/*vector<bool> seen(n, false);
	queue<int> q;
	q.push(s);
	while (!q.empty()){
		int cur = q.front();
		q.pop();
		if (seen[cur]) continue;
		seen[cur] = true;
		for (int next : g[cur]){
			if (w[next]) return true;
			q.push(next);
		}
	}
	return false;*/
	while (true){
		if (g[s].size() == 1){
			if (g[s][0] == s) return r[s];
			s++;
			continue;
		}
		if (r[s] && a[s]) return true;
		if (!r[s] && !a[s]) return false;
		s++;
	}
}

vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v){
	n = a.size();
	m = u.size();
	::r = r;
	::a = a;
	vector<int> res(n);
	g.resize(n);
	for (int i=0; i<m; i++) g[u[i]].push_back(v[i]);
	w.resize(n, false);
	/*for (int i = 0; i<n; i++){
		if (r[i]) w[i] = find_cycle(i);
	}*/
	for (int i=0; i<n; i++) res[i] = win(i);
	return res;
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 11
• Subtask 4: 0 / 11
• Subtask 5: 0 / 12
• Subtask 6: 0 / 51