답안 #249542

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
249542 2020-07-15T08:50:18 Z Vimmer Poklon (COCI17_poklon7) C++14
96 / 120
1000 ms 117740 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];

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;
}

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

    if (L[v] < 0) l = dfs(abs(L[v])); else l = {0, L[v]};

    if (R[v] < 0) r = dfs(abs(R[v])); else r = {0, R[v]};

    vector <char> gl = tranc(l.S);

    vector <char> gr = tranc(r.S);

    if (sz(gl) + l.F < sz(gr) + r.F) {swap(gl, gr); swap(l, r);}

    if (sz(gl) + l.F != sz(gr) + r.F) {l.F++; return l;}

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

        if (gr[i] == '1') swap(l, r);

        break;
    }

    l.F++;

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

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

    pair <int, int > gr = dfs(1);

    vector <char> pr = tranc(gr.S);

    for (int i = 0; i < gr.F; i++) pr.pb('0');

    for (auto it : pr) cout << it;
}
# 결과 실행 시간 메모리 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 1 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 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 14 ms 1024 KB Output is correct
12 Correct 17 ms 768 KB Output is correct
13 Correct 93 ms 3576 KB Output is correct
14 Correct 133 ms 7160 KB Output is correct
15 Correct 133 ms 1144 KB Output is correct
16 Correct 451 ms 17144 KB Output is correct
17 Execution timed out 1033 ms 35320 KB Time limit exceeded
18 Execution timed out 1062 ms 40184 KB Time limit exceeded
19 Execution timed out 1097 ms 27504 KB Time limit exceeded
20 Execution timed out 1099 ms 117740 KB Time limit exceeded