# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
339460 | mosiashvililuka | "The Lyuboyn" code (IZhO19_lyuboyn) | C++14 | 625 ms | 7660 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>
using namespace std;
int a,b,c,d,e,i,j,ii,jj,zx,xc,n,k,T,p[1000009],pi,q[1000009],qi,z,x,y;
string ss;
string totwo(int q){
//cout<<q<<" l"<<endl;
string s;
for(int h=n-1; h>=0; h--){
if(((1<<h)&q)!=0) s.push_back('1'); else s.push_back('0');
}
return s;
}
int main(){
ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
cin>>n>>k>>T>>ss;
if(k%2==0){
cout<<-1;
return 0;
}
if(k>=n){
cout<<-1;
return 0;
}
pi=4;
p[1]=0;p[2]=1;p[3]=3;p[4]=2;
for(i=4; i<=k+1; i+=2){
qi=0;
y=(1<<(i-2))-1;z=(1<<(i-1));x=(1<<(i-2));
for(j=1; j<=pi; j++){
qi++;q[qi]=p[j];
# | 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... |