oj.uz

답안 #383083

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
383083 2021-03-28T19:33:57 Z smax Dynamite (POI11_dyn) C++17
100 / 100
 1484 ms 33556 KB 
#include <bits/stdc++.h>
using namespace std;

#ifdef LOCAL
#define DEBUG(...) debug(#__VA_ARGS__, __VA_ARGS__)
#else
#define DEBUG(...) 6
#endif

template<typename T, typename S> ostream& operator << (ostream &os, const pair<T, S> &p) {return os << "(" << p.first << ", " << p.second << ")";}
template<typename C, typename T = decay<decltype(*begin(declval<C>()))>, typename enable_if<!is_same<C, string>::value>::type* = nullptr>
ostream& operator << (ostream &os, const C &c) {bool f = true; os << "["; for (const auto &x : c) {if (!f) os << ", "; f = false; os << x;} return os << "]";}
template<typename T> void debug(string s, T x) {cerr << s << " = " << x << "\n";}
template <typename T, typename... Args> void debug(string s, T x, Args... args) {for (int i=0, b=0; i<(int)s.size(); i++) if (s[i] == '(' || s[i] == '{') b++; else
if (s[i] == ')' || s[i] == '}') b--; else if (s[i] == ',' && b == 0) {cerr << s.substr(0, i) << " = " << x << " | "; debug(s.substr(s.find_first_not_of(' ', i + 1)), args...); break;}}

const int INF = 1e9;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n, m;
    cin >> n >> m;
    vector<int> d(n);
    for (int i=0; i<n; i++)
        cin >> d[i];
    vector<vector<int>> adj(n);
    for (int i=0; i<n-1; i++) {
        int a, b;
        cin >> a >> b;
        a--, b--;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }

    int k, cnt;

    auto dfs = [&] (auto &self, int u, int p) -> int {
        int ret = d[u] ? 0 : INF;
        for (int v : adj[u])
            if (v != p) {
                int d = self(self, v, u);
                if (ret > d)
                    swap(ret, d);
                if (ret <= 0 && d > 0 && d - ret <= k)
                    ret = d;
            }
        if (ret == -k) {
            cnt++;
            ret = 1;
        } else if (ret <= 0) {
            ret--;
        } else {
            ret++;
        }
        return ret;
    };

    int l = 0, r = n;
    while (l < r) {
        k = (l + r) / 2;
        cnt = 0;
        if (dfs(dfs, 0, -1) < 0)
            cnt++;
        if (cnt <= m)
            r = k;
        else
            l = k + 1;
    }
    cout << l << "\n";

    return 0;
}

Subtask #1
10.0 / 10.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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 1132 KB Output is correct
2 Correct 27 ms 2028 KB Output is correct
3 Correct 29 ms 2540 KB Output is correct
4 Correct 40 ms 4204 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 4204 KB Output is correct
2 Correct 89 ms 5692 KB Output is correct
3 Correct 143 ms 6252 KB Output is correct
4 Correct 132 ms 8940 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 157 ms 7788 KB Output is correct
2 Correct 222 ms 8044 KB Output is correct
3 Correct 211 ms 7532 KB Output is correct
4 Correct 313 ms 13148 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 637 ms 15468 KB Output is correct
2 Correct 778 ms 18024 KB Output is correct
3 Correct 1103 ms 26296 KB Output is correct
4 Correct 1105 ms 26232 KB Output is correct

Subtask #9
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1368 ms 25196 KB Output is correct
2 Correct 1102 ms 23452 KB Output is correct
3 Correct 1484 ms 28168 KB Output is correct

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1251 ms 31524 KB Output is correct
2 Correct 1089 ms 23420 KB Output is correct
3 Correct 1466 ms 33556 KB Output is correct
4 Correct 436 ms 23772 KB Output is correct