# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
569727 | losmi247 | The Xana coup (BOI21_xanadu) | C++14 | 104 ms | 57340 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;
typedef long long ll;
const int N =1e5+4;
int n;
vector <int> g[N];
int on[N];
ll dp[N][2][2]; /// i-ti cvor, j-da li je upaljen ili ne,k-da li je na njemu izvrsena operacija ili ne
bool cmp1(pair <ll,ll> x,pair <ll,ll> y){
return (x.second-x.first < y.second-y.first);
}
bool cmp2(pair <ll,ll> x,pair <ll,ll> y){
return (x.first-x.second < y.first-y.second);
}
void dfs(int x,int par){
if(g[x].size() == 1 && x != 1){
if(on[x]){
dp[x][1][0] = 0;
dp[x][0][1] = 1;
}
else{
dp[x][0][0] = 0;
dp[x][1][1] = 1;
}
/*cout << "postavio " << x << endl;
cout << dp[x][0][0] << " " << dp[x][0][1] << " " << dp[x][1][0] << " " << dp[x][1][1] << endl;*/
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... |