oj.uz

답안 #249518

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
249518 2020-07-15T07:52:19 Z Vimmer Poklon (COCI17_poklon7) C++14
114 / 120
 782 ms 262148 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;

bool mk[N][2];

pair <ll, ll> val[N];

vector <char> tranc(ll x)
{
    vector <char> ans; ans.clear();

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

        x /= 2;
    }

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

    return ans;
}

inline vector <char> dfs(ll v)
{
    vector <char> l, r;

    if (mk[v][0]) l = dfs(val[v].F); else l = tranc(val[v].F);

    if (mk[v][1]) r = dfs(val[v].S); else r = tranc(val[v].S);

    if (sz(l) < sz(r)) swap(l, r);

    if (sz(l) != sz(r)) {l.pb('0'); return l;}

    for (int i = 0; i < sz(l); i++)
    {
        if (l[i] == r[i]) continue;

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

        break;
    }

    l.pb('0');

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

    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 {mk[i][0] = 1; val[i].F = l;}

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

    vector <char> gr = dfs(1);

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

Subtask #1
114.0 / 120.0

# 결과 실행 시간 메모리 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 1 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 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 10 ms 1792 KB Output is correct
12 Correct 11 ms 1536 KB Output is correct
13 Correct 42 ms 7544 KB Output is correct
14 Correct 83 ms 15352 KB Output is correct
15 Correct 77 ms 2168 KB Output is correct
16 Correct 284 ms 36856 KB Output is correct
17 Correct 636 ms 76756 KB Output is correct
18 Correct 654 ms 88056 KB Output is correct
19 Correct 782 ms 60736 KB Output is correct
20 Runtime error 367 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)