Submission #1037525

#TimeUsernameProblemLanguageResultExecution timeMemory
1037525thinknoexitToy Train (IOI17_train)C++17
5 / 100
4 ms1372 KiB
#include "train.h" #include <bits/stdc++.h> using namespace std; using ll = long long; const int N = 5050; vector<int> adj[N]; int n, m; 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]); } vector<int> ans(n); ans[n - 1] = r[n - 1]; for (int i = n - 2;i >= 0;i--) { if (a[i] == 0) { // Borzou bool ch = 0; for (auto& x : adj[i]) { if (x == i && !r[i]) ch = 1; else if (x != i && !ans[x]) ch = 1; } ans[i] = ch ^ 1; } else { // Arezou bool ch = 0; for (auto& x : adj[i]) { if (x == i && r[i]) ch = 1; else if (x != i && ans[x]) ch = 1; } ans[i] = ch; } } return ans; } /* 4 5 1 0 1 1 0 0 0 1 0 1 1 1 1 2 2 3 3 3 */
#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...