# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
517022 | AdamGS | Friend (IOI14_friend) | C++17 | 43 ms | 8004 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 "friend.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const int LIM=1e5+7;
vector<pair<int,int>>V[LIM];
int T[LIM], dp[LIM][2];
void DFS(int x) {
dp[x][1]=T[x];
for(auto i : V[x]) {
DFS(i.st);
if(i.nd==0) dp[x][0]+=max(dp[i.st][0], dp[i.st][1]);
else dp[x][0]+=dp[i.st][0];
if(i.nd==1) dp[x][1]+=max(dp[i.st][0], dp[i.st][1]);
else dp[x][1]+=dp[i.st][0];
}
int suf[V[x].size()+1];
suf[V[x].size()]=0;
for(int i=V[x].size()-1; i>=0; --i) {
suf[i]=suf[i+1];
if(V[x][i].nd==0) suf[i]+=max(dp[V[x][i].st][0], dp[V[x][i].st][1]);
else suf[i]+=dp[V[x][i].st][0];
}
int akt=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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |