Submission #669544

#	Time	Username	Problem	Language	Result	Execution time	Memory
669544		someone	Toy Train (IOI17_train)	C++14	0 / 100	7 ms	1876 KiB

train

#include "train.h"
#include <bits/stdc++.h>
using namespace std;
 
const int N = 10 + 42, INF = 1e9;
 
int n, m, dp[N*N][N];
vector<int> adj[N], ans;
 
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++)
        adj[u[i]].push_back(v[i]);
    
    for(int i = 0; i < n*n+42; i++) {
        for(int j = 0; j < n; j++) {
            dp[i+1][j] = dp[i][j];
            if(a[j]) {
                for(int k : adj[j])
                    dp[i+1][j] = max(dp[i+1][j], dp[i][k]);
            } else {
                for(int k : adj[j])
                    dp[i+1][j] = min(dp[i+1][j], dp[i][k]);
            }
            if(r[j])
                dp[i+1][j]++;
	    }
	}
	
	for(int j = 0; j < n; j++)
	    ans.push_back((dp[n*n+42][j] > n));
	
	return ans;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 11
• Subtask 4: 0 / 11
• Subtask 5: 0 / 12
• Subtask 6: 0 / 51