oj.uz

Submission #39111

# Submission time Handle Problem Language Result Execution time Memory
39111 2018-01-09T11:02:45 Z mohammad_kilani Toy Train (IOI17_train) C++14
0 / 100
 2000 ms 8552 KB 
#include "train.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 5010;
bitset < N > win[2][N];
int n , m;

std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v) {
	n = a.size();
	m = u.size();
	vector<int> res;
	for(int i=0;i<n;i++) win[0][0][i] = r[i];
	for(int i=1;i<=n;i++){
		for(int j=0;j<n;j++) win[0][i][j] = (r[j] == 1 ? 1 : (a[j] ^ 1));
		for(int j=0;j<m;j++){
			if(r[u[j]]) continue;
			if(a[u[j]]){
				if(win[0][i-1][v[j]] == 1) win[0][i][u[j]] = 1;
			}
			else{
				if(win[0][i-1][v[j]] == 0) win[0][i][u[j]] = 0;	
			}
		}
	}
	for(int i=0;i<n;i++) win[1][0][i] = win[0][n][i];
	for(int i=1;i<=m;i++){
		for(int j=0;j<n;j++) win[1][i][j] = (win[0][n][j] == 0 ? 0 : a[j] ^ 1);
		for(int j=0;j<m;j++){
			if(a[u[j]]){
				if(win[1][i-1][v[j]] == 1) win[1][i][u[j]] = 1;
			}
			else{
				if(win[1][i-1][v[j]] == 0) win[1][i][u[j]] = 0;	
			}
		}
	}
	for(int i=0;i<n;i++) res.push_back(win[1][m][i]);
	return res;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 993 ms 8344 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

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

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Runtime error 786 ms 8552 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Runtime error 433 ms 8552 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2000 ms 8552 KB Execution timed out
2 Halted 0 ms 0 KB -

Subtask #6
0 / 51.0

# Verdict Execution time Memory Grader output
1 Runtime error 993 ms 8344 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -