답안 #298570

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
298570 2020-09-13T07:24:55 Z shrek12357 Poklon (COCI17_poklon7) C++14
36 / 120
1000 ms 12408 KB
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <climits>
#include <cmath>
#include <fstream>
#include <queue>
using namespace std;

const int MAXN = 1e6 + 5;
pair<long long, long long> vals[MAXN];
long long tot = 0;

long long dfs(int src) {
	long long val1 = 0, val2 = 0;
	if (vals[src].first > 0) {
		val1 = dfs(vals[src].first);
	}
	else {
		val1 = -1 * vals[src].first;
	}
	if (vals[src].second > 0) {
		val2 = dfs(vals[src].second);
	}
	else {
		val2 = vals[src].second * -1;
	}
	tot += max(val1, val2) - min(val1, val2);
	return max(val1, val2) * 2;
}

int main() {
	int n;
	cin >> n;

	for (int i = 0; i < n; i++) {
		long long a, b;
		cin >> a >> b;
		vals[i + 1] = { a, b };
		if (a < 0) {
			tot += -1 * a;
		}
		if (b < 0) {
			tot += -1 * b;
		}
	}
	dfs(1);
	bool used = false;
	for (int i = 50; i >= 0; i--) {
		if (pow(2, i) > tot) {
			if (used) {
				cout << 0;
			}
		}
		else {
			used = true;
			cout << 1;
			tot -= pow(2, i);
		}
	}
	cout << endl;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Incorrect 1 ms 512 KB Output isn't correct
7 Incorrect 1 ms 256 KB Output isn't correct
8 Correct 1 ms 256 KB Output is correct
9 Incorrect 1 ms 384 KB Output isn't correct
10 Incorrect 2 ms 384 KB Output isn't correct
11 Incorrect 15 ms 768 KB Output isn't correct
12 Incorrect 19 ms 768 KB Output isn't correct
13 Incorrect 75 ms 2168 KB Output isn't correct
14 Incorrect 149 ms 3832 KB Output isn't correct
15 Incorrect 149 ms 2168 KB Output isn't correct
16 Incorrect 528 ms 9824 KB Output isn't correct
17 Execution timed out 1052 ms 11460 KB Time limit exceeded
18 Execution timed out 1046 ms 11136 KB Time limit exceeded
19 Execution timed out 1051 ms 12408 KB Time limit exceeded
20 Execution timed out 1045 ms 11512 KB Time limit exceeded