oj.uz

답안 #931169

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
931169 2024-02-21T10:33:39 Z Whisper Pod starim krovovima (COCI20_psk) C++17
50 / 50
 1 ms 736 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#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 pii pair<int , int>
#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 nArr;
struct Data{
    int curL, Lim, id;
} a[MAX];
int cnt = 0;
void Whisper(){
    cin >> nArr;
    for (int i = 1; i <= nArr; ++i ){
        cin >> a[i].curL >> a[i].Lim;
        a[i].id = i;
    }
    sort(a + 1, a + nArr + 1, [&](const Data& a, const Data& b){
            if(a.Lim == b.Lim) return a.curL > b.curL;
            return a.Lim > b.Lim;
    });
    int j = nArr;
    for (int i = 1; i <= nArr; ++i){
        while (j > 0 && j > i){
            int r = (a[i].Lim - a[i].curL);
            if (a[j].curL <= r){
                a[i].curL += a[j].curL;
                a[j].curL = 0; --j; ++cnt;
            }
            else{
                a[i].curL += r;
                a[j].curL -= r;
                break;
            }
        }
    }
    sort(a + 1, a + nArr + 1, [&](const Data& a, const Data& b){
        return a.id < b.id;
    });
    cout << cnt << '\n';
    FOR(i, 1, nArr) cout << a[i].curL << " ";
}


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

Subtask #1
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 736 KB Output is correct