oj.uz

Submission #775889

# Submission time Handle Problem Language Result Execution time Memory
775889 2023-07-07T06:06:52 Z Jomnoi Toy Train (IOI17_train) C++17
0 / 100
 411 ms 1520 KB 
#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.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 852 KB Output is correct
2 Correct 3 ms 852 KB Output is correct
3 Correct 3 ms 852 KB Output is correct
4 Incorrect 3 ms 852 KB 3rd lines differ - on the 1462nd token, expected: '0', found: '1'
5 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB 3rd lines differ - on the 8th token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 1520 KB Output is correct
2 Correct 123 ms 1492 KB Output is correct
3 Correct 116 ms 1464 KB Output is correct
4 Incorrect 334 ms 1420 KB 3rd lines differ - on the 13th token, expected: '1', found: '0'
5 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 309 ms 1216 KB 3rd lines differ - on the 1st token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 411 ms 1516 KB 3rd lines differ - on the 6th token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 852 KB Output is correct
2 Correct 3 ms 852 KB Output is correct
3 Correct 3 ms 852 KB Output is correct
4 Incorrect 3 ms 852 KB 3rd lines differ - on the 1462nd token, expected: '0', found: '1'
5 Halted 0 ms 0 KB -