Submission #58762799

Source Code Expand

#include <bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using namespace atcoder;
#define all(a) a.begin(),a.end()
typedef long long ll;
typedef pair<ll,ll> P;
constexpr ll mod=1000000009;
vector<int>G[100005];

void dfs(int now,int par,vector<int>&d){
    for(auto e:G[now]){
        if(e==par)continue;
        d[e]=d[now]+1;
        dfs(e,now,d);
    }
}

int main(){
    int n;cin>>n;
    rep(i,n-1){
        int a,b;cin>>a>>b;
        a--;b--;
        G[a].push_back(b);
        G[b].push_back(a);
    }
    vector<int>d1(n),d2(n);
    dfs(0,-1,d1);
    dfs(max_element(all(d1))-d1.begin(),-1,d2);
    cout<<1+(*max_element(all(d2)))<<endl;
}

Submission Info

Submission Time
Task 003 - Longest Circular Road（★4）
User Rho17
Language C++ 20 (gcc 12.2)
Score 4
Code Size 729 Byte
Status AC
Exec Time 57 ms
Memory 15584 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 4 / 4
Status
AC × 4
AC × 26
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt
Case Name Status Exec Time Memory
sample_01.txt AC 2 ms 3572 KiB
sample_02.txt AC 1 ms 3692 KiB
sample_03.txt AC 2 ms 3516 KiB
sample_04.txt AC 1 ms 3508 KiB
subtask_1_01.txt AC 1 ms 3512 KiB
subtask_1_02.txt AC 2 ms 3424 KiB
subtask_1_03.txt AC 2 ms 3580 KiB
subtask_1_04.txt AC 48 ms 8760 KiB
subtask_1_05.txt AC 36 ms 7784 KiB
subtask_1_06.txt AC 38 ms 7784 KiB
subtask_1_07.txt AC 2 ms 3528 KiB
subtask_1_08.txt AC 6 ms 4124 KiB
subtask_1_09.txt AC 5 ms 3860 KiB
subtask_1_10.txt AC 2 ms 3576 KiB
subtask_1_11.txt AC 1 ms 3532 KiB
subtask_1_12.txt AC 45 ms 8524 KiB
subtask_1_13.txt AC 13 ms 5132 KiB
subtask_1_14.txt AC 1 ms 3528 KiB
subtask_1_15.txt AC 5 ms 4088 KiB
subtask_1_16.txt AC 53 ms 9512 KiB
subtask_1_17.txt AC 52 ms 9440 KiB
subtask_1_18.txt AC 54 ms 9444 KiB
subtask_1_19.txt AC 55 ms 9680 KiB
subtask_1_20.txt AC 57 ms 9516 KiB
subtask_1_21.txt AC 45 ms 15584 KiB
subtask_1_22.txt AC 31 ms 9700 KiB