oj.uz

답안 #370672

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
370672 2021-02-24T13:18:08 Z TosakaUCW Poklon (COCI17_poklon7) C++17
0 / 120
 87 ms 8172 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
0 / 120.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Incorrect 1 ms 364 KB Output isn't correct
3 Incorrect 1 ms 364 KB Output isn't correct
4 Incorrect 0 ms 364 KB Output isn't correct
5 Incorrect 0 ms 364 KB Output isn't correct
6 Incorrect 0 ms 364 KB Output isn't correct
7 Incorrect 0 ms 364 KB Output isn't correct
8 Incorrect 0 ms 364 KB Output isn't correct
9 Incorrect 0 ms 364 KB Output isn't correct
10 Incorrect 1 ms 364 KB Output isn't correct
11 Incorrect 1 ms 364 KB Output isn't correct
12 Incorrect 1 ms 364 KB Output isn't correct
13 Incorrect 4 ms 748 KB Output isn't correct
14 Incorrect 8 ms 1132 KB Output isn't correct
15 Incorrect 8 ms 1132 KB Output isn't correct
16 Incorrect 27 ms 2924 KB Output isn't correct
17 Incorrect 66 ms 6508 KB Output isn't correct
18 Incorrect 67 ms 6636 KB Output isn't correct
19 Incorrect 87 ms 8172 KB Output isn't correct
20 Incorrect 70 ms 8172 KB Output isn't correct