oj.uz

답안 #249523

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

pair <int, int> val[N];

void tranc(vector <char> &gr, int x)
{
    while (x > 0)
    {
        if (x % 2) gr.pb('1');
          else gr.pb('0');

        x /= 2;
    }

    reverse(gr.begin(), gr.end());
}

void dfs(vector <char> &gr, int v)
{
    vector <char> l, r; l.clear(); r.clear();

    if (val[v].F < 0) dfs(l, abs(val[v].F)); else tranc(l, val[v].F);

    if (val[v].S < 0) dfs(r, abs(val[v].S)); else tranc(r, val[v].S);

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

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

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

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

        break;
    }

    gr = l;

    gr.pb('0');
}

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

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

    vector <char> gr; gr.clear();

    dfs(gr, 1);

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

Subtask #1
90.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 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 11 ms 1152 KB Output is correct
12 Correct 12 ms 896 KB Output is correct
13 Correct 76 ms 4480 KB Output is correct
14 Correct 214 ms 8828 KB Output is correct
15 Correct 90 ms 1272 KB Output is correct
16 Execution timed out 1091 ms 21880 KB Time limit exceeded
17 Execution timed out 1098 ms 45640 KB Time limit exceeded
18 Execution timed out 1094 ms 51960 KB Time limit exceeded
19 Execution timed out 1097 ms 35360 KB Time limit exceeded
20 Execution timed out 1100 ms 134096 KB Time limit exceeded