# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
33761 | mohammad_kilani | Toy Train (IOI17_train) | C++14 | 2000 ms | 8688 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "train.h"
using namespace std;
const int N = 5010;
bitset < N > win[N] , win2[N];
std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v) {
vector<int> ans;
int n = a.size();
for(int i=0;i<n;i++) win[i][0] = r[i] ;
for(int j=1;j<=n;j++){
for(int i=0;i<n;i++) if(r[i]) win[i][j] = 1; else win[i][j] = a[i] ^ 1;
for(int i=0;i<u.size();i++){
int o = u[i];
int t = v[i];
if(r[o]) continue;
if(a[o]){
if(win[t][j-1]) win[o][j] = 1;
}
else{
if(win[t][j-1] == 0) win[o][j] = 0;
}
}
}
for(int i=0;i<n;i++) win2[i][0] = win[i][n];
//for(int i=0;i<n;i++) if(win[i][n] == 0) win2[i][0] = 0; else win2[i][0] = a[i] ^ 1;
for(int j=1;j<=n;j++){
for(int i=0;i<n;i++) if(win[i][n] == 0) win2[i][j] = 0; else win2[i][j] = a[i] ^ 1;
for(int i=0;i<u.size();i++){
int o = u[i];
int t = v[i];
if(a[o]){
if(win2[t][j-1]) win2[o][j] = 1;
}
else{
if(win2[t][j-1] == 0) win2[o][j] = 0;
}
}
}
for(int i=0;i<n;i++) ans.push_back(win2[i][n]);
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |