oj.uz

Submission #915572

# Submission time Handle Problem Language Result Execution time Memory
915572 2024-01-24T07:57:51 Z Whisper Schools (IZhO13_school) C++14
75 / 100
 52 ms 10444 KB 
#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 = 2e5 + 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 (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 (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';
    }
}

Compilation message

school.cpp: In function 'void Whisper()':
school.cpp:74:25: warning: comparison of integer expressions of different signedness: 'std::priority_queue<long long int, std::vector<long long int>, std::greater<long long int> >::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   74 |         while (q.size() > M) f[i][0] -= q.top(), q.pop();
      |                ~~~~~~~~~^~~
school.cpp:80:25: warning: comparison of integer expressions of different signedness: 'std::priority_queue<long long int, std::vector<long long int>, std::greater<long long int> >::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   80 |         while (q.size() > S) f[i][1] -= q.top(), q.pop();
      |                ~~~~~~~~~^~~

Subtask #1
75.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Incorrect 1 ms 2396 KB Output isn't correct
3 Correct 1 ms 2804 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 2 ms 2652 KB Output is correct
8 Correct 2 ms 2648 KB Output is correct
9 Correct 2 ms 2648 KB Output is correct
10 Correct 2 ms 2648 KB Output is correct
11 Correct 2 ms 2652 KB Output is correct
12 Correct 2 ms 2652 KB Output is correct
13 Correct 12 ms 5464 KB Output is correct
14 Correct 29 ms 6004 KB Output is correct
15 Correct 40 ms 7936 KB Output is correct
16 Correct 52 ms 10444 KB Output is correct
17 Incorrect 29 ms 9556 KB Output isn't correct
18 Incorrect 31 ms 9540 KB Output isn't correct
19 Incorrect 38 ms 10320 KB Output isn't correct
20 Incorrect 43 ms 10200 KB Output isn't correct