oj.uz

Submission #370680

# Submission time Handle Problem Language Result Execution time Memory
370680 2021-02-24T13:25:06 Z TosakaUCW Poklon (COCI17_poklon7) C++17
96 / 120
 1000 ms 166204 KB 
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <iostream>

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()
{
	std::ios_base::sync_with_stdio(0); 
	std::istream::sync_with_stdio(0); 
	std::cin.tie(0); std::cout.tie(0);
    std::cin >> n;
    for (int i = 1; i <= n; i++)
    {
		std::cin >> L[i] >> R[i];
		L[i] = -L[i], R[i] = -R[i];
	}
    std::vector<char> ans = dfs(1);
    for (auto x : ans)
        std::cout << x;
    return 0;
}

Compilation message

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

Subtask #1
96.0 / 120.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 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 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 9 ms 1344 KB Output is correct
12 Correct 11 ms 1132 KB Output is correct
13 Correct 69 ms 5228 KB Output is correct
14 Correct 199 ms 10288 KB Output is correct
15 Correct 70 ms 1132 KB Output is correct
16 Correct 975 ms 25180 KB Output is correct
17 Execution timed out 1057 ms 51824 KB Time limit exceeded
18 Execution timed out 1099 ms 59372 KB Time limit exceeded
19 Execution timed out 1094 ms 39560 KB Time limit exceeded
20 Execution timed out 1106 ms 166204 KB Time limit exceeded