oj.uz

답안 #370676

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
370676 2021-02-24T13:20:42 Z TosakaUCW Poklon (COCI17_poklon7) C++14
96 / 120
 1000 ms 181068 KB 
#include <stdio.h>
#include <algorithm>
#include <vector>

#pragma GCC optimize("-O3")

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<char> &res, int x)
{
    for (; x; x /= 2)
        res.push_back(x % 2 ? '1' : '0');
    std::reverse(res.begin(), res.end());
}

std::vector<char> dfs(int v)
{
    std::vector<char> 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()
{
    n = read();
    for (int i = 1; i <= n; i++)
        L[i] = -read(), R[i] = -read();
    std::vector<char> ans = dfs(1);
    for (auto x : ans)
        printf("%c", x);
    return 0;
}

Compilation message

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

Subtask #1
96.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 1 ms 364 KB Output is correct
6 Correct 0 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 7 ms 1260 KB Output is correct
12 Correct 7 ms 1132 KB Output is correct
13 Correct 57 ms 5484 KB Output is correct
14 Correct 188 ms 11116 KB Output is correct
15 Correct 44 ms 1132 KB Output is correct
16 Correct 836 ms 26988 KB Output is correct
17 Execution timed out 1089 ms 55788 KB Time limit exceeded
18 Execution timed out 1096 ms 63980 KB Time limit exceeded
19 Execution timed out 1095 ms 42348 KB Time limit exceeded
20 Execution timed out 1088 ms 181068 KB Time limit exceeded