oj.uz

답안 #249514

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
249514 2020-07-15T07:42:40 Z Vimmer Poklon (COCI17_poklon7) C++14
48 / 120
 301 ms 49208 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 <ull, ull> val[N];

ull dfs(ll v)
{
    ull l = 1, r = 1;

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

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

    return max(l, r) + max(l, r);
}

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

    ull 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

# 결과 실행 시간 메모리 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 1 ms 384 KB Output is correct
9 Incorrect 1 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 22 ms 2048 KB Output isn't correct
14 Incorrect 30 ms 3704 KB Output isn't correct
15 Incorrect 29 ms 2040 KB Output isn't correct
16 Incorrect 100 ms 10232 KB Output isn't correct
17 Incorrect 242 ms 22392 KB Output isn't correct
18 Incorrect 241 ms 23800 KB Output isn't correct
19 Incorrect 285 ms 23496 KB Output isn't correct
20 Incorrect 301 ms 49208 KB Output isn't correct