Submission #41782

#TimeUsernameProblemLanguageResultExecution timeMemory
41782cmasterAmusement Park (JOI17_amusement_park)C++14
18 / 100
41 ms13808 KiB
#include <bits/stdc++.h> #include "Joi.h" using namespace std; static const int MAXN2 = (int)2e5+228; static int val2[MAXN2], used2[MAXN2]; static vector < int > g2[MAXN2]; static long long tmp, XX; void Joi(int n, int m, int A[], int B[], long long X, int T) { for(int i = 0; i < n; i++){ val2[i] = -1; used2[i] = 0; g2[i].clear(); } for(int i = 0; i < m; ++i) { g2[A[i]].push_back(B[i]); g2[B[i]].push_back(A[i]); } XX = X; for(int i = 0; i < 60; ++i) MessageBoard(i, (bool)((1ll<<i*1ll)&X)); for(int i = 60; i < n; ++i) MessageBoard(i, 0); }
#include "Ioi.h" #include <bits/stdc++.h> using namespace std; static const int MAXN1 = (int)2e5+228; static bool used1[MAXN1]; static vector < int > g1[MAXN1]; static int val1[MAXN1]; static long long ret = 0ll; void dfs1(int v) { used1[v] = 1; for(auto &to : g1[v]) { if(!used1[to]) { val1[to] = Move(to); dfs1(to); Move(v); } } } long long Ioi(int n, int m, int A[], int B[], int P, int V, int T) { for(int i = 0; i < n; ++i) { used1[i] = 0; val1[i] = -1; g1[i].clear(); } val1[P] = V; for(int i = 0; i < m; ++i) { g1[A[i]].push_back(B[i]); g1[B[i]].push_back(A[i]); } ret = 0ll; dfs1(P); for(int i = 0; i < 60; ++i) ret |= ((1ll << i*1ll)*val1[i]); return ret; }

Compilation message (stderr)

Joi.cpp:7:18: warning: 'tmp' defined but not used [-Wunused-variable]
 static long long tmp, XX;
                  ^
#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...