oj.uz

Submission #938506

# Submission time Handle Problem Language Result Execution time Memory
938506 2024-03-05T08:28:56 Z Whisper Cloud Computing (CEOI18_clo) C++17
18 / 100
 388 ms 1508 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 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 = 2e3 + 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, numTask;
int dp[50 * MAX];
void Whisper(){
    cin >> nArr;
    vector<array<int, 4>> a;
    for (int i = 1; i <= nArr; ++i){
        int core, rate, cost;
        cin >> core >> rate >> cost;
        a.push_back({rate, 1, core, -cost});
    }
    cin >> numTask;
    for (int i = 1; i <= numTask; ++i){
        int core, rate, cost;
        cin >> core >> rate >> cost;
        a.push_back({rate, 0, core, cost});
    }
    sort(a.rbegin(), a.rend());
    memset(dp, -0x3f, sizeof dp);
    dp[0] = 0;
    for (array<int, 4> x : a){
        if (x[1]){
            for (int k = 50 * nArr; k >= x[2]; --k){
                maximize(dp[k], dp[k - x[2]] + x[3]);
            }
        }
        else{
            for (int k = 0; k <= 50 * nArr; ++k){
                maximize(dp[k], dp[k + x[2]] + x[3]);
            }
        }
    }
    int ans = 0;
    for (int i = 1; i <= 50 * nArr; ++i) maximize(ans, dp[i]);
    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 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Incorrect 1 ms 1116 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1112 KB Output is correct
3 Correct 1 ms 1112 KB Output is correct
4 Incorrect 1 ms 1116 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 1116 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Incorrect 1 ms 1116 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 23 ms 1116 KB Output is correct
4 Correct 72 ms 1372 KB Output is correct
5 Correct 388 ms 1368 KB Output is correct
6 Correct 382 ms 1508 KB Output is correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Incorrect 1 ms 1116 KB Output isn't correct
4 Halted 0 ms 0 KB -