# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1107973 | AlgorithmWarrior | Magic Show (APIO24_show) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "Alice.h"
using namespace std;
vector<pair<int,int>>Alice(){
long long x=long long 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;
}