# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
405190 | Aryan_Raina | Poklon (COCI17_poklon7) | C++14 | 335 ms | 111564 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int int64_t
#define ld long double
#define ar array
const int INF = 1e17;
const int MOD = 1e9+7;
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int N; cin >> N;
vector<ar<int,2>> adj(N);
for (auto &i : adj) {
cin >> i[0] >> i[1];
if (i[0] > 0) --i[0];
if (i[1] > 0) --i[1];
}
int ans = 0;
function<void(int, int)> dfs = [&](int u, int depth) {
int lc = adj[u][0], rc = adj[u][1];
if (lc < 0) ans = max(-lc * (1 << depth), ans);
else dfs(lc, depth + 1);
if (rc < 0) ans = max(-rc * (1 << depth), ans);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |