# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
167563 | manh9203 | Mag (COCI16_mag) | C++17 | 552 ms | 178272 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 N = 1e6 + 5;
int n,u,v,a[N],dp[N][2],ans1,ans2;
vector<int> adj[N];
void dfs(int u,int p){
int mx1 = 0, mx2 = 0, mx3 = 0, mx4 = 0;
int luu1 = -1, luu2 = -1, luu3 = -1, luu4 = -1;
for(int v: adj[u]){
if(v != p){
dfs(v, u);
if(dp[v][0] > mx1){
mx2 = mx1;
luu2 = luu1;
mx1 = dp[v][0];
luu1 = v;
}else{
if(dp[v][0] > mx2){
mx2 = dp[v][0];
luu2 = v;
}
}
if(dp[v][1] > mx3){
mx4 = mx3;
luu4 = luu3;
mx3 = dp[v][1];
luu3 = v;
}else{
if(dp[v][1] > mx4){
mx4 = dp[v][1];
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... |
# | 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... |