oj.uz

Submission #243161

# Submission time Handle Problem Language Result Execution time Memory
243161 2020-06-30T12:59:53 Z crossing0ver Toy Train (IOI17_train) C++17
5 / 100
 1307 ms 1680 KB 
#include<bits/stdc++.h>
#define vi vector<int>
#define pb push_back
//#include "train.h"
using namespace std;
int n,m;
vi X,Y,good,who,adj[5009];

vi CASE1() {
	vi ans(n);
	for (int i = n-1; i >= 0; i--) {
		bool flag = 0;
		for (int j : adj[i]) {
			if (j == i && who[i] == good[i]) {
				ans[i] = who[i];
				flag = 1;
				break;
			}
			if (who[i] == ans[j] && j != i) {
				flag = 1;
				ans[i] = ans[j];
				break;
			}
		}
		if (flag == 0) ans[i] = (!who[i]);
	}
	return ans;
}
vector<int> vis(5005),P(5005),G(5005),depth(5005);
bool dfs(int v) {
	vis[v] = 1;
	if (good[v]) G[v] = v;
		else if (P[v] != -1)G[v] = G[P[v]];
		else G[v] = -1;
		
	bool ans = 0;
	for (int i : adj[v]) {
		if (vis[i]) {
			if (G[v] != -1 && depth[G[v]] >= depth[i]) 
				ans = 1;
			}
		else {depth[i] = depth[v] + 1; P[i] = v;ans |= dfs(i);}
	}    
	return ans;
}
vi CASE2() {
	vi ans(n);//,vis(n),P(n),G(n),depth(n);
	for (int i = 0; i < n; i++) {
		P[i] = -1;
		ans[i] = dfs(i);
		for (int i = 0 ; i < n; i++) {
			P[i] = G[i] = vis[i] = depth[i] = 0;
		}
	/*	fill(P.begin(),P.end(),0);
		fill(G.begin(),G.end(),0);
		fill(vis.begin(),vis.end(),0);
		fill(depth.begin(),depth.end(),0);*/
	}
	return ans;
}
vi who_wins(vi a1, vi r, vi st, vi en) {
	n = a1.size(), m = st.size();
	X = st; Y = en;
	for (int i = 0; i < m; i++)
		adj[X[i]].pb(Y[i]);
	good = r;
	who = a1;
	bool case1 = 1,case2 = 1;
	for (int i = 0; i < m; i++) {
		if (X[i] != Y[i] && X[i]+1 != Y[i])
			case1 = 0;
	}
	for (int i = 0;i < n; i++)
		if (who[i] == 0) case2 = 0;
	if (case1) return CASE1();
	if (case2) return CASE2();	
//	return res;
	return vector<int>();
}
/*
main() {
	cin >> n >> m;
	vi r(n),a1(n),st(m),en(m);
	for (int i = 0; i < n; i++) 
		cin >> a1[i];
	for (int i = 0; i < n ;i++)
		cin >> r[i];
	for (int i = 0; i < m ;i++) {
		int x,y;
		cin >> st[i] >> en[i];
	}
	vi ans = who_wins(a1,r,st,en);
	for (int i :ans) cout << i <<' ';
}*/

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 1024 KB Output is correct
2 Correct 8 ms 1024 KB Output is correct
3 Correct 9 ms 928 KB Output is correct
4 Correct 9 ms 1024 KB Output is correct
5 Correct 9 ms 896 KB Output is correct
6 Correct 8 ms 1024 KB Output is correct
7 Correct 9 ms 1024 KB Output is correct
8 Correct 9 ms 1024 KB Output is correct
9 Correct 10 ms 1024 KB Output is correct
10 Correct 8 ms 896 KB Output is correct
11 Correct 8 ms 896 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 512 KB WA in grader: Wrong returned array size
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 269 ms 1680 KB Output is correct
2 Correct 277 ms 1656 KB Output is correct
3 Correct 267 ms 1536 KB Output is correct
4 Correct 1307 ms 1656 KB Output is correct
5 Incorrect 932 ms 1560 KB 3rd lines differ - on the 11th token, expected: '0', found: '1'
6 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 1152 KB WA in grader: Wrong returned array size
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 19 ms 1280 KB WA in grader: Wrong returned array size
2 Halted 0 ms 0 KB -

Subtask #6
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 1024 KB Output is correct
2 Correct 8 ms 1024 KB Output is correct
3 Correct 9 ms 928 KB Output is correct
4 Correct 9 ms 1024 KB Output is correct
5 Correct 9 ms 896 KB Output is correct
6 Correct 8 ms 1024 KB Output is correct
7 Correct 9 ms 1024 KB Output is correct
8 Correct 9 ms 1024 KB Output is correct
9 Correct 10 ms 1024 KB Output is correct
10 Correct 8 ms 896 KB Output is correct
11 Correct 8 ms 896 KB Output is correct
12 Incorrect 5 ms 512 KB WA in grader: Wrong returned array size
13 Halted 0 ms 0 KB -