oj.uz

Submission #1038222

# Submission time Handle Problem Language Result Execution time Memory
1038222 2024-07-29T14:31:26 Z binminh01 Meetings 2 (JOI21_meetings2) C++17
100 / 100
 103 ms 80228 KB 
#include<bits/allocator.h>
#pragma GCC optimize("Ofast,unroll-loops")
#ifdef ONLINE_JUDGE
#pragma GCC target("avx2,fma,bmi,bmi2,popcnt,lzcnt")
#endif
 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define int128 __int128_t
#define double long double
#define gcd __gcd
#define lcm(a, b) ((a)/gcd(a, b)*(b))
#define sqrt sqrtl
#define log2 log2l
#define log10 log10l
#define floor floorl
#define to_string str
#define yes cout << "YES"
#define no cout << "NO"
#define trav(i, a) for (auto &i: (a))
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define sz(a) (int)a.size()
#define Max(a) *max_element(all(a))
#define Min(a) *min_element(all(a))
#define Find(a, n) (find(all(a), n) - a.begin())
#define Count(a, n) count(all(a), n)
#define Upper(a, n) (upper_bound(all(a), n) - a.begin())
#define Lower(a, n) (lower_bound(all(a), n) - a.begin())
#define next_perm(a) next_permutation(all(a))
#define prev_perm(a) prev_permutation(all(a))
#define sorted(a) is_sorted(all(a))
#define sum(a) accumulate(all(a), 0)
#define sumll(a) accumulate(all(a), 0ll)
#define Sort(a) sort(all(a))
#define Reverse(a) reverse(all(a))
#define Unique(a) Sort(a), (a).resize(unique(all(a)) - a.begin())
#define pb push_back
#define eb emplace_back
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll
#define clz __builtin_clz
#define clzll __buitlin_clzll
#define ctz __builtin_ctz
#define ctzll __builtin_ctzll
#define open(s) freopen(s, "r", stdin)
#define write(s) freopen(s, "w", stdout)
#define fileopen(s) open((string(s) + ".inp").c_str()), write((string(s) + ".out").c_str());
#define For(i, a, b) for (auto i = (a); i < (b); i++)
#define Fore(i, a, b) for (auto i = (a); i >= (b); i--)
#define FOR(i, a, b) for (auto i = (a); i <= (b); i++)
#define ret(s) return void(cout << s);

const int mod = 1e9 + 7, mod2 = 998244353;
const double PI = acos(-1), eps = 1e-9;
const ull npos = string::npos;
const int dx[] = {0, 0, -1, 1}, dy[] = {-1, 1, 0, 0};
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using cd = complex<double>;
mt19937 mt(chrono::system_clock::now().time_since_epoch().count());
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<double> vdo;
typedef vector<vdo> vvdo;
typedef vector<string> vs;
typedef vector<pii> vpair;
typedef vector<vpair> vvpair;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<cd> vcd;
typedef priority_queue<int> pq;
typedef priority_queue<int, vi, greater<int>> pqg;
typedef priority_queue<ll> pqll;
typedef priority_queue<ll, vll, greater<ll>> pqgll;

ll add(ll a, ll b, int m) {if (a >= m) a%=m;if (b >= m) b%=m;a+=b;return a >= m ? a - m: a;}
ll sub(ll a, ll b, int m) {if (a >= m) a%=m;if (b >= m) b%=m;a-=b;return a < 0 ? a + m: a;}
ll mul(ll a, ll b, int m) {if (a >= m) a%=m;if (b >= m) b%=m;return a*b % m;}
ll bin_mul(ll a, ll b, ll m) {if (a >= m) a%=m;if (b >= m) b%=m;ll x = 0;while (b) {if (b & 1) x = (x + a) % m;a = (a + a) % m;b>>=1;}return x;}
ll power(ll a, ll b, int m) {ll x = 1;if (a >= m) a%=m; while (b) {if (b & 1) x = x*a % m;a = a*a % m;b>>=1;}return x;}
ll power(ll a, ll b) {ll x = 1;while (b) {if (b & 1) x = x*a;a = a*a;b>>=1;}return x;}
ll ceil(ll a, ll b) {return (a + b - 1)/b;}
ll to_int(const string &s) {ll x = 0; for (int i = (s[0] == '-'); i < sz(s); i++) x = x*10 + s[i] - '0';return x*(s[0] == '-' ? -1: 1);}
bool is_prime(ll n) {if (n < 2) return 0;if (n < 4) return 1;if (n % 2 == 0 || n % 3 == 0) return 0;for (ll i = 5; i*i <= n; i+=6) {if(n % i == 0 || n % (i + 2) == 0) return 0;}return 1;}
bool is_square(ll n) {ll k = sqrt(n); return k*k == n;}
ll factorial(int n) {ll x = 1;for (int i = 2; i <= n; i++) x*=i;return x;}
ll factorial(int n, int m) {ll x = 1;for (ll i = 2; i <= n; i++) x = x*i % m;return x;}
bool is_power(ll n, ll k) {while (n % k == 0) n/=k;return n == 1ll;}
string str(ll n) {if (n == 0) return "0"; string s = ""; bool c = 0; if (n < 0) c = 1, n = -n; while (n) {s+=n % 10 + '0'; n/=10;} if (c) s+='-'; Reverse(s); return s;}
string repeat(const string &s, int n) {if (n < 0) return ""; string x = ""; while (n--) x+=s; return x;}
string bin(ll n) {string s = ""; while (n) {s+=(n & 1) + '0'; n>>=1;} Reverse(s); return s;}
void sieve(vector<bool> &a) {int n = a.size(); a[0] = a[1] = 0; for (int i = 4; i < n; i+=2) a[i] = 0; for (int i = 3; i*i < n; i+=2) {if (a[i]) {for (int j = i*i; j < n; j+=(i << 1)) a[j] = 0;}}}
void sieve(bool a[], int n) {a[0] = a[1] = 0; for (int i = 4; i < n; i+=2) a[i] = 0; for (int i = 3; i*i < n; i+=2) {if (a[i]) {for (int j = i*i; j < n; j+=(i << 1)) a[j] = 0;}}}
void sieve(vector<int> &a) {int n = a.size(); for (int i = 2; i < n; i+=2) a[i] = 2; for (int i = 3; i*i < n; i+=2) {if (!a[i]) {for (int j = i; j < n; j+=(i << 1)) a[j] = i;}} for (int i = 3; i < n; i+=2) {if (!a[i]) a[i] = i;}}
void sieve(int a[], int n) {for (int i = 2; i < n; i+=2) a[i] = 2; for (int i = 3; i*i < n; i+=2) {if (!a[i]) {for (int j = i; j < n; j+=(i << 1)) a[j] = i;}} for (int i = 3; i < n; i+=2) {if (!a[i]) a[i] = i;}}
vector<pii> factorize(int n) {vector<pii> a; for (int i = 2; i*i <= n; i++) {if (n % i == 0) {int k = 0; while (n % i == 0) k++, n/=i; a.emplace_back(i, k);}} if (n > 1) a.emplace_back(n, 1); return a;}
int rand(int l, int r) {return uniform_int_distribution<int>(l, r)(mt);}
int Log2(int n) {return 31 - __builtin_clz(n);}
template<class T> void compress(vector<T> &a) {vector<T> b; for (T &i: a) b.push_back(i); sort(all(b)); b.resize(unique(all(b)) - b.begin()); for (T &i: a) i = lower_bound(all(b), i) - b.begin() + 1;}

template<class A, class B> istream& operator>>(istream& in, pair<A, B> &p) {in >> p.first >> p.second; return in;}
template<class A, class B> ostream& operator<<(ostream& out, const pair<A, B> &p) {out << p.first << ' ' << p.second; return out;}
template<class T> istream& operator>>(istream& in, vector<T> &a) {for (auto &i: a) in >> i; return in;}
template<class T> ostream& operator<<(ostream& out, const vector<T> &a) {for (auto &i: a) out << i << ' '; return out;}
template<class T> istream& operator>>(istream& in, vector<vector<T>> &a) {for (auto &i: a) in >> i; return in;}
template<class T> ostream& operator<<(ostream& out, const vector<vector<T>> &a) {for (auto &i: a) out << i << '\n'; return out;}
template<class T> istream& operator>>(istream& in, deque<T> &a) {for (auto &i: a) in >> i; return in;}
template<class T> ostream& operator<<(ostream& out, const deque<T> &a) {for (auto &i: a) out << i << ' '; return out;}
// istream& operator>>(istream& in, __int128_t &a) {string s; in >> s; a = 0; for (auto &i: s) a = a*10 + (i - '0'); return in;}
// ostream& operator<<(ostream& out, __int128_t a) {string s = ""; while (a > 0) {s+=(int)(a % 10) + '0'; a/=10;} Reverse(s); out << s; return out;}

const int N = 4e5 + 3;
int n, in[N], h[N], f[N], s[20][N], sz[N], q[N], ti = 0;
vi g[N], e{0}, t{0}, w[N];
void dfs(int u, int p) {
    in[u] = ++ti;
    t.pb(u);
    f[u] = sz(e);
    e.pb(in[u]);
    sz[u] = 1;
    trav(v,g[u]){
        if (v != p) {
            h[v] = h[u] + 1;
            dfs(v, u);
            sz[u]+=sz[v];
            e.pb(in[u]);
        }
    }
}
void Dfs(int u, int p) {
    sz[u] = 1;
    trav(v,g[u]){
        if (v != p) {
            Dfs(v, u);
            sz[u]+=sz[v];
        }
    }
}
void sparse() {
    int n = sz(e) - 1;
    FOR(i,1,n) s[0][i] = e[i];
    FOR(i,1,19){
        FOR(j,1,n-(1<<i)+1) s[i][j] = min(s[i - 1][j], s[i - 1][j + (1 << (i - 1))]);
    }
}
int query(int l, int r) {
    int k = Log2(r - l + 1);
    return min(s[k][l], s[k][r - (1 << k) + 1]);
}
int lca(int u, int v) {
    u = f[u]; v = f[v];
    if (u > v) swap(u, v);
    return t[query(u, v)];
}
int dis(int u, int v) {
    int l = lca(u, v);
    return h[u] + h[v] - 2*h[l];
}
int centroid(int u, int p) {
    trav(v,g[u]){
        if (v != p && sz[v]*2 > n) return centroid(v, u);
    }
    return u;
}
int main() {
    ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    cout << fixed << setprecision(10);
    cin >> n;
    For(i,1,n){
        int u, v; cin >> u >> v;
        g[u].pb(v); g[v].pb(u);
    }
    Dfs(1, 0);
    int r = centroid(1, 0);
    dfs(r, 0); sparse();
    FOR(i,1,n) w[sz[i]].pb(i);
    int x = r, y = r, d = 0;
    Fore(i,n>>1,1){
        trav(v,w[i]){
            int a = dis(x, v), b = dis(y, v);
            if (d < a) y = v, d = a;
            else if (d < b) x = v, d = b;
        }
        q[i] = d + 1;
    }
    FOR(i,1,n) cout << (i & 1 ? 1: q[i >> 1]) << '\n';
    cerr << "\nProcess returned 0 (0x0)   execution time :  " << 0.001*clock() << " s";
    return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 27228 KB Output is correct
2 Correct 6 ms 29304 KB Output is correct
3 Correct 6 ms 31324 KB Output is correct
4 Correct 6 ms 33372 KB Output is correct
5 Correct 6 ms 33372 KB Output is correct
6 Correct 6 ms 33404 KB Output is correct
7 Correct 6 ms 33372 KB Output is correct
8 Correct 6 ms 33372 KB Output is correct
9 Correct 7 ms 33372 KB Output is correct
10 Correct 9 ms 33368 KB Output is correct
11 Correct 6 ms 33372 KB Output is correct
12 Correct 7 ms 33464 KB Output is correct
13 Correct 7 ms 33372 KB Output is correct
14 Correct 7 ms 33372 KB Output is correct
15 Correct 7 ms 33372 KB Output is correct
16 Correct 7 ms 33368 KB Output is correct
17 Correct 6 ms 33372 KB Output is correct
18 Correct 7 ms 33372 KB Output is correct
19 Correct 7 ms 33400 KB Output is correct
20 Correct 7 ms 33372 KB Output is correct
21 Correct 7 ms 33372 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 27228 KB Output is correct
2 Correct 6 ms 29304 KB Output is correct
3 Correct 6 ms 31324 KB Output is correct
4 Correct 6 ms 33372 KB Output is correct
5 Correct 6 ms 33372 KB Output is correct
6 Correct 6 ms 33404 KB Output is correct
7 Correct 6 ms 33372 KB Output is correct
8 Correct 6 ms 33372 KB Output is correct
9 Correct 7 ms 33372 KB Output is correct
10 Correct 9 ms 33368 KB Output is correct
11 Correct 6 ms 33372 KB Output is correct
12 Correct 7 ms 33464 KB Output is correct
13 Correct 7 ms 33372 KB Output is correct
14 Correct 7 ms 33372 KB Output is correct
15 Correct 7 ms 33372 KB Output is correct
16 Correct 7 ms 33368 KB Output is correct
17 Correct 6 ms 33372 KB Output is correct
18 Correct 7 ms 33372 KB Output is correct
19 Correct 7 ms 33400 KB Output is correct
20 Correct 7 ms 33372 KB Output is correct
21 Correct 7 ms 33372 KB Output is correct
22 Correct 10 ms 45912 KB Output is correct
23 Correct 11 ms 46028 KB Output is correct
24 Correct 11 ms 45912 KB Output is correct
25 Correct 9 ms 45916 KB Output is correct
26 Correct 9 ms 45916 KB Output is correct
27 Correct 9 ms 45952 KB Output is correct
28 Correct 9 ms 45940 KB Output is correct
29 Correct 9 ms 46024 KB Output is correct
30 Correct 9 ms 45916 KB Output is correct
31 Correct 8 ms 45916 KB Output is correct
32 Correct 9 ms 46172 KB Output is correct
33 Correct 9 ms 46064 KB Output is correct
34 Correct 9 ms 45916 KB Output is correct
35 Correct 8 ms 45916 KB Output is correct
36 Correct 9 ms 45916 KB Output is correct
37 Correct 8 ms 45948 KB Output is correct
38 Correct 9 ms 45936 KB Output is correct

Subtask #3
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 27228 KB Output is correct
2 Correct 6 ms 29304 KB Output is correct
3 Correct 6 ms 31324 KB Output is correct
4 Correct 6 ms 33372 KB Output is correct
5 Correct 6 ms 33372 KB Output is correct
6 Correct 6 ms 33404 KB Output is correct
7 Correct 6 ms 33372 KB Output is correct
8 Correct 6 ms 33372 KB Output is correct
9 Correct 7 ms 33372 KB Output is correct
10 Correct 9 ms 33368 KB Output is correct
11 Correct 6 ms 33372 KB Output is correct
12 Correct 7 ms 33464 KB Output is correct
13 Correct 7 ms 33372 KB Output is correct
14 Correct 7 ms 33372 KB Output is correct
15 Correct 7 ms 33372 KB Output is correct
16 Correct 7 ms 33368 KB Output is correct
17 Correct 6 ms 33372 KB Output is correct
18 Correct 7 ms 33372 KB Output is correct
19 Correct 7 ms 33400 KB Output is correct
20 Correct 7 ms 33372 KB Output is correct
21 Correct 7 ms 33372 KB Output is correct
22 Correct 10 ms 45912 KB Output is correct
23 Correct 11 ms 46028 KB Output is correct
24 Correct 11 ms 45912 KB Output is correct
25 Correct 9 ms 45916 KB Output is correct
26 Correct 9 ms 45916 KB Output is correct
27 Correct 9 ms 45952 KB Output is correct
28 Correct 9 ms 45940 KB Output is correct
29 Correct 9 ms 46024 KB Output is correct
30 Correct 9 ms 45916 KB Output is correct
31 Correct 8 ms 45916 KB Output is correct
32 Correct 9 ms 46172 KB Output is correct
33 Correct 9 ms 46064 KB Output is correct
34 Correct 9 ms 45916 KB Output is correct
35 Correct 8 ms 45916 KB Output is correct
36 Correct 9 ms 45916 KB Output is correct
37 Correct 8 ms 45948 KB Output is correct
38 Correct 9 ms 45936 KB Output is correct
39 Correct 80 ms 70076 KB Output is correct
40 Correct 89 ms 69440 KB Output is correct
41 Correct 87 ms 70844 KB Output is correct
42 Correct 90 ms 71096 KB Output is correct
43 Correct 81 ms 70844 KB Output is correct
44 Correct 82 ms 70324 KB Output is correct
45 Correct 103 ms 76724 KB Output is correct
46 Correct 102 ms 80228 KB Output is correct
47 Correct 72 ms 71616 KB Output is correct
48 Correct 71 ms 71404 KB Output is correct
49 Correct 75 ms 71388 KB Output is correct
50 Correct 67 ms 72132 KB Output is correct
51 Correct 77 ms 75200 KB Output is correct