Submission #1239216

#TimeUsernameProblemLanguageResultExecution timeMemory
1239216moondarksideToy Train (IOI17_train)C++20
11 / 100
242 ms1180 KiB
#include<bits/stdc++.h> using namespace std; std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v) { std::vector<int> rC=r; vector<vector<int>> Next(a.size()); int n=a.size(); for(int i=0; i<u.size(); i++) { Next[u[i]].push_back(v[i]); } for(int ronda=0; ronda<n; ronda++) { for(int i=0; i<n; i++) { if(rC[i]!=1) { if(a[i]==1) { for(int j=0; j<Next[i].size(); j++) { if(rC[Next[i][j]]==1) { rC[i]=1; } } } else { int ns=1; for(int j=0; j<Next[i].size(); j++) { ns=ns*rC[Next[i][j]]; } rC[i]=ns; } } } } for(int ronda=0; ronda<n; ronda++) { for(int i=0; i<n; i++) { if(rC[i]==1) { if(a[i]==0) { for(int j=0; j<Next[i].size(); j++) { if(rC[Next[i][j]]==0) { rC[i]=0; } } } else { int ns=1; for(int j=0; j<Next[i].size(); j++) { ns=ns*(1-rC[Next[i][j]]); } rC[i]=1-ns; } } } } vector<int> Sol; for(int i=0;i<n;i++){ Sol.push_back(rC[i]); } return Sol; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...