151642025-02-14 12:06:35ercseferencKaktuszgráfcpp17Accepted 50/502ms636 KiB
#include <bits/stdc++.h>
using namespace std;
vector<int>pont[1500];
int el[1500],maxi=0;
void mely(int n){
    for(auto& i:pont[n]){
        if(el[i]==-1){
            el[i]=el[n]+1;
            mely(i);}
        else if(el[i]-el[n]>1){
            maxi=max(maxi, el[i]-el[n]+1);}}}
int main()
{
    int n,m,x,y;
    cin>>n>>m;
    fill(el,el+1500,-1);
    for(int i=0; i<m; i++){cin>>x>>y;
        pont[x-1].push_back(y-1);
        pont[y-1].push_back(x-1);}
    el[0]=0; mely(0);
    cout<<maxi;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/01ms516 KiB
3Accepted2/21ms508 KiB
4Accepted2/22ms316 KiB
5Accepted2/22ms316 KiB
6Accepted2/22ms316 KiB
7Accepted2/22ms316 KiB
8Accepted2/22ms316 KiB
9Accepted2/22ms316 KiB
10Accepted2/22ms316 KiB
11Accepted2/22ms468 KiB
12Accepted2/22ms472 KiB
13Accepted2/21ms316 KiB
14Accepted2/22ms316 KiB
15Accepted2/22ms316 KiB
16Accepted2/22ms544 KiB
17Accepted2/22ms508 KiB
18Accepted2/22ms500 KiB
19Accepted3/32ms508 KiB
20Accepted3/32ms316 KiB
21Accepted3/32ms360 KiB
22Accepted3/32ms636 KiB
23Accepted3/32ms472 KiB
24Accepted3/32ms316 KiB