oj.uz

Submission #370698

# Submission time Handle Problem Language Result Execution time Memory
370698 2021-02-24T13:41:15 Z TosakaUCW Poklon (COCI17_poklon7) C++17
102 / 120
 1000 ms 134628 KB 
#include <bits/stdc++.h>

#define sz(x) int(x.size())

using namespace std;

#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("no-stack-protector")
 
const int N = 1e6 + 10;
 
int n;
int L[N], R[N];
 
void convert(vector<char> &res, int x)
{
	while (x > 0)
    {
        if (x % 2) res.push_back('1');
        else res.push_back('0');
        x /= 2;
    }
    reverse(res.begin(), res.end());
}
 
vector<char> dfs(int v)
{
    vector<char> a, b;
	if (L[v] < 0) a = dfs(abs(L[v])); else convert(a, L[v]);
    if (R[v] < 0) b = dfs(abs(R[v])); else convert(b, R[v]);
    if (sz(a) < sz(b))
        swap(a, b);
    if (sz(a) != sz(b))
		{ a.push_back('0'); return a; }
    for (int i = 0; i < int(a.size()); i++)
    {
		if (a[i] == b[i])
			continue;
        if (b[i] == '1')
            swap(a, b);
        break;
    }
    a.push_back('0'); return a;
}
 
int main()
{
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
		int l, r;
		cin >> l >> r;
        if (l < 0) L[i] = abs(l); else L[i] = -l;
        if (r < 0) R[i] = abs(r); else R[i] = -r;
	}
    vector<char> ans = dfs(1);
    for (auto x : ans)
        cout << x;
    return 0;
}

Subtask #1
102.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 2 ms 364 KB Output is correct
11 Correct 12 ms 1132 KB Output is correct
12 Correct 15 ms 876 KB Output is correct
13 Correct 62 ms 4332 KB Output is correct
14 Correct 123 ms 8684 KB Output is correct
15 Correct 121 ms 1132 KB Output is correct
16 Correct 421 ms 21436 KB Output is correct
17 Correct 980 ms 44680 KB Output is correct
18 Execution timed out 1002 ms 51072 KB Time limit exceeded
19 Execution timed out 1086 ms 34668 KB Time limit exceeded
20 Execution timed out 1106 ms 134628 KB Time limit exceeded