oj.uz

답안 #698423

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
698423 2023-02-13T12:42:04 Z Filya Cijanobakterije (COCI21_cijanobakterije) C++14
70 / 70
 55 ms 15172 KB 
/////////////////////include/////////////////////
//#include <bits/stdc++.h>
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cassert>
#include <set>
#include <map>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stdio.h>
#include <climits>
#include <numeric>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//template <typename T>
//using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
/////////////////////define/////////////////////
#define ci(x) if(x) cout << "YES" << '\n'; else cout << "NO" << '\n';
#define cii(x) if(check(x))
#define MOD 1000000007
#define MOD2 998244353
#define oo 1e9
#define ool 1e18L
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mii map<int, int>
#define vi vector<int>
#define vpi vector<pair<int, int>>
#define vll vector <ll>
#define ff first
#define ss second
#define mp make_pair
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define sz(x) (int((x).size()))
#define all(x) (x).begin(), (x).end()
#define alll(x) (x), (x) + n
#define clr(x) (x).clear();
#define fri(x) for(int i = 0; i < x; ++i)
#define frj(x) for(int j = 0; j < x; ++j)
#define frp(x) for(int p = 0; p < x; ++p)
#define frr(a, b) for(int i = a; i < b; ++i)
#define frrj(a, b) for(int j = a; j < b; ++j)
#define fra(x) for(int i = 0; i < x; ++i) cin >> a[i];
#define frb(x) for(int i = 0; i < x; ++i) cin >> b[i];
#define frs(x) for(auto it = x.begin(); it != x.end(); ++it)
#define fr(x) for(auto it : x) //el
#define fastio ios_base::sync_with_stdio(false); cin.tie(0);
#define dbg(x) cerr << #x << ": " << x << endl;
#define ce(x) cout << x << endl;
#define uniq(x) x.resize(unique(all(x)) - x.begin()); //make all one after sorting
#define blt __builtin_popcount
/////////////////////print array, vector, deque, set, multiset, pair, map /////////////////////
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]"; cout << endl;}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(stack <T> v) {cerr << "[ "; stack<T> s = v; while(s.size()) {T i = s.top(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(queue <T> v) {cerr << "[ "; queue<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(deque <T> v) {cerr << "[ "; deque<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop_front(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
/////////////////////code/////////////////////
const int N = 100005;
int a[N];
vi g[N];
int id, used[N], d[N];
vi comp[N];
void dfs(int v, int p) {
    d[v] = d[p] + 1;
    used[v] = 1;
    comp[id].pb(v);
    for(int u : g[v]) 
        if(u != p) 
            dfs(u, v);
}
void dfs1(int v, int p) {
    for(int u : g[v]) 
        if(u != p) {
            d[u] = d[v] + 1;
            dfs1(u, v);
        }
}
int main() {
    fastio;
    int n, m, q, x, y;
    cin >> n >> m;
    fri(m) {
        cin >> x >> y;
        g[x].pb(y);
        g[y].pb(x);
    }
    ll sum = 0; int maxi;
    frr(1, 1 + n) 
        if(!used[i]) {
            id++;
            dfs(i, i);
            maxi = comp[id][0];
            for(int x : comp[id])
                if(d[x] > d[maxi])
                    maxi = x;
            d[maxi] = 0;
            dfs1(maxi, maxi);
            maxi = 0;
            for(int x : comp[id])
                maxi = max(maxi, d[x]);
            sum += maxi;
        }
    cout << id + sum;
    return 0;
}

//	           ♥ ♥ ♥  ♥  ♥    ♥   ♥    ♥
//	           ♥      ♥  ♥     ♥ ♥    ♥ ♥
//	           ♥ ♥ ♥  ♥  ♥      ♥    ♥   ♥
//	           ♥      ♥  ♥      ♥   ♥ ♥ ♥ ♥
//	           ♥      ♥  ♥ ♥ ♥  ♥  ♥       ♥
//
//        God loves Fil, Fil accepts God's will

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:110:15: warning: unused variable 'q' [-Wunused-variable]
  110 |     int n, m, q, x, y;
      |               ^

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 5972 KB Output is correct
2 Correct 15 ms 7124 KB Output is correct
3 Correct 22 ms 7992 KB Output is correct
4 Correct 26 ms 9124 KB Output is correct
5 Correct 35 ms 9928 KB Output is correct
6 Correct 53 ms 10768 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 15172 KB Output is correct
2 Correct 7 ms 5844 KB Output is correct
3 Correct 8 ms 6704 KB Output is correct
4 Correct 11 ms 7612 KB Output is correct

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 7 ms 5824 KB Output is correct
6 Correct 10 ms 6768 KB Output is correct
7 Correct 13 ms 7544 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5036 KB Output is correct
2 Correct 3 ms 5024 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 5028 KB Output is correct
5 Correct 3 ms 5028 KB Output is correct
6 Correct 3 ms 5028 KB Output is correct
7 Correct 3 ms 5028 KB Output is correct
8 Correct 4 ms 5032 KB Output is correct
9 Correct 3 ms 5076 KB Output is correct
10 Correct 3 ms 5076 KB Output is correct
11 Correct 3 ms 5076 KB Output is correct

Subtask #5
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 5972 KB Output is correct
2 Correct 15 ms 7124 KB Output is correct
3 Correct 22 ms 7992 KB Output is correct
4 Correct 26 ms 9124 KB Output is correct
5 Correct 35 ms 9928 KB Output is correct
6 Correct 53 ms 10768 KB Output is correct
7 Correct 41 ms 15172 KB Output is correct
8 Correct 7 ms 5844 KB Output is correct
9 Correct 8 ms 6704 KB Output is correct
10 Correct 11 ms 7612 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 7 ms 5824 KB Output is correct
16 Correct 10 ms 6768 KB Output is correct
17 Correct 13 ms 7544 KB Output is correct
18 Correct 4 ms 5036 KB Output is correct
19 Correct 3 ms 5024 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 5028 KB Output is correct
22 Correct 3 ms 5028 KB Output is correct
23 Correct 3 ms 5028 KB Output is correct
24 Correct 3 ms 5028 KB Output is correct
25 Correct 4 ms 5032 KB Output is correct
26 Correct 3 ms 5076 KB Output is correct
27 Correct 3 ms 5076 KB Output is correct
28 Correct 3 ms 5076 KB Output is correct
29 Correct 55 ms 10796 KB Output is correct
30 Correct 14 ms 9396 KB Output is correct
31 Correct 38 ms 10660 KB Output is correct
32 Correct 20 ms 9812 KB Output is correct
33 Correct 34 ms 10696 KB Output is correct
34 Correct 28 ms 10004 KB Output is correct
35 Correct 31 ms 10528 KB Output is correct
36 Correct 32 ms 10168 KB Output is correct
37 Correct 35 ms 10700 KB Output is correct
38 Correct 43 ms 10204 KB Output is correct
39 Correct 38 ms 10660 KB Output is correct