# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
249516 | Vimmer | Poklon (COCI17_poklon7) | C++14 | 527 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>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")
#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define pf push_front
#define N 1000010
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9
using namespace std;
//using namespace __gnu_pbds;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef short int si;
typedef array <int, 6> a6;
//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
bool mk[N][2];
pair <ll, ll> val[N];
vector <char> tranc(ll x)
{
vector <char> ans; ans.clear();
while (x > 0)
{
if (x % 2) ans.pb('1');
else ans.pb('0');
x /= 2;
}
reverse(ans.begin(), ans.end());
return ans;
}
vector <char> &dfs(ll v)
{
vector <char> l, r;
if (mk[v][0]) l = dfs(val[v].F); else l = tranc(val[v].F);
if (mk[v][1]) r = dfs(val[v].S); else r = tranc(val[v].S);
if (sz(l) < sz(r)) swap(l, r);
if (sz(l) != sz(r)) {l.pb('0'); return l;}
for (int i = 0; i < sz(l); i++)
{
if (l[i] == r[i]) continue;
if (r[i] == '1') swap(l, r);
break;
}
l.pb('0'); return l;
}
int main()
{
//freopen("input.txt", "r", stdin); freopen("output4.txt", "w", stdout);
ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll n;
cin >> n;
for (ll i = 1; i <= n; i++)
{
ll l, r;
cin >> l >> r;
if (l < 0) val[i].F = abs(l); else {mk[i][0] = 1; val[i].F = l;}
if (r < 0) val[i].S = abs(r); else {mk[i][1] = 1; val[i].S = r;}
}
vector <char> gr = dfs(1);
for (auto it : gr) cout << it;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |