이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
using namespace std;
bool used[265000];
int rez[265000];
int n,k,t,s;
bool dif[20];
void afis01(int x)
{
for(int i=n-1;i>=0;i--)
{
if(((1<<i)&x))
cout<<1;
else
cout<<0;
}
cout<<"\n";
}
signed main()
{
ios_base::sync_with_stdio(0);cin.tie(0);
cin>>n>>k>>t>>s;
if(k%2==0)
{
cout<<-1;
return 0;
}
used[s]=1;
for(int i=0;i<k;i++)
dif[i]=1;
for(int i=k;i<n;i++)
dif[i]=0;
rez[0]=s;
for(int i=1;i<(1<<n);i++)
{
bool bl=0;
for(int j=0;j<1000000;j++)
{
random_shuffle(dif,dif+n);
int aux=s;
for(int j=0;j<n;j++)
{
if(dif[j])
aux = aux ^ (1<<j);
}
if(!used[aux])
{
s=aux;
used[s]=1;
rez[i]=s;
bl=1;
break;
}
}
if(!bl)
{
cout<<-1;
return 0;
}
}
cout<<(1<<n)<<"\n";
for(int i=0;i<(1<<n);i++)
afis01(rez[i]);
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |