제출 #593800

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

train

#include "train.h"
#include <bits/stdc++.h>
#define N 5005
using namespace std;
int path[N][N];
bool edge[N][N];
int path2[N][N];
bool special[N];
vector<int> adj[N];
vector<int> adj2[N];
void dfs(int v,int num){
	path[num][v] = 1;
	for(auto u:adj[v]){
		if(!path[num][u]){
			dfs(u,num);
		}
	}
}
void dfs2(int v,int num){
	path2[num][v] = 1;
	for(auto u:adj2[v]){
		if(!path2[num][u]){
			dfs2(u,num);
		}
	}
}
vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
	int n = a.size();
	int m = u.size();
	for(int i=0;i<m;i++){
		edge[u[i]][v[i]] = 1;
		adj[u[i]].push_back(v[i]);
	}
	for(int i = 0;i<n;i++){
		dfs(i,i);
	}
	vector<int> res(n);
	for(int i = 0; i < n; i++){
		int num = i;
		while(1){
			if(a[num]){
				if(edge[num][num] && r[num]){
					res[num] = 1;
					break;
				}
				if(!edge[num][num+1]){
					res[num] = 0;
					break;
				}
				num = num+1;
			}
			else{
				if(edge[num][num] && !r[num]){
					res[num] = 0;
					break;
				}
				if(!edge[num][num+1]){
					res[num] = 1;
					break;
				}
				num = num+1;
			}
		}
	}
	return res;
}

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