답안 #89338

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
89338 2018-12-11T22:12:51 Z jasony123123 Poklon (COCI17_poklon7) C++11
48 / 120
284 ms 96828 KB
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;
#define FOR(i,start,end) for(int i=start;i<(int)(end);i++)
#define FORE(i,start,end) for(int i=start;i<=(int)end;i++)
#define RFOR(i,start,end) for(int i = start; i>end; i--)
#define RFORE(i,start,end) for(int i = start; i>=end; i--)
#define all(a) a.begin(), a.end()
#define mt make_tuple
#define v vector
#define sf scanf
#define pf printf
#define dvar(x) cout << #x << " := " << x << "\n"
#define darr(x,n) FOR(i,0,n) cout << #x << "[" << i << "]" << " := " << x[i] << "\n"
typedef long long ll;
typedef long double ld;
typedef pair<int, int > pii;
typedef pair<ll, ll> pll;
//template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> void minn(T &a, T b) { a = min(a, b); }
template<class T> void maxx(T &a, T b) { a = max(a, b); }
inline void io() {
#ifdef LOCAL_PROJECT 
	freopen("input.in", "r", stdin); freopen("output.out", "w", stdout);
#else 
	/* online submission */
#endif 
	ios_base::sync_with_stdio(false); cin.tie(NULL);
}
/**************************COCI 2016-2017 R7 P4*************************/

int N, C[1000000][2];

ll dfs(int x) {
	if (x < 0)
		return -x;
	ll l = dfs(C[x][0]), r = dfs(C[x][1]);
	return 2LL * max(l, r);
}

int main() {
	io();
	cin >> N;
	FORE(i, 1, N) cin >> C[i][0] >> C[i][1];
	ll ans = dfs(1);
	bitset<64> bits(ans);
	bool start = 0;
	RFORE(i, 63, 0) {
		if (start || bits[i] == 1) cout << bits[i];
		if (bits[i]) start = 1;
	}
	return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 668 KB Output is correct
5 Correct 2 ms 668 KB Output is correct
6 Correct 2 ms 676 KB Output is correct
7 Correct 2 ms 680 KB Output is correct
8 Correct 2 ms 700 KB Output is correct
9 Incorrect 2 ms 708 KB Output isn't correct
10 Incorrect 2 ms 812 KB Output isn't correct
11 Incorrect 5 ms 1040 KB Output isn't correct
12 Incorrect 6 ms 1252 KB Output isn't correct
13 Incorrect 15 ms 2672 KB Output isn't correct
14 Incorrect 28 ms 5164 KB Output isn't correct
15 Incorrect 29 ms 6028 KB Output isn't correct
16 Incorrect 95 ms 15616 KB Output isn't correct
17 Incorrect 224 ms 34976 KB Output isn't correct
18 Incorrect 229 ms 49576 KB Output isn't correct
19 Incorrect 284 ms 66552 KB Output isn't correct
20 Incorrect 264 ms 96828 KB Output isn't correct