# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
315407 | Ahmad_Hasan | Poklon (COCI17_poklon7) | C++17 | 1095 ms | 47224 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;
vector<pair<long long,long long> >vps;
int cntdpth=1;
string maxx(string b1,string b2){
if(b1.size()>b2.size())
return b1;
if(b1.size()<b2.size())
return b2;
for(int i=0;i<b1.size();i++){
if(b1[i]>b2[i])
return b1;
if(b1[i]<b2[i])
return b2;
}
return b1;
}
string trg;
string slvmx(int cr=0,int dpth=1){
cntdpth=max(cntdpth,dpth);
string mx="0";
if(vps[cr].first<0){
string binary = std::bitset<32>(vps[cr].first*-1ll).to_string(); //"00000000000000000000000010000000"
binary.erase(0, binary.find_first_not_of('0')); //"10000000"
mx=maxx(mx,binary);
}else{
string ret=slvmx(vps[cr].first-1,dpth+1);
ret+='0';
mx=maxx(mx,ret);
}
if(vps[cr].second<0){
string binary = std::bitset<32>(vps[cr].second*-1ll).to_string(); //"00000000000000000000000010000000"
binary.erase(0, binary.find_first_not_of('0')); //"10000000"
mx=maxx(mx,binary);
}else{
string ret=slvmx(vps[cr].second-1,dpth+1);
ret+='0';
mx=maxx(mx,ret);
}
return mx;
}
int main()
{
int n;
cin>>n;
vps=vector<pair<long long,long long> >(n);
for(int i=0;i<n;i++){
long long x,y;
cin>>x>>y;
vps[i]={x,y};
}
trg=slvmx();
trg+='0';
int f=0;
int i=trg.size()-1;
for(;i>trg.size()-1-cntdpth;i--){
if(trg[i]=='1'){
f=1;
trg[i]='0';
}
}
while(f&&i>=0){
if(trg[i]=='0'){
trg[i]='1';
break;
}else{
trg[i]='0';
}
i--;
}
i=0;
for(;i<trg.size()-1&&trg[i]=='0';i++);
for(;i<trg.size();i++)cout << trg[i];
return 0;
}
/***
3 5 4
1 2 4 2 1
3 5 1 2 4
1 5 7 1 2
*/
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |