oj.uz

답안 #530929

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
530929 2022-02-27T06:50:39 Z Slavita Cijanobakterije (COCI21_cijanobakterije) C++14
70 / 70
 50 ms 13644 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define ve vector<int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pi pair<int,int>
#define all(v) v.begin(),v.end()
#define si(v) (int)v.size()
#define en '\n'
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ordered_muiltiset tree<int, null_type,less_equal<>, rb_tree_tag,tree_order_statistics_node_update>
//#define int long long
using namespace std;
//using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned long long ull;

const int N = 1e5 + 228;
const int big = 1e9;
//ordered_set os; // os.order_of_key(4), (*os.find_by_order(5))
int n, m, ans, k, gv, mxg;
bool mrk[N];
ve g[N];

void dfs(int v, int pr, int gl, bool mark){
    if (mark) mrk[v] = 1;
    if (gl > mxg){
        mxg = gl;
        gv = v;
    }

    for (int i = 0; i < si(g[v]); i++){
        int u = g[v][i];
        if (pr == u) continue;
        dfs(u, v, gl + 1, mark);
    }
}

//#undef int
int main(){
    //#define int long long
    iostream::sync_with_stdio(false); cin.tie(0); ios_base::sync_with_stdio(false); cout.tie(0);
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    cin >> n >> m;
    for (int i = 1; i <= m; i++){
        int a, b;
        cin >> a >> b;
        g[a].pb(b);
        g[b].pb(a);
    }

    for (int i = 1; i <= n; i++){
        if (!mrk[i]){
            mxg = -1;
            gv = 0;
            dfs(i, -1, 0, 1);

            int root = gv;
            mxg = -1;
            gv = 0;
            dfs(root, -1, 0, 0);
            ans += mxg + 1;
        }
    }
    cout << ans;
    return 0;
}
/*
*/

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 3148 KB Output is correct
2 Correct 19 ms 3784 KB Output is correct
3 Correct 31 ms 4240 KB Output is correct
4 Correct 29 ms 4852 KB Output is correct
5 Correct 35 ms 5364 KB Output is correct
6 Correct 45 ms 5876 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 13644 KB Output is correct
2 Correct 4 ms 3068 KB Output is correct
3 Correct 12 ms 3672 KB Output is correct
4 Correct 10 ms 4056 KB Output is correct

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 3 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 3 ms 2636 KB Output is correct
5 Correct 8 ms 3148 KB Output is correct
6 Correct 8 ms 3836 KB Output is correct
7 Correct 13 ms 4472 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2680 KB Output is correct
4 Correct 2 ms 2672 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 1 ms 2636 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 2 ms 2684 KB Output is correct
9 Correct 3 ms 2636 KB Output is correct
10 Correct 3 ms 2684 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct

Subtask #5
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 3148 KB Output is correct
2 Correct 19 ms 3784 KB Output is correct
3 Correct 31 ms 4240 KB Output is correct
4 Correct 29 ms 4852 KB Output is correct
5 Correct 35 ms 5364 KB Output is correct
6 Correct 45 ms 5876 KB Output is correct
7 Correct 34 ms 13644 KB Output is correct
8 Correct 4 ms 3068 KB Output is correct
9 Correct 12 ms 3672 KB Output is correct
10 Correct 10 ms 4056 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 3 ms 2636 KB Output is correct
13 Correct 2 ms 2636 KB Output is correct
14 Correct 3 ms 2636 KB Output is correct
15 Correct 8 ms 3148 KB Output is correct
16 Correct 8 ms 3836 KB Output is correct
17 Correct 13 ms 4472 KB Output is correct
18 Correct 2 ms 2636 KB Output is correct
19 Correct 2 ms 2636 KB Output is correct
20 Correct 2 ms 2680 KB Output is correct
21 Correct 2 ms 2672 KB Output is correct
22 Correct 2 ms 2636 KB Output is correct
23 Correct 1 ms 2636 KB Output is correct
24 Correct 2 ms 2636 KB Output is correct
25 Correct 2 ms 2684 KB Output is correct
26 Correct 3 ms 2636 KB Output is correct
27 Correct 3 ms 2684 KB Output is correct
28 Correct 2 ms 2636 KB Output is correct
29 Correct 50 ms 7108 KB Output is correct
30 Correct 9 ms 3728 KB Output is correct
31 Correct 24 ms 6532 KB Output is correct
32 Correct 16 ms 4556 KB Output is correct
33 Correct 32 ms 6900 KB Output is correct
34 Correct 40 ms 5280 KB Output is correct
35 Correct 49 ms 6688 KB Output is correct
36 Correct 39 ms 5880 KB Output is correct
37 Correct 32 ms 6924 KB Output is correct
38 Correct 36 ms 6348 KB Output is correct
39 Correct 29 ms 6780 KB Output is correct