Submission #922348

#	Time	Username	Problem	Language	Result	Execution time	Memory
922348		Shayan86	Cijanobakterije (COCI21_cijanobakterije)	C++14	70 / 70	28 ms	11356 KiB

Main

#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// Ofast, O0, O1, O2, O3, unroll-loops, fast-math, trapv

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;

#define Mp          make_pair
#define sep         ' '
#define endl        '\n'
#define F	        first
#define S	        second
#define pb          push_back
#define all(x)      (x).begin(),(x).end()
#define kill(res)	cout << res << '\n', exit(0);
#define set_dec(x)	cout << fixed << setprecision(x);
#define fast_io     ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io     freopen("input.txt", "r", stdin) ; freopen("output.txt", "w", stdout);

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const ll N = 1e5 + 50;
const ll Mod = 1e9 + 7;

ll n, m;

bool mark[N];
vector<int> adj[N];

pii far(int v, int p = 0, int h = 0){
    mark[v] = true;
    pii out = Mp(h, v);
    for(int u: adj[v]){
        if(u == p) continue;
        out = max(out, far(u, v, h+1));
    }
    return out;
}

int main(){
    fast_io;

    cin >> n >> m;

    int u, v;
    for(int i = 1; i <= m; i++){
        cin >> u >> v;
        adj[u].pb(v);
        adj[v].pb(u);
    }

    ll res = 0;
    for(int i = 1; i <= n; i++){
        if(!mark[i]){
            v = far(i).S;
            res += far(v).F + 1;
        }
    }

    cout << res << endl;

}

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