oj.uz

Submission #251934

# Submission time Handle Problem Language Result Execution time Memory
251934 2020-07-23T07:07:04 Z kartel Poklon (COCI17_poklon7) C++14
108 / 120
 1000 ms 262148 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 +1000500
#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 psi pair <string, 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;

pii f[N];
psi sum[N];
int i, n;

psi umax(psi a, psi b)
{
    if (sz(a.F) + a.S > sz(b.F) + b.S) return a;
    if (sz(a.F) + a.S < sz(b.F) + b.S) return b;

    string na = a.F, nb = b.F;
    int n = max(sz(na), sz(nb));

    while (sz(na) < sz(nb)) na += "0";
    while (sz(na) > sz(nb)) nb += "0";

    int i = 0;
    while (i < n && na[i] == nb[i]) i++;

    if (i == n) return a;


    if (na[i] > nb[i]) return a;
                  else return b;
}

psi upd(psi x)
{
    x.S++;
    return x;
}

string bin(int x)
{
    string current = "";

    while (x)
    {
        if (x & 1)
             current += "1";
        else current += "0";
        x /= 2;
    }
    reverse(all(current));
    return current;
}

void rec(int v)
{
    psi lF;
    psi rF;

//    cout << v << ":" << n << el;

    if (f[v].F > 0) {rec(f[v].F); lF = sum[f[v].F];} else lF = {bin(-f[v].F), 0};
    if (f[v].S > 0) {rec(f[v].S); rF = sum[f[v].S];} else rF = {bin(-f[v].S), 0};

    sum[v] = upd(umax(lF, rF));
}


string restore(psi x)
{
    for (int i = 0; i < x.S; i++) x.F += "0";
    return x.F;
}

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");
//    in("17.in");
//    out("output.txt");

    cin >> n;
    for (i = 1; i <= n; i++)
    {
        int l, r;
        cin >> l >> r;
        f[i] = {l, r};
    }

    rec(1);

    cout << restore(sum[1]) << el;
}
//
//00000
//00110
//00111
//00011
//00000

Subtask #1
108.0 / 120.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 39544 KB Output is correct
2 Correct 24 ms 39544 KB Output is correct
3 Correct 25 ms 39552 KB Output is correct
4 Correct 25 ms 39552 KB Output is correct
5 Correct 24 ms 39552 KB Output is correct
6 Correct 24 ms 39552 KB Output is correct
7 Correct 25 ms 39548 KB Output is correct
8 Correct 24 ms 39552 KB Output is correct
9 Correct 24 ms 39552 KB Output is correct
10 Correct 22 ms 39552 KB Output is correct
11 Correct 36 ms 41592 KB Output is correct
12 Correct 33 ms 41336 KB Output is correct
13 Correct 85 ms 50552 KB Output is correct
14 Correct 131 ms 62328 KB Output is correct
15 Correct 120 ms 44928 KB Output is correct
16 Correct 390 ms 99592 KB Output is correct
17 Correct 858 ms 167956 KB Output is correct
18 Correct 887 ms 183060 KB Output is correct
19 Execution timed out 1063 ms 152968 KB Time limit exceeded
20 Runtime error 404 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)