oj.uz

Submission #251847

# Submission time Handle Problem Language Result Execution time Memory
251847 2020-07-22T11:19:50 Z kartel Poklon (COCI17_poklon7) C++14
0 / 120
 6 ms 1152 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,nso-stack-protector,unroll-loops,fast-math,-O3")
//#define F first
//#define S second
#define pb push_back
#define N +5005
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e9)
#define el '\n'
#define Max_A int(1e9)
//#define el endl
#define pii pair <int, int>
#define err ld(1e-9)
#define Max_S int(3e6)
#define last(x) x.back()
#define all(x) (x).begin(), (x).end()
#define arr_all(x, n) (x + 1), (x + 1 + n)
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

struct str{
    ll le, ri, l, r;
};

str f[N];
ll i, n, ans;

ll rec(ll v)
{
    ll lF = f[v].l;
    ll rF = f[v].r;

    if (f[v].le != 0) lF = rec(f[v].le);
    if (f[v].ri != 0) rF = rec(f[v].ri);

    return 2 * max(lF, rF);
}

string bin(ll x)
{
    string ans = "";
    while (x)
    {
        ans += '0' + x & 1;
        x >>= 1;
    }
    reverse(all(ans));
    return ans;
}

int main()
{
    cout.precision(2);
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

//    in("input.txt");
//    out("output.txt");
    cin >> n;
    for (i = 1; i <= n; i++)
    {
        int l, r;
        cin >> l >> r;
        if (l > 0) f[i].le = l; else f[i].l = -l;
        if (r > 0) f[i].ri = r; else f[i].r = -r;
    }

    cout << bin(rec(1) / 2);
}
//
//00000
//00110
//00111
//00011
//00000

Compilation message

poklon.cpp: In function 'std::__cxx11::string bin(ll)':
poklon.cpp:54:20: warning: suggest parentheses around '+' in operand of '&' [-Wparentheses]
         ans += '0' + x & 1;
                ~~~~^~~

Subtask #1
0 / 120.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Incorrect 0 ms 384 KB Output isn't correct
3 Incorrect 1 ms 384 KB Output isn't correct
4 Incorrect 0 ms 384 KB Output isn't correct
5 Incorrect 0 ms 384 KB Output isn't correct
6 Incorrect 0 ms 384 KB Output isn't correct
7 Incorrect 0 ms 384 KB Output isn't correct
8 Incorrect 0 ms 384 KB Output isn't correct
9 Incorrect 1 ms 360 KB Output isn't correct
10 Incorrect 1 ms 384 KB Output isn't correct
11 Runtime error 6 ms 1024 KB Execution killed with signal 11 (could be triggered by violating memory limits)
12 Runtime error 3 ms 1024 KB Execution killed with signal 11 (could be triggered by violating memory limits)
13 Runtime error 4 ms 1024 KB Execution killed with signal 11 (could be triggered by violating memory limits)
14 Runtime error 4 ms 1024 KB Execution killed with signal 11 (could be triggered by violating memory limits)
15 Runtime error 4 ms 1024 KB Execution killed with signal 11 (could be triggered by violating memory limits)
16 Runtime error 4 ms 1024 KB Execution killed with signal 11 (could be triggered by violating memory limits)
17 Runtime error 3 ms 1024 KB Execution killed with signal 11 (could be triggered by violating memory limits)
18 Runtime error 5 ms 1152 KB Execution killed with signal 11 (could be triggered by violating memory limits)
19 Runtime error 3 ms 1024 KB Execution killed with signal 11 (could be triggered by violating memory limits)
20 Runtime error 3 ms 1024 KB Execution killed with signal 11 (could be triggered by violating memory limits)