Submission #37582

#TimeUsernameProblemLanguageResultExecution timeMemory
37582grumpy_gordonAmusement Park (JOI17_amusement_park)C++14
18 / 100
46 ms8140 KiB
#include <bits/stdc++.h> #include "Joi.h" using namespace std; void Joi(int N, int M, int A[], int B[], long long X, int T){ for (int i = 0; i < 60; i++) if ((1ll << i) & X) MessageBoard(i, 1); else MessageBoard(i, 0); for (int i = 60; i < N; i++) MessageBoard(i, 0); }
#include <bits/stdc++.h> #include "Ioi.h" using namespace std; const int maxn = 1e5 + 100; int a[maxn]; vector<int> e[maxn]; bool vis[maxn]; void dfs(int v, int val){ vis[v] = 1; a[v] = val; for (auto i : e[v]) if (!vis[i]){ dfs(i, Move(i)); Move(v); } } long long Ioi(int N, int M, int A[], int B[], int P, int V, int T){ for (int i = 0; i < M; i++) e[A[i]].push_back(B[i]), e[B[i]].push_back(A[i]); dfs(P, V); long long ret = 0; for (int i = 0; i < 60; i++) ret += (1ll << i) * a[i]; return ret; }
#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...