Submission #916128

#TimeUsernameProblemLanguageResultExecution timeMemory
916128AbitoAmusement Park (JOI17_amusement_park)C++14
8 / 100
20 ms5068 KiB
#include "Joi.h" #include <bits/stdc++.h> using namespace std; void Joi(int N, int M, int A[], int B[], long long X, int T) { for (int i=0;i<N;i++) MessageBoard(i,bool(X&(1LL<<(i%60)))); return; }
#include "Ioi.h" #include <bits/stdc++.h> #define pb push_back using namespace std; const int NN=1e4+5; vector<int> adj[NN]; int n,m; long long X=0; bool vis[NN]; void dfs(int node,int p){ vis[node]=true; for (auto u:adj[node]){ if (vis[u]) continue; int y=Move(u); if (y) X|=(1LL<<(u%60)); dfs(u,node); } if (p!=-1){ int y=Move(p); if (y) X|=(1LL<<(p%60)); } return; } long long Ioi(int N, int M, int A[], int B[], int P, int V, int T) { n=N,m=M; for (int i=0;i<m;i++){ adj[A[i]].pb(B[i]); adj[B[i]].pb(A[i]); } if (V) X|=(1LL<<(P%60)); dfs(P,-1); for (int i=0;i<m;i++) adj[i].clear(); return X; }
#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...