Submission #790025

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
790025	2023-07-22T09:25:14 Z	NothingXD	Toy Train (IOI17_train)	C++17	0 / 100	1180 ms	1672 KB

train

#include "train.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef complex<ld> point;

void debug_out(){cerr << endl;}

template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T){
	cerr << H << ' ';
	debug_out(T...);
}

#define debug(...) cerr << "(" << #__VA_ARGS__ << "): ", debug_out(__VA_ARGS__)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define MP(x, y) make_pair(x, y)

const int maxn = 1e4 + 10;

int n, m, h[maxn];
vector<pair<pii,int>> edge;
vector<int> g[maxn];
bool vis[maxn];

void dfs(int v){
	//debug(v);
	vis[v] = true;
	for (auto u: g[v]){
		if (!vis[u]) dfs(u);
	}
}

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 < m; i++){
		v[i] += n;
		edge.push_back({{u[i], v[i]}, 1});
		//debug(u[i], v[i], 1);
		v[i] -= n;
		g[v[i]].push_back(u[i]);
	}
	for (int i = 0; i < n; i++){
		if (r[i]){
			edge.push_back({{i+n, i}, -n});
			//debug(i, i+n, -n-1);
		}
		else{
			edge.push_back({{i+n, i}, 0});
			//debug(i, i+n, 0);
		}
	}
	for (int i = 1; i <= 4*n; i++){
		for (auto x: edge){
			if (i < 2*n) h[x.F.S] = min(h[x.F.S], h[x.F.F] + x.S);
			else if (h[x.F.S] > h[x.F.F] + x.S){
				if (x.F.S >= n) x.F.S -= n;
				if (!vis[x.S]) dfs(x.S);
			}
		}
	}
	vector<int> ans(n);
	for (int i = 0; i < n; i++){
		ans[i] = vis[i];
	}
	return ans;
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	468 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	765 ms	1520 KB	Output is correct
2	Correct	775 ms	1520 KB	Output is correct
3	Correct	743 ms	1516 KB	Output is correct
4	Correct	1180 ms	1544 KB	Output is correct
5	Correct	665 ms	1652 KB	Output is correct
6	Incorrect	712 ms	1672 KB	3rd lines differ - on the 2nd token, expected: '0', found: '1'
7	Halted	0 ms	0 KB	-