제출 #789584

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
789584		esomer	장난감 기차 (IOI17_train)	C++17	0 / 100	7 ms	1880 KiB

train

#include<bits/stdc++.h>
#include "train.h"

using namespace std;

typedef long long ll;

int DFS(int x, vector<vector<int>>& adj, vector<bool>& vis, vector<bool>& forced, vector<int>& A){
	if(forced[x] == 1) return 1;
	else if(vis[x] == 1) return 0;
	vis[x] = 1;
	int mn = 1;
	int mx = 0;
	for(int node : adj[x]){
		if(A[x] == 1) mn = min(mn, DFS(node, adj, vis, forced, A));
		else mx = max(mx, DFS(node, adj, vis, forced, A));
	}
	if(A[x] == 1){
		if(mn == 1) forced[x] = 1;
		else forced[x] = 0;	
		return mn;
	}else{
		if(mx == 1) forced[x] = 1;
		else forced[x] = 0;	
		return mx;
	}
}

vector<int> who_wins(vector<int> A, vector<int> R, vector<int> U, vector<int> V){
	int n = (int)A.size();
	int m = (int)U.size();
	vector<vector<int>> adj(n);
	vector<vector<int>> radj(n);
	vector<int> out(n, 0);
	for(int i = 0; i < m; i++){
		adj[U[i]].push_back(V[i]);
		if(R[U[i]] == 1) continue;
		out[U[i]]++;
		radj[V[i]].push_back(U[i]);
	}
	vector<bool> forced(n, 1); //If 1, then it can be forced by B into a cycle with no R's.
	queue<int> q;
	for(int i = 0; i < n; i++){
		if(out[i] == 0){
			forced[i] = 0;
			q.push(i);
		}
	}
	while(!q.empty()){
		int x = q.front(); q.pop();
		for(int node : radj[x]){
			out[node]--;
			if(out[node] == 0 && forced[node] == 1) {q.push(node); forced[node] = 0;}
			if(A[node] == 1 && forced[node] == 1){
				forced[node] = 0;
				q.push(node);
			}
		}
	}
	vector<bool> vis(n, 0);
	for(int i = 0; i < n; i++){
		if(!vis[i]){
			DFS(i, adj, vis, forced, A);
		}
	}
	vector<int> ans(n);
	for(int i = 0; i < n; i++){
		if(forced[i] == 1) ans[i] = 0;
		else ans[i] = 1;
	}
	return ans;
}

//~ int main() {
	
	//~ freopen("in.txt", "r", stdin);
	
	//~ int n, m;
	//~ assert(2 == scanf("%d %d", &n, &m));

	//~ vector<int> a(n), r(n), u(m), v(m);

	//~ for(int i = 0; i < n; i++)
		//~ assert(1 == scanf("%d", &a[i]));

	//~ for(int i = 0; i < n; i++)
		//~ assert(1 == scanf("%d", &r[i]));

	//~ for(int i = 0; i < m; i++)
		//~ assert(2 == scanf("%d %d", &u[i], &v[i]));

	//~ vector<int> res = who_wins(a, r, u, v);

	//~ for(int i = 0; i < (int)res.size(); i++)
		//~ printf(i ? " %d" : "%d", res[i]);
	//~ printf("\n");

	//~ return 0;
//~ }

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