2828 2023. 01. 28 16:39:09 1478 Kaktuszgráf cpp17 Elfogadva 50/50 3ms 4328 KiB
#include <bits/stdc++.h>
#include <random>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> p32;
typedef pair<ll, ll> p64;
typedef pair<double, double> pdd;
typedef vector<ll> v64;
typedef vector<int> v32;
typedef vector<vector<int>> vv32;
typedef vector<vector<ll>> vv64;
typedef vector<vector<p64>> vvp64;
typedef vector<p64> vp64;
typedef vector<p32> vp32;
ll MOD = 998244353;
double eps = 1e-12;
#define forn(i, e) for (ll i = 0; i < e; i++)
#define forsn(i, s, e) for (ll i = s; i < e; i++)
#define rforn(i, s) for (ll i = s; i >= 0; i--)
#define rforsn(i, s, e) for (ll i = s; i >= e; i--)
#define ln "\n"
#define dbg(x) cout << #x << " = " << x << ln
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define INF 2e18
#define fast_cin()                    \
    ios_base::sync_with_stdio(false); \
    cin.tie(NULL);                    \
    cout.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())

int main()
{
    fast_cin();
    //ifstream cin("in.txt");

    int n;
    cin >> n;

    int m;
    cin >> m;

    vector<vector<int>> vList(n + 1);

    for (int i = 1; i <= m; i++)
    {
        int v1, v2;
        cin >> v1 >> v2;
        vList[v1].push_back(v2);
        vList[v2].push_back(v1);
    }

    int ans = 0;
    vector<bool> in(n + 1);
    vector<int> stackInd(n + 1);
    stack<int> s;

    s.push(1);
    in[1] = 1;
    stackInd[1] = 1;

    while (!s.empty())
    {
        int v = s.top();
        s.pop();
        in[v] = 1;

        //cout << v << ": " << '\n';

        for (int nextV : vList[v])
        {
            //cout << nextV << " ";
            if (!in[nextV])
            {
                s.push(nextV);
                stackInd[nextV] = stackInd[v] + 1;
            }
            else
            {
                if (in[v])
                {
                    ans = max(ans, stackInd[v] - stackInd[nextV] + 1);
                }
            }
        }
        //cout << '\n';
    }

    cout << ans;

    return 0;
}
Részfeladat Összpont Teszt Verdikt Idő Memória
base 50/50
1 Elfogadva 0/0 3ms 2100 KiB
2 Elfogadva 0/0 2ms 2400 KiB
3 Elfogadva 2/2 2ms 2664 KiB
4 Elfogadva 2/2 2ms 2744 KiB
5 Elfogadva 2/2 2ms 2920 KiB
6 Elfogadva 2/2 2ms 3104 KiB
7 Elfogadva 2/2 2ms 3312 KiB
8 Elfogadva 2/2 2ms 3268 KiB
9 Elfogadva 2/2 3ms 3520 KiB
10 Elfogadva 2/2 2ms 3456 KiB
11 Elfogadva 2/2 3ms 3740 KiB
12 Elfogadva 2/2 2ms 3656 KiB
13 Elfogadva 2/2 2ms 3596 KiB
14 Elfogadva 2/2 3ms 3592 KiB
15 Elfogadva 2/2 3ms 3880 KiB
16 Elfogadva 2/2 3ms 3888 KiB
17 Elfogadva 2/2 3ms 4148 KiB
18 Elfogadva 2/2 3ms 4328 KiB
19 Elfogadva 3/3 2ms 4032 KiB
20 Elfogadva 3/3 3ms 4292 KiB
21 Elfogadva 3/3 2ms 4236 KiB
22 Elfogadva 3/3 2ms 4180 KiB
23 Elfogadva 3/3 2ms 4180 KiB
24 Elfogadva 3/3 2ms 4144 KiB