제출 #802855

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
802855		thimote75	Worst Reporter 4 (JOI21_worst_reporter4)	C++14	14 / 100	2059 ms	84744 KiB

worst_reporter2

#include <bits/stdc++.h>
#define int long long

using namespace std;
using Point = pair<int, int>;
using idata = vector<int>;

struct Treap {
    vector<Point> points;

    void insert( Point point ) {
        points.push_back(point);
    }
    int query (int x) {
        int res = 0;
        for (Point &point : points) if (x >= point.first) res += point.second;

        return res;
    }
    void chmin (int until) {
        sort(points.begin(), points.end());

        int res = 0;
        int idx = 0;
        int lp  = -1;
        for (Point &point : points) {
            if (res + point.second > until) {
                idx ++;
                point.second = until - res;
                break ;
            }

            res += point.second;
            idx ++;
        }

        if (idx == points.size()) return ;

        points.resize(idx);
        if (res == until) return ;
    }

    Treap cut (int position) {
        Treap other;

        vector<Point> local;
        for (Point & point : points) {
            if (point.first <= position) local.push_back(point);
            else other.insert(point);
        }

        points = local;

        return other;
    }

    void show () {
        sort(points.begin(), points.end());

        for (Point &point : points)
            cout << point.first << ": " << point.second << endl;
    }
    int size () { return points.size(); }
    void swap (Treap &other) { points.swap(other.points); }
};

void compile (Treap &treap, int H_i, int C_i) {
    int chmin_left = treap.query( H_i );
    Treap right = treap.cut(H_i);

    right.insert({ H_i + 1, C_i });

    treap.insert({ - 1e9, C_i });
    treap.chmin( chmin_left );

    for (Point &point : right.points) treap.insert(point);
}
void merge (Treap &target, Treap &other) {
    if (target.size() < other.size())
        target.swap(other);
    
    for (Point point : other.points)
        target.insert(point);
}

vector<Treap> treapArray;

idata A, H, C;

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

    int N;
    cin >> N;

    treapArray.resize(N);

    A.resize(N); H.resize(N); C.resize(N);
    for (int i = 0; i < N; i ++) {
        cin >> A[i] >> H[i] >> C[i];
        A[i] --;

        if ((i != 0 && A[i] > i - 1) || (i == 0 && A[i] != 0)) return 0;
    }
    
    for (int i = N - 1; i >= 0; i --) {
        compile(treapArray[i], H[i], C[i]);

        if (i == 0) continue ;
        merge(treapArray[A[i]], treapArray[i]);
    }

    cout << treapArray[0].query(1) << endl;
}

컴파일 시 표준 에러 (stderr) 메시지

worst_reporter2.cpp: In member function 'void Treap::chmin(long long int)':
worst_reporter2.cpp:38:17: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |         if (idx == points.size()) return ;
      |             ~~~~^~~~~~~~~~~~~~~~
worst_reporter2.cpp:26:13: warning: unused variable 'lp' [-Wunused-variable]
   26 |         int lp  = -1;
      |             ^~

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