# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1140447 | mnbvcxz123 | The Xana coup (BOI21_xanadu) | C++20 | 108 ms | 29764 KiB |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
constexpr int N=1e5+5;
constexpr int inf=1e9;
int n;
int dp[N][2][2];
int a[N];
vector<int>g[N];
void dfs(int v, int e){
for(const int&i:g[v]){
if(i==e)continue;
dfs(i,v);
}
vector<int>all;
ll tot=0;
for(const int&i:g[v]){
if(i==e)continue;
tot+=dp[i][a[i]][0];
all.push_back(dp[i][a[i]][1]-dp[i][a[i]][0]);
}
sort(all.begin(),all.end());
vector<ll>p(all.size()+1);
for(int i=1;i<=all.size();++i)
p[i]=p[i-1]+all[i-1];
vector<ll>mn(2,inf);
# | 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... |