# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
821424 |
2023-08-11T10:01:05 Z |
Hanksburger |
Mars (APIO22_mars) |
C++17 |
|
0 ms |
0 KB |
#include "perm.h"
#include <bits/stdc++.h>
using namespace std;
long long prime[8]={2, 3, 5, 7, 11, 13, 17, 19};
vector<int> construct_permutation(long long k, long long PRIME)
{
for (long long u=0; u<=PRIME; u++)
{
long long v=prime[u];
if (k%v==0)
{
long long cnt=0;
while (k%v==0)
{
k/=v;
cnt++;
}
if (k==1)
{
vector<int> res;
for (long long i=0; i<cnt; i++)
for (long long j=v-2; j>=0; j--)
res.push_back(i*(v-1)+j);
return res;
}
vector<int> res=construct_permutation(k, PRIME);
int sz=res.size();
for (long long j=0; j<cnt; j++)
for (long long m=v-2; m>=0; m--)
res.push_back(j*(v-1)+m+sz);
return res;
}
}
for (long long i=2, m=1; ; i*=2, m++)
{
if (i<k && i*2>k)
{
vector<int> res=construct_permutation(k-i+1, PRIME);
for (long long j=0; j<res.size(); j++)
res[j]+=m;
for (long long j=0; j<m; j++)
res.push_back(j);
return res;
}
}
}
vector<int> construct_permutation(long long k)
{
vector<int> vec[8];
long long ind, mn=1e9;
for (long long i=0; i<8; i++)
{
vec[i]=construct_permutation(k, i);
if (mn>vec[i].size())
{
mn=vec[i].size();
ind=i;
}
}
return vec[ind];
}
Compilation message
mars.cpp:1:10: fatal error: perm.h: No such file or directory
1 | #include "perm.h"
| ^~~~~~~~
compilation terminated.