8966 | 2024. 02. 09 07:56:58 | RRoli | Kaktuszgráf | cpp17 | Elfogadva 50/50 | 4ms | 5560 KiB |
#include <iostream>
#include <cmath>
using namespace std;
int n, m, L[1001], ln = 2;
bool a[1001][1001];
void bejar(int k) {
for(int i = 1; i <= n; i++) {
if(a[k][i]) {
if(L[i] == -1) {
L[i] = L[k]+1;
bejar(i);
} else if(abs(L[i] - L[k])+1 > ln)
ln = abs(L[i] - L[k])+1;
}
}
}
int main()
{
cin >> n >> m;
for(int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
a[x][y] = true; a[y][x] = true;
}
for(int i = 1; i <= n; i++) L[i] = -1;
L[1] = 0;
bejar(1);
cout << ln;
return 0;
}
Részfeladat | Összpont | Teszt | Verdikt | Idő | Memória | ||
---|---|---|---|---|---|---|---|
base | 50/50 | ||||||
1 | Elfogadva | 0/0 | 3ms | 1896 KiB | |||
2 | Elfogadva | 0/0 | 3ms | 3088 KiB | |||
3 | Elfogadva | 2/2 | 4ms | 3536 KiB | |||
4 | Elfogadva | 2/2 | 4ms | 4032 KiB | |||
5 | Elfogadva | 2/2 | 4ms | 4180 KiB | |||
6 | Elfogadva | 2/2 | 4ms | 4428 KiB | |||
7 | Elfogadva | 2/2 | 4ms | 4804 KiB | |||
8 | Elfogadva | 2/2 | 4ms | 5048 KiB | |||
9 | Elfogadva | 2/2 | 4ms | 4920 KiB | |||
10 | Elfogadva | 2/2 | 4ms | 5060 KiB | |||
11 | Elfogadva | 2/2 | 4ms | 4960 KiB | |||
12 | Elfogadva | 2/2 | 4ms | 5100 KiB | |||
13 | Elfogadva | 2/2 | 4ms | 5096 KiB | |||
14 | Elfogadva | 2/2 | 4ms | 5116 KiB | |||
15 | Elfogadva | 2/2 | 4ms | 5132 KiB | |||
16 | Elfogadva | 2/2 | 4ms | 5416 KiB | |||
17 | Elfogadva | 2/2 | 4ms | 5324 KiB | |||
18 | Elfogadva | 2/2 | 4ms | 5256 KiB | |||
19 | Elfogadva | 3/3 | 4ms | 5268 KiB | |||
20 | Elfogadva | 3/3 | 4ms | 5448 KiB | |||
21 | Elfogadva | 3/3 | 4ms | 5456 KiB | |||
22 | Elfogadva | 3/3 | 4ms | 5472 KiB | |||
23 | Elfogadva | 3/3 | 4ms | 5472 KiB | |||
24 | Elfogadva | 3/3 | 4ms | 5560 KiB |