oj.uz

답안 #370696

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
370696 2021-02-24T13:37:51 Z TosakaUCW Poklon (COCI17_poklon7) C++17
90 / 120
 1000 ms 180880 KB 
#include <bits/stdc++.h>

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)
{
    for (; x > 0; x /= 2)
        res.push_back(x % 2 ? '1' : '0');
    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 (a.size() < b.size())
        swap(a, b);
    if (a.size() ^ b.size())
        return a.push_back('0'), a;
    for (int i = 0; i < int(a.size()); i++)
    {
		if (a[i] == b[i])
			continue;
        if (b[i] == '1')
            swap(a, b);
        break;
    }
    return a.push_back('0'), 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
90.0 / 120.0

# 결과 실행 시간 메모리 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 15 ms 1388 KB Output is correct
12 Correct 15 ms 1132 KB Output is correct
13 Correct 90 ms 5484 KB Output is correct
14 Correct 236 ms 11116 KB Output is correct
15 Correct 115 ms 1132 KB Output is correct
16 Execution timed out 1092 ms 26988 KB Time limit exceeded
17 Execution timed out 1054 ms 55852 KB Time limit exceeded
18 Execution timed out 1051 ms 64236 KB Time limit exceeded
19 Execution timed out 1090 ms 42324 KB Time limit exceeded
20 Execution timed out 1101 ms 180880 KB Time limit exceeded