# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
371080 | Atill83 | Poklon (COCI17_poklon7) | C++14 | 160 ms | 262148 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>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 1e7+5;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n;
int l[MAXN], r[MAXN];
int Gidx = 0;
string idx[MAXN];
int len[MAXN];
vector<int> hsh[MAXN];
int do_it(int v){
if(v < 0){
int cur = -v, pow = 1;
while(cur){
idx[Gidx] += (char)('0' + cur % 2);
hsh[Gidx].push_back(((hsh[Gidx].empty() ? 0 : hsh[Gidx].back()) + pow * (cur % 2) % mod) % mod);
pow = pow * 2 % mod;
cur /= 2;
}
reverse(idx[Gidx].begin(), idx[Gidx].end());
reverse(hsh[Gidx].begin(), hsh[Gidx].end());
len[Gidx] = idx[Gidx].length();
return Gidx++;
}
int left = do_it(l[v]), right = do_it(r[v]);
int winner = -1;
if(len[left] != len[right]){
winner = (len[left] > len[right] ? left : right);
}else{
if(idx[left].size() != idx[right].size()){
return (idx[left].size() > idx[right].size() ? left : right);
}
int yer;
for(yer = 0; yer < idx[left].size(); yer++){
if(idx[left][yer] != idx[right][yer])
break;
}
if(yer == idx[left].size() || idx[left][yer] == '1')
winner = left;
else
winner = right;
}
len[winner]++;
return winner;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);cout.tie(nullptr);
#ifdef Local
freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/int.txt","r",stdin);
freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/out.txt","w",stdout);
#endif
cin>>n;
for(int i = 1; i <= n; i++)
cin>>l[i]>>r[i];
int ans = do_it(1);
string & cev = idx[ans];
while(cev.size() != len[ans])
cev += '0';
cerr<<ans<<endl;
cout<<cev<<endl;
#ifdef Local
cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
#endif
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |