oj.uz

Submission #435851

# Submission time Handle Problem Language Result Execution time Memory
435851 2021-06-23T19:35:44 Z 2qbingxuan Worst Reporter 4 (JOI21_worst_reporter4) C++14
79 / 100
 505 ms 524292 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]) {
        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]];
    }
    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];
        g[j].push_back(i);
        if (--indeg[j] == 0)
            que.push(j), cyc[j] = 0;
    }
    ll ans = 0;
    for (int i = 0, tot = 0; i < n; i++) if (cyc[i] == 1) {
        vector<int> cycle;
        cycle.emplace_back(i);
        for (int x = A[i]; x != i; x = A[x]) {
            cycle.emplace_back(x);
        }
        sort(all(cycle), [&](int a, int b){ return H[a] < H[b]; });
        int last = -1;
        for (int x: cycle) {
            if (x != cycle[0]) {
                for (int y: g[x]) {
                    g[cycle[0]].push_back(y);
                }
                g[x].clear();
                g[x].push_back(last);
            }
            last = x;
        }
        dfs(cycle.back());
        for (auto [h, val]: sub[cycle.back()]) 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[cycle.back()]) ans += val;
      |                   ^
worst_reporter2.cpp:79:21: warning: unused variable 'tot' [-Wunused-variable]
   79 |     for (int i = 0, tot = 0; i < n; i++) if (cyc[i] == 1) {
      |                     ^~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 14412 KB Output is correct
2 Correct 12 ms 14408 KB Output is correct
3 Correct 10 ms 14420 KB Output is correct
4 Correct 11 ms 14420 KB Output is correct
5 Correct 19 ms 15808 KB Output is correct
6 Correct 18 ms 15180 KB Output is correct
7 Correct 15 ms 14852 KB Output is correct
8 Correct 16 ms 15820 KB Output is correct
9 Correct 15 ms 15144 KB Output is correct
10 Correct 16 ms 14876 KB Output is correct
11 Correct 13 ms 14688 KB Output is correct
12 Correct 14 ms 15052 KB Output is correct
13 Correct 12 ms 15020 KB Output is correct
14 Correct 14 ms 14796 KB Output is correct
15 Correct 13 ms 14796 KB Output is correct
16 Correct 17 ms 15944 KB Output is correct
17 Correct 15 ms 15328 KB Output is correct
18 Correct 14 ms 14720 KB Output is correct
19 Correct 15 ms 15120 KB Output is correct
20 Correct 14 ms 14924 KB Output is correct
21 Correct 14 ms 14864 KB Output is correct
22 Correct 16 ms 15108 KB Output is correct
23 Correct 13 ms 14796 KB Output is correct
24 Correct 15 ms 15144 KB Output is correct
25 Correct 12 ms 14924 KB Output is correct
26 Correct 14 ms 15308 KB Output is correct
27 Correct 14 ms 15232 KB Output is correct
28 Correct 14 ms 15180 KB Output is correct
29 Correct 14 ms 15220 KB Output is correct
30 Correct 15 ms 15260 KB Output is correct
31 Correct 14 ms 15224 KB Output is correct

Subtask #2
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 14412 KB Output is correct
2 Correct 12 ms 14408 KB Output is correct
3 Correct 10 ms 14420 KB Output is correct
4 Correct 11 ms 14420 KB Output is correct
5 Correct 19 ms 15808 KB Output is correct
6 Correct 18 ms 15180 KB Output is correct
7 Correct 15 ms 14852 KB Output is correct
8 Correct 16 ms 15820 KB Output is correct
9 Correct 15 ms 15144 KB Output is correct
10 Correct 16 ms 14876 KB Output is correct
11 Correct 13 ms 14688 KB Output is correct
12 Correct 14 ms 15052 KB Output is correct
13 Correct 12 ms 15020 KB Output is correct
14 Correct 14 ms 14796 KB Output is correct
15 Correct 13 ms 14796 KB Output is correct
16 Correct 17 ms 15944 KB Output is correct
17 Correct 15 ms 15328 KB Output is correct
18 Correct 14 ms 14720 KB Output is correct
19 Correct 15 ms 15120 KB Output is correct
20 Correct 14 ms 14924 KB Output is correct
21 Correct 14 ms 14864 KB Output is correct
22 Correct 16 ms 15108 KB Output is correct
23 Correct 13 ms 14796 KB Output is correct
24 Correct 15 ms 15144 KB Output is correct
25 Correct 12 ms 14924 KB Output is correct
26 Correct 14 ms 15308 KB Output is correct
27 Correct 14 ms 15232 KB Output is correct
28 Correct 14 ms 15180 KB Output is correct
29 Correct 14 ms 15220 KB Output is correct
30 Correct 15 ms 15260 KB Output is correct
31 Correct 14 ms 15224 KB Output is correct
32 Correct 15 ms 15740 KB Output is correct
33 Correct 505 ms 90348 KB Output is correct
34 Correct 345 ms 59936 KB Output is correct
35 Correct 458 ms 89712 KB Output is correct
36 Correct 363 ms 59580 KB Output is correct
37 Correct 255 ms 33416 KB Output is correct
38 Correct 214 ms 27824 KB Output is correct
39 Correct 179 ms 40260 KB Output is correct
40 Correct 152 ms 40260 KB Output is correct
41 Correct 139 ms 40204 KB Output is correct
42 Correct 186 ms 32468 KB Output is correct
43 Correct 149 ms 32420 KB Output is correct
44 Correct 368 ms 101184 KB Output is correct
45 Correct 261 ms 65268 KB Output is correct
46 Correct 110 ms 27716 KB Output is correct
47 Correct 224 ms 42596 KB Output is correct
48 Correct 140 ms 35540 KB Output is correct
49 Correct 124 ms 35560 KB Output is correct
50 Correct 324 ms 44220 KB Output is correct
51 Correct 115 ms 31680 KB Output is correct
52 Correct 291 ms 43004 KB Output is correct
53 Correct 133 ms 35904 KB Output is correct
54 Correct 220 ms 52656 KB Output is correct
55 Correct 220 ms 47496 KB Output is correct
56 Correct 187 ms 47988 KB Output is correct
57 Correct 202 ms 49508 KB Output is correct
58 Correct 215 ms 51048 KB Output is correct
59 Correct 211 ms 51140 KB Output is correct

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 14412 KB Output is correct
2 Correct 12 ms 14408 KB Output is correct
3 Correct 10 ms 14420 KB Output is correct
4 Correct 11 ms 14420 KB Output is correct
5 Correct 19 ms 15808 KB Output is correct
6 Correct 18 ms 15180 KB Output is correct
7 Correct 15 ms 14852 KB Output is correct
8 Correct 16 ms 15820 KB Output is correct
9 Correct 15 ms 15144 KB Output is correct
10 Correct 16 ms 14876 KB Output is correct
11 Correct 13 ms 14688 KB Output is correct
12 Correct 14 ms 15052 KB Output is correct
13 Correct 12 ms 15020 KB Output is correct
14 Correct 14 ms 14796 KB Output is correct
15 Correct 13 ms 14796 KB Output is correct
16 Correct 17 ms 15944 KB Output is correct
17 Correct 15 ms 15328 KB Output is correct
18 Correct 14 ms 14720 KB Output is correct
19 Correct 15 ms 15120 KB Output is correct
20 Correct 14 ms 14924 KB Output is correct
21 Correct 14 ms 14864 KB Output is correct
22 Correct 16 ms 15108 KB Output is correct
23 Correct 13 ms 14796 KB Output is correct
24 Correct 15 ms 15144 KB Output is correct
25 Correct 12 ms 14924 KB Output is correct
26 Correct 14 ms 15308 KB Output is correct
27 Correct 14 ms 15232 KB Output is correct
28 Correct 14 ms 15180 KB Output is correct
29 Correct 14 ms 15220 KB Output is correct
30 Correct 15 ms 15260 KB Output is correct
31 Correct 14 ms 15224 KB Output is correct
32 Correct 15 ms 15740 KB Output is correct
33 Correct 505 ms 90348 KB Output is correct
34 Correct 345 ms 59936 KB Output is correct
35 Correct 458 ms 89712 KB Output is correct
36 Correct 363 ms 59580 KB Output is correct
37 Correct 255 ms 33416 KB Output is correct
38 Correct 214 ms 27824 KB Output is correct
39 Correct 179 ms 40260 KB Output is correct
40 Correct 152 ms 40260 KB Output is correct
41 Correct 139 ms 40204 KB Output is correct
42 Correct 186 ms 32468 KB Output is correct
43 Correct 149 ms 32420 KB Output is correct
44 Correct 368 ms 101184 KB Output is correct
45 Correct 261 ms 65268 KB Output is correct
46 Correct 110 ms 27716 KB Output is correct
47 Correct 224 ms 42596 KB Output is correct
48 Correct 140 ms 35540 KB Output is correct
49 Correct 124 ms 35560 KB Output is correct
50 Correct 324 ms 44220 KB Output is correct
51 Correct 115 ms 31680 KB Output is correct
52 Correct 291 ms 43004 KB Output is correct
53 Correct 133 ms 35904 KB Output is correct
54 Correct 220 ms 52656 KB Output is correct
55 Correct 220 ms 47496 KB Output is correct
56 Correct 187 ms 47988 KB Output is correct
57 Correct 202 ms 49508 KB Output is correct
58 Correct 215 ms 51048 KB Output is correct
59 Correct 211 ms 51140 KB Output is correct
60 Runtime error 286 ms 524292 KB Execution killed with signal 9
61 Halted 0 ms 0 KB -