QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#305848 | #5434. Binary Substrings | NemanjaSo2005 | TL | 8ms | 31048kb | C++14 | 2.7kb | 2024-01-16 04:14:18 | 2024-01-16 04:14:18 |
Judging History
answer
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int N,M,K;
vector<int> graf[(1<<20)+5];
int perm[(1<<20)+5];
bool bio[(1<<20)+5],uzmi[(1<<20)+5];
priority_queue<pair<int,int>> PQ;
void getcycle(int x){
if(bio[x])
return;
int gde=x,s=0;
while(gde!=x){
s++;
bio[gde]=true;
gde=perm[gde];
}
PQ.push({s,x});
}
void napravi(int k){
M=1<<(k-1);
for(int i=0;i<(1<<(k));i++){
int a=i>>1;
int b=i&((1<<(k-1))-1);
graf[a].push_back(b);
}
}
vector<int> V,R;
void poperm(int gde){
R.push_back(gde);
if(perm[gde]==0)
return;
int p=perm[gde];
perm[gde]=0;
poperm(p);
}
void euler(int gde){
while(graf[gde].size()){
int ko=graf[gde].back();
graf[gde].pop_back();
euler(ko);
}
V.push_back(gde);
}
int main(){
cin>>N;
if(N==1){
cout<<"0\n";
return 0;
}
if(N==2){
cout<<"01\n";
return 0;
}
if(N==3){
cout<<"010\n";
return 0;
}
if(N==4){
cout<<"1001\n";
return 0;
}
for(int i=0;i<=20;i++){
if((1<<i)+i-1<=N)
K=i;
}
//cout<<"DUZINA JE "<<K<<endl;
napravi(K);
euler(0);
reverse(V.begin(),V.end());
/*cout<<"CIKLUS: ";
for(int i=0;i<V.size();i++)
cout<<V[i]<<" ";
cout<<endl;*/
string poc="";
if(((1<<(K))+K-1)!=N){
vector<int> B;
for(int i=1;i<V.size();i++)
B.push_back((V[i-1]<<1) + (V[i]&1));
/*
cout<<"NIZ B:"<<endl;
for(int i=0;i<B.size();i++)
cout<<B[i]<<" ";
cout<<endl;*/
B.push_back(B[0]);
for(int i=0;i+1<B.size();i++)
perm[B[i]]=B[i+1]^1;
/*cout<<"PERM"<<endl;
for(int i=0;i<B.size();i++)
cout<<perm[i]<<" ";
cout<<endl;*/
poc="";
for(int i=(1<<K);i>=2;i>>=1)
poc.push_back('0'+((B[0]&i)>0));
for(int i=0;i<B.size();i++)
getcycle(B[i]);
int dod=N-poc.size()-B.size()+1;
while(dod>0){
if(PQ.top().first<=dod){
dod-=PQ.top().first;
uzmi[PQ.top().second]=true;
PQ.pop();
}
else
PQ.pop();
}
for(int i=0;i+1<B.size();i++)
if(uzmi[B[i]])
poperm(B[i]);
else
R.push_back(B[i]);
}
else{
//cout<<"OVAKAV"<<endl;
for(int i=1;i<K;i++)
cout<<"0";
for(int i=1;i<V.size();i++)
cout<<(V[i]&1);
cout<<endl;
return 0;
}
// cout<<R.size()-1<<" "<<N-(K-1)<<endl;
cout<<poc;
for(int i=0;i<N-poc.size();i++)
cout<<(R[i]&1);
cout<<"\n";
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 3ms
memory: 29276kb
input:
2
output:
01
result:
ok meet maximum 3
Test #2:
score: 0
Accepted
time: 0ms
memory: 29608kb
input:
5
output:
01100
result:
ok meet maximum 12
Test #3:
score: 0
Accepted
time: 0ms
memory: 28456kb
input:
1
output:
0
result:
ok meet maximum 1
Test #4:
score: 0
Accepted
time: 8ms
memory: 28936kb
input:
3
output:
010
result:
ok meet maximum 5
Test #5:
score: 0
Accepted
time: 7ms
memory: 30108kb
input:
4
output:
1001
result:
ok meet maximum 8
Test #6:
score: 0
Accepted
time: 0ms
memory: 31048kb
input:
6
output:
001100
result:
ok meet maximum 16
Test #7:
score: -100
Time Limit Exceeded
input:
7