oj.uz

Submission #249520

# Submission time Handle Problem Language Result Execution time Memory
249520 2020-07-15T07:56:19 Z Vimmer Poklon (COCI17_poklon7) C++14
120 / 120
 802 ms 182488 KB 
#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;

pair <int, int> val[N];

void tranc(vector <char> &gr, int x)
{
    gr.clear();

    while (x > 0)
    {
        if (x % 2) gr.pb('1');
          else gr.pb('0');

        x /= 2;
    }

    reverse(gr.begin(), gr.end());
}

vector <char> dfs(int v)
{
    vector <char> l, r;

    if (val[v].F < 0) l = dfs(abs(val[v].F)); else tranc(l, val[v].F);

    if (val[v].S < 0) r = dfs(abs(val[v].S)); else tranc(r, 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);

    int n;

    cin >> n;

    for (int i = 1; i <= n; i++)
    {
        int l, r;

        cin >> l >> r;

        if (l < 0) val[i].F = abs(l); else val[i].F = -l;

        if (r < 0) val[i].S = abs(r); else val[i].S = -r;
    }

    vector <char> gr = dfs(1);

    for (auto it : gr) cout << it;
}

Subtask #1
120.0 / 120.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 9 ms 1312 KB Output is correct
12 Correct 9 ms 1152 KB Output is correct
13 Correct 42 ms 5496 KB Output is correct
14 Correct 86 ms 11128 KB Output is correct
15 Correct 74 ms 1144 KB Output is correct
16 Correct 266 ms 27128 KB Output is correct
17 Correct 624 ms 56348 KB Output is correct
18 Correct 628 ms 64608 KB Output is correct
19 Correct 767 ms 42744 KB Output is correct
20 Correct 802 ms 182488 KB Output is correct