oj.uz

Submission #249513

# Submission time Handle Problem Language Result Execution time Memory
249513 2020-07-15T07:39:34 Z Vimmer Poklon (COCI17_poklon7) C++14
48 / 120
 281 ms 47328 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 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 <ll, ll> val[N];

ll dfs(ll v)
{
    ll l, r;

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

    if (val[v].S < 0) r = dfs(abs(val[v].S)); else r = val[v].S;

    return max(l, r) * 2;
}

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 val[i].F = -l;

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

    ll ans = dfs(1);

    vector <char> gr; gr.clear();

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

        ans /= 2;
    }

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

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

Subtask #1
48.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 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Incorrect 0 ms 384 KB Output isn't correct
10 Incorrect 1 ms 384 KB Output isn't correct
11 Incorrect 3 ms 640 KB Output isn't correct
12 Incorrect 4 ms 640 KB Output isn't correct
13 Incorrect 14 ms 1920 KB Output isn't correct
14 Incorrect 28 ms 3584 KB Output isn't correct
15 Incorrect 28 ms 1912 KB Output isn't correct
16 Incorrect 99 ms 9464 KB Output isn't correct
17 Incorrect 243 ms 20728 KB Output isn't correct
18 Incorrect 235 ms 22392 KB Output isn't correct
19 Incorrect 279 ms 21496 KB Output isn't correct
20 Incorrect 281 ms 47328 KB Output isn't correct