# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
993916 | Lib | 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"
long long n;
vector <pair <int,int> > Alice(){
n=setN();
}
#include <bits/stdc++.h>
#include "Bob.h"
using namespace std;
int toggled[500];
long long Bob(vector <pair<int,int> > adj){
long long xorhash=463222221001217544,ta,tb;
for(int i=0;i<adj.size();i++){
ta=adj[i].first/34;
tb=adj[i].first/34;
if(ta==tb&&ta<=60){
toggled[ta]=1;
}
}
ans=0;
for(int i=0;i<=60;i++){
ans|=1 << i;
}
ans|=xorhash;
return ans;
}