oj.uz

Submission #249637

# Submission time Handle Problem Language Result Execution time Memory
249637 2020-07-15T12:31:42 Z Vimmer Poklon (COCI17_poklon7) C++14
120 / 120
 396 ms 36344 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;

int L[N], R[N], from[N];

bool mk[N];

pair <int, int> val[N][2];

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

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

        x /= 2;
    }

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

    return gr;
}

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) L[i] = abs(l); else L[i] = -l;

        if (r < 0) R[i] = abs(r); else R[i] = -r;
    }

    int v = 1;

    while (1)
    {
        if (val[v][0] == make_pair(0, 0))
        {
            if (L[v] < 0) {from[abs(L[v])] = v; v = abs(L[v]); mk[v] = 1; continue;}
              else val[v][0] = {0, L[v]};
        }

        if (val[v][1] == make_pair(0, 0))
        {
            if (R[v] < 0) {from[abs(R[v])] = v; v = abs(R[v]); continue;}
              else val[v][1] = {0, R[v]};
        }

        if (log2(val[v][0].S) + val[v][0].F < log2(val[v][1].S) + val[v][1].F) swap(val[v][1], val[v][0]);

        if (log2(val[v][0].S) + val[v][0].F == log2(val[v][1].S) + val[v][1].F)
        {
            vector <char> gl = tranc(val[v][0].S);

            vector <char> gr = tranc(val[v][1].S);

            for (int i = 0; i < min(sz(gr), sz(gl)); i++)
            {
                if (gl[i] == gr[i]) continue;

                if (gr[i] == '1') swap(val[v][1], val[v][0]);

                break;
            }
        }

        val[v][0].F++;

        if (v == 1) break;

        int nxt = from[v];

        if (mk[v]) val[nxt][0] = val[v][0];
          else val[nxt][1] = val[v][0];

        v = nxt;
    }

    vector <char> gr = tranc(val[1][0].S);

    for (int i = 0; i < val[1][0].F; i++) gr.pb('0');

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

Subtask #1
120.0 / 120.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 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 4 ms 768 KB Output is correct
12 Correct 5 ms 896 KB Output is correct
13 Correct 21 ms 2688 KB Output is correct
14 Correct 42 ms 4984 KB Output is correct
15 Correct 40 ms 4856 KB Output is correct
16 Correct 141 ms 16120 KB Output is correct
17 Correct 349 ms 35832 KB Output is correct
18 Correct 338 ms 36344 KB Output is correct
19 Correct 395 ms 29816 KB Output is correct
20 Correct 396 ms 31456 KB Output is correct