# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
759075 | kirakosyan | The Xana coup (BOI21_xanadu) | C++17 | 55 ms | 31964 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 <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <cmath>
#include <map>
#include <string>
#include <ios>
#include <iomanip>
#include <deque>
#include <queue>
#include <list>
#include <stack>
#define FASTIO ios_base::sync_with_stdio(0); cin.tie(NULL);
using ll = long long;
using namespace std;
vector<vector<ll>>gp;
vector<ll>v;
vector<vector<vector<ll>>>dp;
void dfs(ll u,ll p){
ll cnt=1e18,lox=1e18,ans=0,ans1=0;
for(ll& x:gp[u]){
if(x!=p){
dfs(x,u);
dp[u][0][0]+=min(dp[x][0][0],dp[x][1][0]);
dp[u][1][0]+=min(dp[x][1][1],dp[x][0][1]);
if(min(dp[x][0][0],dp[x][1][0])==dp[x][1][0]) ans++;
if(min(dp[x][0][1],dp[x][1][1])==dp[x][1][1]) ans1++;
cnt=min(cnt,abs(dp[x][0][0]-dp[x][1][0]));
# | 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... |