제출 #775889

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

train

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

const int MAX_N = 5005;
const int MAX_M = 20005;

int N, M;
vector <int> graph[MAX_N];
int A[MAX_N], R[MAX_N];
bool visited[MAX_N];
bool self[MAX_N], nxt[MAX_N];

bool dfs(int u, int x, bool found, bool init = false) {
	// cout << x << " : " << u << ' ' << found << endl;
	if (u == x and init == true) return found;
	if (visited[u] == true) return false;

	init = true;
	visited[u] = true;
	if (R[u] == 1) found = true;
	for (auto v : graph[u]) if (dfs(v, x, found, true) == true) return true;
	return false;
}

vector <int> who_wins(vector <int> a, vector <int> r, vector <int> u, vector <int> v) {
	N = a.size(), M = u.size();
	for (int i = 0; i < N; i++) A[i] = a[i], R[i] = r[i];
	bool sub1 = true;
	for (int i = 0; i < M; i++) {
		if (u[i] != v[i] and u[i] != v[i] - 1) sub1 = false;
		if (u[i] == v[i]) self[u[i]] = true;
		else if (u[i] + 1 == v[i]) nxt[u[i]] = true;
		graph[u[i]].push_back(v[i]);
	}

	vector <int> ans(N, 0);
	if (sub1 == true) {
		bool ok = false;
		for (int i = N - 1; i >= 0; i--) {
			if (R[i] == 1 and ((A[i] == 1 and self[i] == true) or (A[i] == 0 and nxt[i] == false and self[i] == true))) ok = true;
			else if (R[i] == 0 and A[i] == 0 and self[i] == true) ok = false;

			ans[i] = ok;
		}
	}
	else {
		for (int s = 0; s < N; s++) {
			for (int i = 0; i < N; i++) visited[i] = false;
			ans[s] = dfs(s, s, false);
		}
	}
	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