Submission #2152401


Source Code Expand

#include<bits/stdc++.h>
using namespace std;

int N;
vector<int> G[100010];
int cnt;
int dp[100010];
int MAX = 0;

int DFS(int v,int p)
{
    int res = (G[v].size() == 2);
    int tmp = 0;
    for(int i = 0; i < G[v].size(); i++)
    {
        int now = G[v][i];
        if(now == p)continue;
        res += DFS(now,v);
        MAX = max(MAX,tmp + dp[now] + (G[v].size() == 2));
        tmp = max(tmp,dp[now]);
    }
    dp[v] = tmp + (G[v].size() == 2);
    return res;
}

int main()
{
    scanf("%d",&N);
    for(int i = 0; i < N - 1; i++)
    {
        int a,b;
        scanf("%d%d",&a,&b);
        G[a].push_back(b);
        G[b].push_back(a);
    }

    for(int i = 1; i <= N; i++)if(G[i].size() == 1)cnt++;

    DFS(1,0);

    printf("%d\n",cnt + MAX);
    return 0;
}

Submission Info

Submission Time
Task K - Problem on Tree
User unit
Language C++14 (GCC 5.4.1)
Score 100
Code Size 818 Byte
Status AC
Exec Time 41 ms
Memory 6144 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:28:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&N);
                   ^
./Main.cpp:32:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&a,&b);
                            ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 2
AC × 43
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All sample_01.txt, sample_02.txt, sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask1_30.txt, subtask1_31.txt, subtask1_32.txt, subtask1_33.txt, subtask1_34.txt, subtask1_35.txt, subtask1_36.txt, subtask1_37.txt, subtask1_38.txt, subtask1_39.txt
Case Name Status Exec Time Memory
sample_01.txt AC 2 ms 2560 KB
sample_02.txt AC 2 ms 2560 KB
subtask1_01.txt AC 34 ms 5632 KB
subtask1_02.txt AC 26 ms 4992 KB
subtask1_03.txt AC 12 ms 3584 KB
subtask1_04.txt AC 15 ms 3840 KB
subtask1_05.txt AC 17 ms 4096 KB
subtask1_06.txt AC 4 ms 2816 KB
subtask1_07.txt AC 40 ms 6144 KB
subtask1_08.txt AC 12 ms 3584 KB
subtask1_09.txt AC 24 ms 4736 KB
subtask1_10.txt AC 32 ms 5376 KB
subtask1_11.txt AC 15 ms 3840 KB
subtask1_12.txt AC 7 ms 3072 KB
subtask1_13.txt AC 4 ms 2816 KB
subtask1_14.txt AC 4 ms 2816 KB
subtask1_15.txt AC 40 ms 6144 KB
subtask1_16.txt AC 40 ms 6144 KB
subtask1_17.txt AC 40 ms 6144 KB
subtask1_18.txt AC 41 ms 6144 KB
subtask1_19.txt AC 41 ms 6144 KB
subtask1_20.txt AC 40 ms 6144 KB
subtask1_21.txt AC 40 ms 6144 KB
subtask1_22.txt AC 40 ms 6144 KB
subtask1_23.txt AC 41 ms 6144 KB
subtask1_24.txt AC 40 ms 6144 KB
subtask1_25.txt AC 40 ms 6144 KB
subtask1_26.txt AC 40 ms 6144 KB
subtask1_27.txt AC 41 ms 6144 KB
subtask1_28.txt AC 40 ms 6144 KB
subtask1_29.txt AC 40 ms 6144 KB
subtask1_30.txt AC 41 ms 6144 KB
subtask1_31.txt AC 41 ms 6144 KB
subtask1_32.txt AC 40 ms 6144 KB
subtask1_33.txt AC 41 ms 6144 KB
subtask1_34.txt AC 40 ms 6144 KB
subtask1_35.txt AC 40 ms 6144 KB
subtask1_36.txt AC 40 ms 6144 KB
subtask1_37.txt AC 40 ms 6144 KB
subtask1_38.txt AC 40 ms 6144 KB
subtask1_39.txt AC 40 ms 6144 KB