| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 993931 | 2024-06-06T20:55:21 Z | Lib | Magic Show (APIO24_show) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h>
#include "Alice.h"
using namespace std;
int toggled[500];
int perm1[10000];
int perm2[10000];
int perm3[10000];
long long x;
long long len=4801;
set <int> rem;
vector <pair<int,int> > TVector;
vector <vector<int> > inGroup;
vector <int> nums;
vector<pair <int,int>> Alice(){
setN(x);
x^=463222221001217544;
int toggledcnt=0;
inGroup.clear();
TVector.clear();
for(int i=1;i<=200;i++){
inGroup.push_back(nums);
}
for(int i=0;i<=60;i++){
if(x >> i & 1){
toggled[i]=1;
toggledcnt++;
}
}
for(int i=1;i<=4801;i++){
perm1[i]=-1;
rem.insert(i);
inGroup[(i-1)/34].push_back(i);
}
//initialize the 1st perm;
for(int i=0;i<=60;i++){
if(toggled[i]){
for(int k=1;k<=17;k++){
perm1[i*17+k]=i;
}
for(int k=1;k<=34;k++){
rem.erase(i*34+k);
}
}
}
srand(123190);
for(int i=1;i<=len-1-toggledcnt*17;i++){
swap(perm1[i],perm1[rand()%(len-i-toggledcnt*17)+i]);
}
int cur=1,cur2=1,cur3=1;
for(int i=1;i<=4801;i++){
if(rem.count(i)){
perm3[cur]=i;
cur++;
}
}
int ta,tb;
for(int i=0;i<=60;i++){
for(int k=1;k<=500;k++){
ta=rand()%34;
tb=rand()%34;
swap(inGroup[i][ta],inGroup[i][tb]);
}
}
cur--;
for(int i=1;i<cur;i++){
swap(perm3[i],perm3[rand()%(cur-i)+i+1]);
}
cur=1;
for(int i=1;i<=len-toggledcnt*17;i++){
if(perm1[i]>-1){
perm2[cur]=inGroup[perm1[i]].back();
inGroup[perm1[i]].pop_back();
perm2[cur]=inGroup[perm1[i]].back();
inGroup[perm1[i]].pop_back();
cur+=2;
}else{
perm2[cur]=perm3[cur2];
cur2++;
cur++;
}
}
for(int i=1;i<=4800;i++){
TVector.push_back({perm2[i],perm2[i+1]});
}
return TVector;
}