# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
924325 | TahirAliyev | The Xana coup (BOI21_xanadu) | C++17 | 87 ms | 27988 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>
#define ll long long
using namespace std;
#define pii pair<ll, ll>
ll oo = 1e9 + 9;
int n, m, k;
const int MAX = 1e5 + 5, MOD = 1e9 + 7, LOGMAX = 25;
vector<int> g[MAX];
int col[MAX];
int dp[MAX][2][2];
void dfs(int node, int p){
dp[node][0][0] = oo;
dp[node][0][1] = oo;
dp[node][1][0] = oo;
dp[node][1][1] = oo;
int sum = 0, sum2 = 0;
vector<int> s, s2;
int p1 = 1, p2 = 1;
for(int to : g[node]){
if(p == to) continue;
dfs(to, node);
if(dp[to][0][0] <= n && dp[to][0][1] <= n){
sum += dp[to][0][0];
s.push_back(dp[to][0][1] - dp[to][0][0]);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |