oj.uz

답안 #370666

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
370666 2021-02-24T12:58:47 Z TosakaUCW Poklon (COCI17_poklon7) C++17
90 / 120
 1000 ms 167692 KB 
#include <stdio.h>
#include <algorithm>
#include <vector>

int read(int x = 0, int f = 0, char ch = getchar())
{
    while ('0' > ch or ch > '9')
        f = ch == '-', ch = getchar();
    while ('0' <= ch and ch <= '9')
        x = x * 10 + (ch ^ 48), ch = getchar();
    return f ? -x : x;
}

const int N = 1e6 + 5;

int n;
int L[N], R[N];

std::vector<int> convert(int x)
{
    std::vector<int> res;
    for (; x; x /= 2)
        res.push_back(x % 2);
    return std::reverse(res.begin(), res.end()), res;
}

std::vector<int> dfs(int v)
{
    std::vector<int> a, b;
    a = L[v] > 0 ? dfs(L[v]) : convert(-L[v]);
    b = R[v] > 0 ? dfs(R[v]) : convert(-R[v]);
    if (a.size() < b.size())
        swap(a, b);
    if (a.size() ^ b.size())
        return a.push_back(0), a;
    for (int i = 0; i < a.size(); i++)
        if (a[i] ^ b[i])
        {
            if (b[i] == 1)
                std::swap(a, b);
            break;
        }
    return a.push_back(0), a;
}

int main()
{
    n = read();
    for (int i = 1; i <= n; i++)
        L[i] = read(), R[i] = read();
    std::vector<int> ans = dfs(1);
    for (auto x : ans)
        printf("%d", x);
    return 0;
}

Compilation message

poklon.cpp: In function 'std::vector<int> dfs(int)':
poklon.cpp:36:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |     for (int i = 0; i < a.size(); i++)
      |                     ~~^~~~~~~~~~

Subtask #1
90.0 / 120.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 372 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 11 ms 1516 KB Output is correct
12 Correct 11 ms 1260 KB Output is correct
13 Correct 140 ms 6428 KB Output is correct
14 Correct 526 ms 12952 KB Output is correct
15 Correct 61 ms 2796 KB Output is correct
16 Execution timed out 1087 ms 33700 KB Time limit exceeded
17 Execution timed out 1052 ms 71328 KB Time limit exceeded
18 Execution timed out 1060 ms 79764 KB Time limit exceeded
19 Execution timed out 1094 ms 61728 KB Time limit exceeded
20 Execution timed out 1095 ms 167692 KB Time limit exceeded