Submission #437076

#TimeUsernameProblemLanguageResultExecution timeMemory
4370762548631Poklon (COCI17_poklon7)C++17
48 / 120
344 ms64768 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef pair<int,int> pii; typedef pair<ll,ll> pll; typedef complex<ld> cp; typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pii> vii; typedef vector<cp> vcp; typedef vector<ld> vld; typedef vector<vi> vvi; typedef vector<vll> vvll; typedef vector<vii> vvii; #define fastIO ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL) #define forw(i,l,r) for( int i = (l) ; i < (r) ; i++ ) #define forb(i,r,l) for( int i = (r) ; i >= (l) ; i-- ) #define log2i(x) (64 - __builtin_clzll(1ll*(x)) - 1) #define numBit(x) (__builtin_popcountll(1ll*(x))) #define getBit(x,i) (x>>i&1) #define Pi acos(-1.0l) #define sz(x) (int)x.size() #define mt make_tuple #define mp make_pair #define fi first #define se second #define pb push_back #define pf push_front #define pob pop_back #define pof pop_front #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define debug(x) cerr << #x << " = " << x << '\n'; const int N = 1e6+7; int n; int l[N],r[N]; ll dp[N]; ll dfs(int x) { if(x<0) return -x; dp[x]=2*max(dfs(l[x]),dfs(r[x])); return dp[x]; } void print(ll x) { if(x==0) return; print(x/2); cout << x%2; } int main() { fastIO; #ifndef ONLINE_JUDGE //freopen("test.inp","r",stdin); //freopen("test.out","w",stdout); #endif // ONLINE_JUDGE cin >> n; forw(i,1,n+1) cin >> l[i] >> r[i]; ll ans=dfs(1); print(ans); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...