제출 #900565

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
900565		HamzaT	Cijanobakterije (COCI21_cijanobakterije)	C++14	12 / 70	23 ms	16464 KiB

Main

//struct Edge {int u, v, weight;bool operator<(Edge const& other) {return weight < other.weight;}};
#include <bits/stdc++.h>
#define endl "\n"
#define ll long long
#define sp ' '
#define pb push_back
#define ar for(int i=1;i<=n;i++)
using namespace std;
ll t=1;
const ll N=3e5+100;
ll n,m,q,k;
ll a[N],b[N],c[N];
bool vis[N];
ll mx=0;
vector<int>v[N];
void dfs(ll x,ll y)
{
    vis[x]=1;mx=max(mx,y);
    for(auto i:v[x])
    {
        if(!vis[i]){dfs(i,y+1);}
    }
}
ll ans=0;
void solve()
{
    cin>>n>>m;
    while(m--)
    {
        ll x,y;cin>>x>>y;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    for(int i=1;i<=n;i++)
    {
        if(!vis[i]&&v[i].size()<=1)
        {mx=0;
            dfs(i,1);
            ans+=mx;
        }
    }
    cout<<ans<<endl;return;
}
int main()
{
    //freopen("shell.in", "r", stdin);
   // freopen("shell.out", "w", stdout);
    ios::sync_with_stdio(NULL);
    cin.tie(NULL);cout.tie(NULL);
    // cin>>t;
    while(t--){solve();}
    return 0;
}
//09:00 :: 9:45
//10:30 ::

• Subtask 1: 0 / 15
• Subtask 2: 6 / 6
• Subtask 3: 6 / 6
• Subtask 4: 0 / 15
• Subtask 5: 0 / 28