oj.uz

답안 #435842

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
435842 2021-06-23T19:19:36 Z 2qbingxuan Worst Reporter 4 (JOI21_worst_reporter4) C++14
79 / 100
 470 ms 100972 KB 
#include <bits/stdc++.h>
#ifdef local
#define safe std::cerr<<__PRETTY_FUNCTION__<<" line "<<__LINE__<<" safe\n"
#define debug(a...) qqbx(#a, a)
#define pary(a...) danb(#a, a)
template <typename ...T> void qqbx(const char *s, T ...a) {
    int cnt = sizeof...(T);
    ((std::cerr << "\033[1;32m(" << s << ") = (") , ... , (std::cerr << a << (--cnt ? ", " : ")\033[0m\n")));
}
template <typename T> void danb(const char *s, T L, T R) {
    std::cerr << "\033[1;32m[ " << s << " ] = [ ";
    for (auto it = L; it != R; ++it)
        std::cerr << *it << ' ';
    std::cerr << "]\033[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) ((void)0)
#define pary(...) ((void)0)
#endif // local
#define all(v) begin(v),end(v)
 
using namespace std;
using ll = int64_t;
const int maxn = 200025, maxm = 10000;
 
int H[maxn], C[maxn];
vector<int> g[maxn];
map<int,ll,greater<>> sub[maxn];
int cyc[maxn];
void join(int a, int b) {
    if (sub[a].size() > sub[b].size())
        swap(sub[a], sub[b]);
    for (auto [h, val]: sub[a])
        sub[b][h] += val;
}
void dfs(int i) {
    for (int j: g[i]) {
        if (cyc[j]) continue;
        dfs(j);
        join(j, i);
    }
    sub[i][H[i]] += C[i];
    auto it = sub[i].upper_bound(H[i]);
    ll v = C[i];
    while (it != sub[i].end()) {
        if (it->second < v) {
            v -= it->second;
            sub[i].erase(it++);
        } else {
            it->second -= v;
            break;
        }
    }
}
signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0);
    int n;
    cin >> n;
    ll tot = 0;
    vector<int> A(n);
    vector<int> indeg(n);
    for (int i = 0; i < n; i++) {
        cin >> A[i] >> H[i] >> C[i];
        tot += C[i];
        --A[i];
        ++indeg[A[i]];
        g[A[i]].push_back(i);
    }
    for (int i = 0; i < n; i++) cyc[i] = -1;
    queue<int> que;
    for (int i = 0; i < n; i++) if (indeg[i] == 0) que.push(i), cyc[i] = 0;
    while (!que.empty()) {
        int i = que.front(); que.pop();
        int j = A[i];
        if (--indeg[j] == 0)
            que.push(j), cyc[j] = 0;
    }
    vector<vector<int>> roots;
    roots.reserve(n);
    for (int i = 0, tot = 0; i < n; i++) if (cyc[i] == -1) {
        roots.emplace_back();
        roots.back().emplace_back(i);
        cyc[i] = ++tot;
        for (int x = A[i]; x != i; x = A[x]) {
            roots.back().emplace_back(x);
            cyc[x] = cyc[i];
        }
    }
    ll ans = 0;
    for (auto R: roots) {
        map<int,ll> best;
        for (int x: R) {
            dfs(x);
            if (x != R[0])
                join(x, R[0]);
        }
        for (auto [h, val]: sub[R[0]]) ans += val;
    }
    cout << tot - ans << '\n';
}

Compilation message

worst_reporter2.cpp: In function 'void join(int, int)':
worst_reporter2.cpp:34:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   34 |     for (auto [h, val]: sub[a])
      |               ^
worst_reporter2.cpp: In function 'int main()':
worst_reporter2.cpp:98:19: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   98 |         for (auto [h, val]: sub[R[0]]) ans += val;
      |                   ^

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 14412 KB Output is correct
2 Correct 10 ms 14412 KB Output is correct
3 Correct 10 ms 14412 KB Output is correct
4 Correct 9 ms 14412 KB Output is correct
5 Correct 20 ms 15528 KB Output is correct
6 Correct 16 ms 15084 KB Output is correct
7 Correct 14 ms 14888 KB Output is correct
8 Correct 16 ms 15608 KB Output is correct
9 Correct 16 ms 15052 KB Output is correct
10 Correct 15 ms 14872 KB Output is correct
11 Correct 13 ms 14772 KB Output is correct
12 Correct 14 ms 15052 KB Output is correct
13 Correct 12 ms 14972 KB Output is correct
14 Correct 15 ms 14796 KB Output is correct
15 Correct 13 ms 14796 KB Output is correct
16 Correct 19 ms 15840 KB Output is correct
17 Correct 14 ms 15236 KB Output is correct
18 Correct 12 ms 14740 KB Output is correct
19 Correct 18 ms 15052 KB Output is correct
20 Correct 15 ms 14924 KB Output is correct
21 Correct 14 ms 14924 KB Output is correct
22 Correct 15 ms 15180 KB Output is correct
23 Correct 13 ms 14796 KB Output is correct
24 Correct 16 ms 15072 KB Output is correct
25 Correct 14 ms 14900 KB Output is correct
26 Correct 15 ms 15320 KB Output is correct
27 Correct 14 ms 15176 KB Output is correct
28 Correct 13 ms 15180 KB Output is correct
29 Correct 13 ms 15180 KB Output is correct
30 Correct 15 ms 15308 KB Output is correct
31 Correct 14 ms 15280 KB Output is correct

Subtask #2
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 14412 KB Output is correct
2 Correct 10 ms 14412 KB Output is correct
3 Correct 10 ms 14412 KB Output is correct
4 Correct 9 ms 14412 KB Output is correct
5 Correct 20 ms 15528 KB Output is correct
6 Correct 16 ms 15084 KB Output is correct
7 Correct 14 ms 14888 KB Output is correct
8 Correct 16 ms 15608 KB Output is correct
9 Correct 16 ms 15052 KB Output is correct
10 Correct 15 ms 14872 KB Output is correct
11 Correct 13 ms 14772 KB Output is correct
12 Correct 14 ms 15052 KB Output is correct
13 Correct 12 ms 14972 KB Output is correct
14 Correct 15 ms 14796 KB Output is correct
15 Correct 13 ms 14796 KB Output is correct
16 Correct 19 ms 15840 KB Output is correct
17 Correct 14 ms 15236 KB Output is correct
18 Correct 12 ms 14740 KB Output is correct
19 Correct 18 ms 15052 KB Output is correct
20 Correct 15 ms 14924 KB Output is correct
21 Correct 14 ms 14924 KB Output is correct
22 Correct 15 ms 15180 KB Output is correct
23 Correct 13 ms 14796 KB Output is correct
24 Correct 16 ms 15072 KB Output is correct
25 Correct 14 ms 14900 KB Output is correct
26 Correct 15 ms 15320 KB Output is correct
27 Correct 14 ms 15176 KB Output is correct
28 Correct 13 ms 15180 KB Output is correct
29 Correct 13 ms 15180 KB Output is correct
30 Correct 15 ms 15308 KB Output is correct
31 Correct 14 ms 15280 KB Output is correct
32 Correct 16 ms 15596 KB Output is correct
33 Correct 470 ms 75948 KB Output is correct
34 Correct 361 ms 51092 KB Output is correct
35 Correct 415 ms 73020 KB Output is correct
36 Correct 329 ms 51132 KB Output is correct
37 Correct 236 ms 32140 KB Output is correct
38 Correct 205 ms 27852 KB Output is correct
39 Correct 210 ms 40252 KB Output is correct
40 Correct 177 ms 40248 KB Output is correct
41 Correct 124 ms 40124 KB Output is correct
42 Correct 163 ms 32620 KB Output is correct
43 Correct 151 ms 32468 KB Output is correct
44 Correct 418 ms 100972 KB Output is correct
45 Correct 268 ms 65424 KB Output is correct
46 Correct 125 ms 27676 KB Output is correct
47 Correct 278 ms 42436 KB Output is correct
48 Correct 142 ms 35664 KB Output is correct
49 Correct 123 ms 35524 KB Output is correct
50 Correct 346 ms 44168 KB Output is correct
51 Correct 119 ms 31772 KB Output is correct
52 Correct 289 ms 43028 KB Output is correct
53 Correct 138 ms 35964 KB Output is correct
54 Correct 227 ms 52816 KB Output is correct
55 Correct 248 ms 44952 KB Output is correct
56 Correct 215 ms 47732 KB Output is correct
57 Correct 207 ms 49524 KB Output is correct
58 Correct 206 ms 51140 KB Output is correct
59 Correct 207 ms 51144 KB Output is correct

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 14412 KB Output is correct
2 Correct 10 ms 14412 KB Output is correct
3 Correct 10 ms 14412 KB Output is correct
4 Correct 9 ms 14412 KB Output is correct
5 Correct 20 ms 15528 KB Output is correct
6 Correct 16 ms 15084 KB Output is correct
7 Correct 14 ms 14888 KB Output is correct
8 Correct 16 ms 15608 KB Output is correct
9 Correct 16 ms 15052 KB Output is correct
10 Correct 15 ms 14872 KB Output is correct
11 Correct 13 ms 14772 KB Output is correct
12 Correct 14 ms 15052 KB Output is correct
13 Correct 12 ms 14972 KB Output is correct
14 Correct 15 ms 14796 KB Output is correct
15 Correct 13 ms 14796 KB Output is correct
16 Correct 19 ms 15840 KB Output is correct
17 Correct 14 ms 15236 KB Output is correct
18 Correct 12 ms 14740 KB Output is correct
19 Correct 18 ms 15052 KB Output is correct
20 Correct 15 ms 14924 KB Output is correct
21 Correct 14 ms 14924 KB Output is correct
22 Correct 15 ms 15180 KB Output is correct
23 Correct 13 ms 14796 KB Output is correct
24 Correct 16 ms 15072 KB Output is correct
25 Correct 14 ms 14900 KB Output is correct
26 Correct 15 ms 15320 KB Output is correct
27 Correct 14 ms 15176 KB Output is correct
28 Correct 13 ms 15180 KB Output is correct
29 Correct 13 ms 15180 KB Output is correct
30 Correct 15 ms 15308 KB Output is correct
31 Correct 14 ms 15280 KB Output is correct
32 Correct 16 ms 15596 KB Output is correct
33 Correct 470 ms 75948 KB Output is correct
34 Correct 361 ms 51092 KB Output is correct
35 Correct 415 ms 73020 KB Output is correct
36 Correct 329 ms 51132 KB Output is correct
37 Correct 236 ms 32140 KB Output is correct
38 Correct 205 ms 27852 KB Output is correct
39 Correct 210 ms 40252 KB Output is correct
40 Correct 177 ms 40248 KB Output is correct
41 Correct 124 ms 40124 KB Output is correct
42 Correct 163 ms 32620 KB Output is correct
43 Correct 151 ms 32468 KB Output is correct
44 Correct 418 ms 100972 KB Output is correct
45 Correct 268 ms 65424 KB Output is correct
46 Correct 125 ms 27676 KB Output is correct
47 Correct 278 ms 42436 KB Output is correct
48 Correct 142 ms 35664 KB Output is correct
49 Correct 123 ms 35524 KB Output is correct
50 Correct 346 ms 44168 KB Output is correct
51 Correct 119 ms 31772 KB Output is correct
52 Correct 289 ms 43028 KB Output is correct
53 Correct 138 ms 35964 KB Output is correct
54 Correct 227 ms 52816 KB Output is correct
55 Correct 248 ms 44952 KB Output is correct
56 Correct 215 ms 47732 KB Output is correct
57 Correct 207 ms 49524 KB Output is correct
58 Correct 206 ms 51140 KB Output is correct
59 Correct 207 ms 51144 KB Output is correct
60 Incorrect 9 ms 14412 KB Output isn't correct
61 Halted 0 ms 0 KB -