Submission #915573

#	Time	Username	Problem	Language	Result	Execution time	Memory
915573		Whisper	Segments (IZhO18_segments)	C++14	0 / 100	22 ms	6236 KiB

segments

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;
using T = tuple<ll, ll, ll>;

#define int long long
#define Base 41
#define sz(a) (int)a.size()
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define all(x) x.begin() , x.end()
#define pii pair<int , int>
#define fi first
#define se second
#define Lg(x) 31 - __builtin_clz(x)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 3e5 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
int N, M, S;
struct Data{
    int a, b;
    bool operator < (const Data& oth) const{
        return a - b > oth.a - oth.b;
    }
} a[MAX];

int ans = 0;
int f[MAX][2];
void Whisper(){
    cin >> N >> M >> S;
    for (int i = 1; i <= N; ++i){
        cin >> a[i].a >> a[i].b;
    }
    sort(a + 1, a + N + 1);

    priority_queue<int, vector<int>, greater<int>> q;
    for (int i = 1; i <= N; ++i){
        f[i][0] = f[i - 1][0] + a[i].a;
        q.push(a[i].a);
        while ((int)q.size() > M) f[i][0] -= q.top(), q.pop();
    }
    while(!q.empty()) q.pop();
    for (int i = N; i >= 1; --i){
        f[i][1] = f[i + 1][1] + a[i].b;
        q.push(a[i].b);
        while ((int)q.size() > S) f[i][1] -= q.top(), q.pop();
    }
    int ans = 0;
    for (int i = 1; i < N; ++i){
        maximize(ans, f[i][0] + f[i + 1][1]);
    }
    cout << ans;
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 15
• Subtask 3: 0 / 16
• Subtask 4: 0 / 17
• Subtask 5: 0 / 20
• Subtask 6: 0 / 25