제출 #1198648

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1198648		dosts	Toy Train (IOI17_train)	C++20	11 / 100	1635 ms	1936 KiB

train

#include "train.h"
#include <bits/stdc++.h>
#define int long long
#define pii pair<int,int> 
#define vi vector<int>
#define ff first
#define ss second
#define sp << " " << 
#define all(x) x.begin(),x.end()
using namespace std;
vi ans,go,chk;
vector<vi> edges,egdes;

void dfs(int node) {
	for (auto it : egdes[node]) {
		if (ans[it]) continue;
		ans[it] = 1;
		dfs(it);
	}
}

int fl;

void dfs2(int node) {
	for (auto it : edges[node]) {
		if (go[it]) continue;
		go[it] = 1;
		dfs2(it);
	}
}

std::vector<int32_t> who_wins(std::vector<int32_t> a, std::vector<int32_t> r, std::vector<int32_t> u, std::vector<int32_t> v) {
	int n = a.size();
	std::vector<int32_t> res(n,0);
	ans.assign(n,0);
	go.assign(n,0);
	edges.resize(n);
	egdes.resize(n);
	int m = u.size();
	for (int i = 0;i<m;i++) {
		edges[u[i]].push_back(v[i]);
		egdes[v[i]].push_back(u[i]);
	}
	for (int i = 0;i<n;i++) {
		if (r[i]) {
			ans.assign(n,0);
			go.assign(n,0);
			dfs(i),dfs2(i);
			if (!go[i]) continue;
	    	for (int j = 0;j<n;j++) if (ans[j]) res[j] = 1;
		}
	}
	return res;
}

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