Submission #1290695

#TimeUsernameProblemLanguageResultExecution timeMemory
1290695turral장난감 기차 (IOI17_train)C++20
0 / 100
5 ms1088 KiB
//#include "train.h" #include <iostream> #include <vector> using namespace std; int DFS_wins(int u, vector<vector<int> > & G, vector<int> & wins, vector<int> & a){ if (wins[u] != -1) return wins[u]; wins[u] = 0; int res = a[u] ^ 1; for (int v : G[u]){ if (a[u]){ res |= DFS_wins(v, G, wins, a); } else { res &= DFS_wins(v, G, wins, a); } } return res; } vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v){ int N = a.size(), M = u.size(); // 1 -> the battery person has it vector<vector<int> > G(N); for (int i=0; i<M; ++i){ G[u[i]].push_back(v[i]); } vector<int> wins(N, -1); // -1 idk, 0 no, 1 yea; // win = battery () for (int i=0; i<N; ++i) { if (r[i] == 1) wins[i] = 1; } for (int i=0; i<N; ++i){ wins[i] = DFS_wins(i, G, wins, a); } return wins; }
#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...