oj.uz

Submission #341326

# Submission time Handle Problem Language Result Execution time Memory
341326 2020-12-29T13:23:50 Z IZhO_2021_I_want_Silver Shymbulak (IZhO14_shymbulak) C++14
0 / 100
 1500 ms 8556 KB 
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <iomanip>
#include <cassert>
#include <stack>
#include <queue>
#include <deque>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>-

using namespace std;
//using namespace __gnu_pbds;

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

// template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//  order_of_key (k) : Number of items strictly smaller than k .
//  find_by_order(k) : K-th element in a set (counting from zero).
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define pb push_back
#define ppb pop_back
#define mkp make_pair
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define show(a) cerr << #a <<" -> "<< a <<" "
#define nl cerr <<"\n"
//#define int ll

const int N = 2e5 + 5;
const int oo = 1e9 + 5;

int n, d[N], mx, ans, cnt[N];
vector <int> g[N];
queue <int> q;

void solve() {
    cin >> n;
    for (int i = 1; i <= n; ++i) {
        int a, b;
        cin >> a >> b;
        g[a].pb(b);
        g[b].pb(a);
    }
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) { d[j] = oo; }
        d[i] = 0;
        q.push(i);
        while (sz(q)) {
            int v = q.front();
            q.pop();
            for (int to : g[v]) {
                if (d[to] >  d[v] + 1) {
                    d[to] = d[v] + 1;
                    q.push(to);
                }
            }
        }
        for (int j = 1; j <= n; ++j) { mx = max(mx, d[j]); }
    }
    //show(mx); nl;
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) { d[j] = oo; }
        d[i] = 0;
        q.push(i);
        while (sz(q)) {
            int v = q.front();
            q.pop();
            for (int to : g[v]) {
                if (d[to] >  d[v] + 1) {
                    d[to] = d[v] + 1;
                    q.push(to);
                }
            }
        }
        for (int j = 1; j <= n; ++j) {
            if (mx == d[j]) { ++ans; }
        }
    }
    for (int i = 1;  i <= n; ++i) {
        cnt[i] = sz(g[i]);
        if (sz(g[i]) == 1) {
            --cnt[i];
            q.push(i);
        }
    }
    while(sz(q)) {
        int v = q.front();
        q.pop();
        for (int to : g[v]) {
            --cnt[to];
            if (cnt[to] == 1) {
                q.push(to);
            }
        }
    }
    int len = 0;
    for (int i = 1; i <= n; ++i) {
        //assert(cnt[i] == 0 || cnt[i] == 2);
        if (cnt[i]) { ++len; }
    }
    if (len & 1) { ans >>= 1; }
    cout << ans;
}

 main () {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int tests = 1;
	//cin >> tests;
	while (tests --) {
		solve();
	}
	return 0;
}
/*
    Just Chalish!
*/

Compilation message

shymbulak.cpp:114:8: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  114 |  main () {
      |        ^

Subtask #1
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5100 KB Output is correct
2 Correct 4 ms 5100 KB Output is correct
3 Correct 4 ms 5100 KB Output is correct
4 Correct 4 ms 5100 KB Output is correct
5 Correct 4 ms 5100 KB Output is correct
6 Incorrect 4 ms 5100 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 5100 KB Output is correct
2 Correct 18 ms 5100 KB Output is correct
3 Correct 36 ms 5100 KB Output is correct
4 Incorrect 38 ms 5228 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1593 ms 8556 KB Time limit exceeded
2 Halted 0 ms 0 KB -