Submission #291000

#TimeUsernameProblemLanguageResultExecution timeMemory
291000SaboonToy Train (IOI17_train)C++17
5 / 100
9 ms896 KiB
// Subtask 1 #include "train.h" #include <bits/stdc++.h> using namespace std; const int maxn = 5000 + 10; int n, m; bool loop[maxn], go[maxn]; 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++){ if (v[i] == u[i]) loop[u[i]] = true; else go[u[i]] = true; } vector<int> dp(n); for (int i = n-1; i >= 0; i--){ if (loop[i] == 0){ dp[i] = dp[i+1]; continue; } if (go[i] == 0){ dp[i] = r[i]; continue; } if (a[i] == 0){ if (r[i]) dp[i] = dp[i+1]; else dp[i] = 0; } else{ if (r[i]) dp[i] = 1; else dp[i] = dp[i+1]; } } return dp; }
#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...