Submission #1107974

#TimeUsernameProblemLanguageResultExecution timeMemory
1107974AlgorithmWarrior마술쇼 (APIO24_show)C++17
0 / 100
2 ms784 KiB
#include <bits/stdc++.h> #include "Alice.h" using namespace std; vector<pair<int,int>>Alice(){ long long x=setN(3602); vector<pair<int,int>>tree; tree.push_back({1,2}); int i,j; for(i=0;i<60;++i){ int bit=(x&(1<<i)); for(j=0;j<60;++j){ tree.push_back({bit+1,3+i*60+j}); } } return tree; }
#include <bits/stdc++.h> #include "Bob.h" using namespace std; long long Bob(vector<pair<int,int>> V){ long long x=0; for(auto edge : V){ if(edge.first==2){ x|=(1<<((edge.second-3)/60)); } } return x; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...