제출 #812734

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

train

#include "train.h"
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) begin(a),end(a)
const int mxN = (int)20;
vi adj[mxN], v, a, r;
int vis[mxN];

bool recur(int s){
	vis[s]=1; v.pb(s);
	bool ok = 1;
	for(auto u : adj[s]){
		if(!vis[u]){
			if(a[s]){
				if(recur(u)) return 1;
				ok = 0;
			}
			else ok&=recur(u);
		}
		else if(vis[u]==1){
			int good = 0, pos = sz(v)-1;
			while(pos>=0){
				if(r[v[pos]]) good=1;
				if(v[pos]==u) break; 
				pos--; 
			}
			if(good and a[s]) return 1;
			if(!good and !a[s]) return 0;
		}
	}
	vis[s]=2; v.pop_back(); return ok;
}

vi who_wins(vi A, vi R, vi U, vi V) {
	int n = sz(A), m = sz(U); vi ans(n,0);
	for(int i = 0; i < n; i++) a[i]=A[i],r[i]=R[i];
	for(int i = 0; i < m; i++) adj[U[i]].pb(V[i]);
	for(int i = 0; i < n; i++) sort(all(adj[i]));
 	for(int i = 0; i < n; i++)
		ans[i] = recur(i),memset(vis,0,sizeof(vis));
	return ans;
}

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