oj.uz

답안 #370669

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
370669 2021-02-24T13:07:57 Z TosakaUCW Poklon (COCI17_poklon7) C++17
90 / 120
 1000 ms 165532 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];

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

std::vector<int> dfs(int v)
{
    std::vector<int> a, b;
	if (L[v] > 0)
		a = dfs(L[v]);
	else
		convert(a, -L[v]);
	if (R[v] > 0)
		b = dfs(R[v]);
	else
		convert(b, -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()
{
    // freopen("poklon.in", "r", stdin), freopen("poklon.out", "w", stdout);
    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:42:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |     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 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 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 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 11 ms 1516 KB Output is correct
12 Correct 13 ms 1260 KB Output is correct
13 Correct 136 ms 6252 KB Output is correct
14 Correct 518 ms 12440 KB Output is correct
15 Correct 51 ms 1260 KB Output is correct
16 Execution timed out 1082 ms 30448 KB Time limit exceeded
17 Execution timed out 1084 ms 62732 KB Time limit exceeded
18 Execution timed out 1078 ms 71688 KB Time limit exceeded
19 Execution timed out 1095 ms 48008 KB Time limit exceeded
20 Execution timed out 1104 ms 165532 KB Time limit exceeded