Submission #435835

#	Time	Username	Problem	Language	Result	Execution time	Memory
435835		2qbingxuan	Worst Reporter 4 (JOI21_worst_reporter4)	C++14	14 / 100	2082 ms	21496 KiB

worst_reporter2

#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]];
        g[A[i]].push_back(i);
    }
    for (int i = 0; i < n; 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) {
            ll dp = C[x];
            for (int y: g[x]) {
                if (cyc[y]) continue;
                dfs(y);
                for (auto [h, val]: sub[y]) if (h >= H[x]) dp += val;
                join(y, R[0]);
            }
            best[H[x]] += dp;
        }
        ll mx = 0;
        for (auto [h, val]: sub[R[0]]) mx += val;
        for (auto [h, val]: best) mx = max(mx, val);
        ans += mx;
    }
    cout << tot - ans << '\n';
}

Compilation message (stderr)

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:27: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   98 |                 for (auto [h, val]: sub[y]) if (h >= H[x]) dp += val;
      |                           ^
worst_reporter2.cpp:104:19: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  104 |         for (auto [h, val]: sub[R[0]]) mx += val;
      |                   ^
worst_reporter2.cpp:105:19: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  105 |         for (auto [h, val]: best) mx = max(mx, val);
      |                   ^

• Subtask 1: 14 / 14
• Subtask 2: 0 / 65
• Subtask 3: 0 / 21