oj.uz

답안 #375890

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
375890 2021-03-10T08:01:47 Z topovik Papričice (COCI20_papricice) C++14
50 / 110
 1000 ms 14920 KB 
#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define len(x) x.size()
#define debug(x) cout << #x << " is " << x << endl

using namespace std;

typedef long long ll;
typedef long double ld;

const ll N = 1e6 + 100;
const ll oo = 1e9 + 7;

set <int> anc;
set <int> not_anc;

vector <vector <int> > a;

int sz[N];
int n;
int ans = oo;

int calc_sz(int x, int y)
{
    sz[x] = 1;
    for (int i = 0; i < len(a[x]); i++)
        if (a[x][i] != y) sz[x] += calc_sz(a[x][i], x);
    return sz[x];
}

void update(int x, int y, int z)
{
    ans = min(ans, max(max(x, y), z) - min(min(x, y), z));
}

void Check(int x)
{
    auto mn = lower_bound(anc.begin(), anc.end(), (n + sz[x]) / 2);
    auto mx = anc.end();
    if (mn != anc.begin() && !anc.empty()) {mx = --mn; mn++;}
    if (mn != anc.end()) update(sz[x], *mn - sz[x], n - *mn);
    if (mx != anc.end()) update(sz[x], *mx - sz[x], n - *mx);
    mn = lower_bound(not_anc.begin(), not_anc.end(), (n - sz[x]) / 2);
    mx = not_anc.end();
    if (mn != not_anc.begin() && !not_anc.empty()) {mx = --mn; mn++;}
    if (mn != not_anc.end()) update(sz[x], *mn, n - sz[x] - *mn);
    if (mx != not_anc.end()) update(sz[x], *mx, n - sz[x] - *mx);
}

void Rec(int x, int y)
{
    Check(x);
    anc.insert(sz[x]);
    for (int i = 0; i < len(a[x]); i++)
        if (a[x][i] != y) Rec(a[x][i], x);
    not_anc.insert(sz[x]);
    anc.erase(sz[x]);
}

int main()
{
    cin >> n;
    a.resize(n);
    for (int i = 0; i < n - 1; i++)
    {
        int x, y;
        cin >> x >> y;
        a[--x].pb(--y);
        a[y].pb(x);
    }
    calc_sz(0, 0);
    Rec(0, 0);
    cout << ans;
}

Compilation message

papricice.cpp: In function 'int calc_sz(int, int)':
papricice.cpp:28:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |     for (int i = 0; i < len(a[x]); i++)
      |                       ^
papricice.cpp: In function 'void Rec(int, int)':
papricice.cpp:56:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |     for (int i = 0; i < len(a[x]); i++)
      |                       ^

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct

Subtask #2
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 3 ms 492 KB Output is correct
7 Correct 8 ms 492 KB Output is correct
8 Correct 4 ms 492 KB Output is correct
9 Correct 4 ms 492 KB Output is correct
10 Correct 5 ms 512 KB Output is correct

Subtask #3
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 3 ms 492 KB Output is correct
7 Correct 8 ms 492 KB Output is correct
8 Correct 4 ms 492 KB Output is correct
9 Correct 4 ms 492 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Execution timed out 1069 ms 14920 KB Time limit exceeded
12 Halted 0 ms 0 KB -