# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
991366 | 12345678 | The Xana coup (BOI21_xanadu) | C++17 | 45 ms | 18616 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;
const int nx=1e5+5, inf=1e9;
int n, a[nx], u, v, dp[nx][2][2], tmp[2][2];
vector<int> d[nx];
void dfs(int u, int p)
{
int dp2[2][2];
dp2[0][0]=dp2[1][0]=0;
dp2[0][1]=dp2[1][1]=inf;
for (auto v:d[u])
{
if (v==p) continue;
dfs(v, u);
tmp[0][0]=min(dp2[0][0]+dp[v][0][0], dp2[0][1]+dp[v][0][1]);
tmp[0][1]=min(dp2[0][1]+dp[v][0][0], dp2[0][0]+dp[v][0][1]);
tmp[1][0]=min(dp2[1][0]+dp[v][1][0], dp2[1][1]+dp[v][1][1]);
tmp[1][1]=min(dp2[1][1]+dp[v][1][0], dp2[1][0]+dp[v][1][1]);
for (int i=0; i<2; i++) for (int j=0; j<2; j++) dp2[i][j]=min(inf, tmp[i][j]);
//cout<<"dp "<<v<<' '<<u<<' '<<dp2[0][0]<<' '<<dp2[0][1]<<' '<<dp2[1][0]<<' '<<dp2[1][1]<<'\n';
}
//cout<<"dp "<<u<<' '<<dp2[0][0]<<' '<<dp2[0][1]<<' '<<dp2[1][0]<<' '<<dp2[1][1]<<'\n';
if (a[u])
{
dp[u][0][0]=min(inf, dp2[1][0]);
dp[u][0][1]=min(inf, dp2[0][1]+1);
# | 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... |