oj.uz

Submission #929863

# Submission time Handle Problem Language Result Execution time Memory
929863 2024-02-18T08:24:23 Z Whisper Kisik (COCI19_kisik) C++17
90 / 90
 265 ms 25808 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 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 = 1e6 + 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 numHouse, numFamily;
struct Data{
    int width, height;
    bool operator < (const Data& oth) const{
        return height < oth.height;
    }
} a[MAX];


namespace SUB1{
    const int MAXN = 1005;
    int dp[MAXN][MAXN];
    void solve(){
        memset(dp, 0x3f, sizeof dp);
        dp[0][0] = 0;
        for (int i = 1; i <= numHouse; ++i){
            for (int v = 0; v <= numFamily; ++v){
                dp[i][v] = dp[i - 1][v];
                if (v > 0){
                    minimize(dp[i][v], dp[i - 1][v - 1] + a[i].width);
                }
            }
        }
        int ans = LINF;
        for (int i = 1; i <= numHouse; ++i){
            if (dp[i][numFamily] < LINF){
                minimize(ans, dp[i][numFamily] * a[i].height);
            }
        }
        cout << ans;
    }
}

namespace SUB2{
    void solve(){
        priority_queue<int> q;
        int tot = 0;
        int ans = LINF;
        for (int i = 1; i <= numHouse; ++i){
            while ((int)q.size() >= numFamily) tot -= q.top(), q.pop();
            q.push(a[i].width); tot += a[i].width;
            if ((int)q.size() == numFamily)
                minimize(ans, tot * a[i].height);
        }
        cout << ans;
    }
}
void Whisper(){
    cin >> numHouse >> numFamily;
    for (int i = 1; i <= numHouse; ++i){
        cin >> a[i].width >> a[i].height;
    }
    sort(a + 1, a + numHouse + 1);
    if (numHouse <= 1000) SUB1 :: solve();
    else SUB2 :: solve();
}


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

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8796 KB Output is correct
2 Correct 2 ms 8796 KB Output is correct
3 Correct 2 ms 8796 KB Output is correct
4 Correct 2 ms 8796 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8792 KB Output is correct
2 Correct 2 ms 8796 KB Output is correct
3 Correct 3 ms 8792 KB Output is correct
4 Correct 1 ms 8796 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8796 KB Output is correct
2 Correct 2 ms 8796 KB Output is correct
3 Correct 2 ms 8796 KB Output is correct
4 Correct 2 ms 8796 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8796 KB Output is correct
2 Correct 2 ms 8796 KB Output is correct
3 Correct 2 ms 8796 KB Output is correct
4 Correct 3 ms 8792 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 8660 KB Output is correct
2 Correct 214 ms 16876 KB Output is correct
3 Correct 145 ms 21312 KB Output is correct
4 Correct 138 ms 19656 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 114 ms 10704 KB Output is correct
2 Correct 18 ms 5592 KB Output is correct
3 Correct 36 ms 6744 KB Output is correct
4 Correct 100 ms 16076 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 8656 KB Output is correct
2 Correct 131 ms 10696 KB Output is correct
3 Correct 104 ms 9804 KB Output is correct
4 Correct 265 ms 25808 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 10828 KB Output is correct
2 Correct 233 ms 21340 KB Output is correct
3 Correct 75 ms 8768 KB Output is correct
4 Correct 149 ms 22344 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 173 ms 13912 KB Output is correct
2 Correct 146 ms 18644 KB Output is correct
3 Correct 121 ms 15052 KB Output is correct
4 Correct 65 ms 13640 KB Output is correct