Submission #406959

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
406959	2021-05-18T09:17:44 Z	Kevin_Zhang_TW	Toy Train (IOI17_train)	C++17	10 / 100	9 ms	1228 KB

train

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l)==r], ++l; }
#else
#define DE(...) 0
#define debug(...) 0
#endif
 
const int MAX_N = 5005;
 
#include "train.h"
 
int dp[MAX_N], w[MAX_N], sum[MAX_N], inst[MAX_N], n;
 
int belong[MAX_N];
vector<int> edge[MAX_N];
 
bool dfs(int x, int s, int v = 0) {
	static vector<int> stk;
	if (dp[x] != -1) return dp[x] == s;
 
	stk.pb(x);
	inst[x] = true;
	v += w[x];
	sum[x] = v;
	bool ret = true;
 
	// A owns it
	if (belong[x] == 1) {
		dp[x] = 0;
		for (int u : edge[x]) {
			if (inst[u]) {
				if (w[u] || sum[x] != sum[u]) {
					dp[x] = 1;
					break;
				}
				continue;
			}
			if (dfs(u, 1, v)) {
				dp[x] = 1;
				break;
			}
		}
	}
	else {
		dp[x] = 1;
		for (int u : edge[x]) {
			if (inst[u]) {
				if (w[u] == 0 && sum[x] == sum[u]) {
					dp[x] = 0;
					break;
				}
				continue;
			}
			if (dfs(u, 0, v)) {
				dp[x] = 0;
				break;
			}
		}
	}
	
	ret = dp[x] == s;

	stk.pop_back();

	inst[x] = false;
	dp[x] = -1;
 
	return ret;
}
 
std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v) {
	n = a.size();
	for (int i = 0;i < n;++i) {
		w[i] = r[i];
		belong[i] = a[i];
	}
	for (int i = 0;i < u.size();++i) {
		edge[ u[i] ].pb( v[i] );
	}
 
	vector<int> res(n);
	for (int i = 0;i < n;++i) {
		if (n <= 15) memset(dp, -1, sizeof(dp));
		res[i] = dfs(i, 1);
	}
 
	return res;
}

Compilation message

train.cpp: In function 'std::vector<int> who_wins(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
train.cpp:87:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   87 |  for (int i = 0;i < u.size();++i) {
      |                 ~~^~~~~~~~~~

Subtask #1
0 / 5.0

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

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct

Subtask #3
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	9 ms	1100 KB	Output is correct
2	Correct	7 ms	1196 KB	Output is correct
3	Correct	7 ms	1228 KB	Output is correct
4	Incorrect	8 ms	1228 KB	3rd lines differ - on the 1st token, expected: '1', found: '0'
5	Halted	0 ms	0 KB	-