oj.uz

Submission #593943

# Submission time Handle Problem Language Result Execution time Memory
593943 2022-07-11T17:50:04 Z FatihSolak Toy Train (IOI17_train) C++17
0 / 100
 2000 ms 24916 KB 
#include "train.h"
#include <bits/stdc++.h>
#define N 5005
using namespace std;
int dp[N];
int ndp[N];
bool edge[N][N];
vector<int> adj[N];
vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
	int n = a.size();
	int m = u.size();
	for(int i = 0;i<m;i++){
		edge[u[i]][v[i]] = 1;
		adj[u[i]].push_back(v[i]);
	}
	for(int i = 0;i<n;i++){
		if(a[i] == 0 && r[i] == 0 && edge[i][i]){
			dp[i] = -1e9;
		}
		if(r[i])
			dp[i] = n;
	}
	cout << endl;
	for(int i=0;i<10*n;i++){
		for(int j = 0;j<n;j++){
			if(a[j]){
				ndp[j] = -1e9;
				for(auto u:adj[j]){
					ndp[j] = max(ndp[j],dp[u] + r[j]*n - 1);
				}
				ndp[j] = min(ndp[j],3*n);
			}
			else{
				ndp[j] = 1e9;
				for(auto u:adj[j]){
					ndp[j] = min(ndp[j],dp[u] + r[j]*n - 1);
				}
				ndp[j] = min(ndp[j],3*n);
			}
		}
		for(int j = 0;j<n;j++){
			dp[j] = ndp[j];
			//cout << dp[j] << " ";
		}
		//cout << endl;
	}
	vector<int> res(n);
	for(int i = 0; i < n; i++){
		res[i] = (dp[i] >= -n);
	}
	return res;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1541 ms 20916 KB secret mismatch
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 468 KB secret mismatch
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2073 ms 20488 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2054 ms 24276 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2086 ms 24916 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 51.0

# Verdict Execution time Memory Grader output
1 Incorrect 1541 ms 20916 KB secret mismatch
2 Halted 0 ms 0 KB -