oj.uz

답안 #692287

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
692287 2023-02-01T09:44:24 Z Farhan_HY Cijanobakterije (COCI21_cijanobakterije) C++14
70 / 70
 66 ms 42300 KB 
#include <bits/stdc++.h>
#define int long long
#define float double
#define pb push_back
#define F first
#define S second
#define T int t; cin >> t; while(t--)
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

using namespace std;
/// Benzema is the best player in the world
const int N = 1e6 + 6;
const int M = 1e3 + 3;
const int mod = 1e9 + 7;
const int inf = 1e9;
const int dx[] = {-1, 1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const int LOG = 25;
int n, m, dp[N], pars[N];
vector<int> adj[N];

int Rec(int node, int par) {
    if (adj[node].size() == 1) return 1;
    int &ret = dp[node];
    if (ret != -1) return ret;
    ret = 0;
    for(auto x: adj[node]) {
        if (x != par)
            ret = max(ret, Rec(x, node) + 1);
    }
    return ret;
}
vector<int> vec;
bool vis[N];
void dfs(int node, int par) {
    vec.push_back(node);
    pars[node] = par;
    vis[node] = 1;
    for(auto x: adj[node]) {
        if (x != par)
            dfs(x, node);
    }
}

main() {
    IOS
    cin >> n >> m;
    for(int i = 1; i <= m; i++) {
        int u, v;
        cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    memset(dp, -1, sizeof dp);
    int ans = 0;
    for(int i = 1; i <= n; i++) {
        if (vis[i]) continue;
        vec.clear();
        dfs(i, 0);
        int mx = 0;
        for(auto node: vec) {
            int mx1 = 0, mx2 = 0;
            for(auto x: adj[node]) {
                if (pars[x] != node) continue;
                if (Rec(x, node) > mx1) mx2 = mx1, mx1 = Rec(x, node);
                else if (Rec(x, node) > mx2) mx2 = Rec(x, node);
            }
            mx = max(mx, mx1 + mx2 + 1);
        }
        ans += mx;
    }
    cout << ans;
}

Compilation message

Main.cpp:45:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   45 | main() {
      | ^~~~

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 32972 KB Output is correct
2 Correct 35 ms 34188 KB Output is correct
3 Correct 45 ms 35132 KB Output is correct
4 Correct 43 ms 36524 KB Output is correct
5 Correct 58 ms 37572 KB Output is correct
6 Correct 64 ms 38580 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 42300 KB Output is correct
2 Correct 19 ms 32168 KB Output is correct
3 Correct 22 ms 32780 KB Output is correct
4 Correct 24 ms 33536 KB Output is correct

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 31572 KB Output is correct
2 Correct 15 ms 31600 KB Output is correct
3 Correct 16 ms 31620 KB Output is correct
4 Correct 16 ms 31644 KB Output is correct
5 Correct 19 ms 32596 KB Output is correct
6 Correct 23 ms 33580 KB Output is correct
7 Correct 24 ms 34892 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 31700 KB Output is correct
2 Correct 17 ms 31620 KB Output is correct
3 Correct 19 ms 31680 KB Output is correct
4 Correct 17 ms 31648 KB Output is correct
5 Correct 17 ms 31632 KB Output is correct
6 Correct 16 ms 31660 KB Output is correct
7 Correct 20 ms 31572 KB Output is correct
8 Correct 17 ms 31572 KB Output is correct
9 Correct 15 ms 31660 KB Output is correct
10 Correct 16 ms 31604 KB Output is correct
11 Correct 16 ms 31572 KB Output is correct

Subtask #5
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 32972 KB Output is correct
2 Correct 35 ms 34188 KB Output is correct
3 Correct 45 ms 35132 KB Output is correct
4 Correct 43 ms 36524 KB Output is correct
5 Correct 58 ms 37572 KB Output is correct
6 Correct 64 ms 38580 KB Output is correct
7 Correct 46 ms 42300 KB Output is correct
8 Correct 19 ms 32168 KB Output is correct
9 Correct 22 ms 32780 KB Output is correct
10 Correct 24 ms 33536 KB Output is correct
11 Correct 15 ms 31572 KB Output is correct
12 Correct 15 ms 31600 KB Output is correct
13 Correct 16 ms 31620 KB Output is correct
14 Correct 16 ms 31644 KB Output is correct
15 Correct 19 ms 32596 KB Output is correct
16 Correct 23 ms 33580 KB Output is correct
17 Correct 24 ms 34892 KB Output is correct
18 Correct 17 ms 31700 KB Output is correct
19 Correct 17 ms 31620 KB Output is correct
20 Correct 19 ms 31680 KB Output is correct
21 Correct 17 ms 31648 KB Output is correct
22 Correct 17 ms 31632 KB Output is correct
23 Correct 16 ms 31660 KB Output is correct
24 Correct 20 ms 31572 KB Output is correct
25 Correct 17 ms 31572 KB Output is correct
26 Correct 15 ms 31660 KB Output is correct
27 Correct 16 ms 31604 KB Output is correct
28 Correct 16 ms 31572 KB Output is correct
29 Correct 64 ms 38468 KB Output is correct
30 Correct 25 ms 33576 KB Output is correct
31 Correct 43 ms 36356 KB Output is correct
32 Correct 33 ms 34436 KB Output is correct
33 Correct 59 ms 36992 KB Output is correct
34 Correct 37 ms 35140 KB Output is correct
35 Correct 45 ms 36604 KB Output is correct
36 Correct 51 ms 36512 KB Output is correct
37 Correct 49 ms 37016 KB Output is correct
38 Correct 66 ms 37704 KB Output is correct
39 Correct 53 ms 36644 KB Output is correct