oj.uz

Submission #944467

# Submission time Handle Problem Language Result Execution time Memory
944467 2024-03-12T18:06:08 Z Captain_Georgia Cloud Computing (CEOI18_clo) C++17
100 / 100
 386 ms 1704 KB 
#include <bits/stdc++.h>
using namespace std;

#define file \
            freopen("in.txt" , "r" , stdin); \
            freopen("out.txt" , "w" , stdout);

#define int long long

void test_case () {
    int n , m;
    cin >> n;
    int f[n] , c[n] , w[n];
    int sum = 0;
    for (int i = 0;i < n;i ++) {
        cin >> c[i] >> f[i] >> w[i];
    }
    cin >> m;
    int f_[m] , c_[m] , w_[m];
    set<int> s;
    s.insert(0);
    for (int i = 0;i < m;i ++) {
        cin >> c_[i] >> f_[i] >> w_[i];
        sum += c_[i];
        s.insert(f_[i]);
    }
    // cout << s.size() << "\n";
    vector<int> v(s.begin() , s.end());
    vector<pair<int , int>> g[m + 5] , g_[m + 5];
    for (int i = 0;i < n;i ++) {
        f[i] = lower_bound(v.begin() , v.end() , (int) *(-- s.upper_bound(f[i]))) - v.begin();
        // cout << f[i] << "  ";
        g[f[i]].push_back({c[i] , w[i]});
    }
    // cout << "\n";
    for (int i = 0;i < m;i ++) {
        // cout << f_[i] << "  ";
        f_[i] = lower_bound(v.begin() , v.end() , f_[i]) - v.begin();
        // cout << f_[i] << " || ";
        g_[f_[i]].push_back({c_[i] , w_[i]});
    }
    // cout << "\n";
    vector<int> dp(sum + 10 , 0);
    for (int i = 0;i <= m;i ++) {
        for (auto j : g_[i]) {
            for (int k = sum;k >= j.first;k --) {
                dp[k] = max(dp[k] , dp[k - j.first] +  j.second);
            }
        }
        for (auto j : g[i]) {
            for (int k = 0;k <= sum;k ++) {
                dp[k] = max(dp[k] , dp[min(k + j.first , sum)] - j.second);
            }
        }
    }
    cout << dp[0] << "\n";
}

int32_t main () {

    // file
    int TIME = clock();

    int t = 1;
    // cin >> t;

    while (t --) {
        test_case();
    }

    cerr << "\nTime elapsed: " << (clock() - TIME) * 1000.0 / CLOCKS_PER_SEC << " ms\n";
    return 0;
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 69 ms 1116 KB Output is correct
6 Correct 25 ms 860 KB Output is correct
7 Correct 143 ms 1372 KB Output is correct
8 Correct 138 ms 1468 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory 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 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 3 ms 348 KB Output is correct
8 Correct 3 ms 580 KB Output is correct
9 Correct 3 ms 348 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory 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 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 14 ms 604 KB Output is correct
5 Correct 161 ms 860 KB Output is correct
6 Correct 341 ms 1616 KB Output is correct
7 Correct 348 ms 1372 KB Output is correct
8 Correct 328 ms 1368 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 8 ms 604 KB Output is correct
5 Correct 325 ms 1528 KB Output is correct
6 Correct 346 ms 1368 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 69 ms 1116 KB Output is correct
6 Correct 25 ms 860 KB Output is correct
7 Correct 143 ms 1372 KB Output is correct
8 Correct 138 ms 1468 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 3 ms 348 KB Output is correct
16 Correct 3 ms 580 KB Output is correct
17 Correct 3 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 2 ms 348 KB Output is correct
29 Correct 14 ms 604 KB Output is correct
30 Correct 161 ms 860 KB Output is correct
31 Correct 341 ms 1616 KB Output is correct
32 Correct 348 ms 1372 KB Output is correct
33 Correct 328 ms 1368 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 2 ms 348 KB Output is correct
37 Correct 8 ms 604 KB Output is correct
38 Correct 325 ms 1528 KB Output is correct
39 Correct 346 ms 1368 KB Output is correct
40 Correct 23 ms 604 KB Output is correct
41 Correct 91 ms 1080 KB Output is correct
42 Correct 7 ms 600 KB Output is correct
43 Correct 366 ms 1580 KB Output is correct
44 Correct 364 ms 1368 KB Output is correct
45 Correct 386 ms 1704 KB Output is correct
46 Correct 4 ms 604 KB Output is correct
47 Correct 7 ms 600 KB Output is correct
48 Correct 6 ms 604 KB Output is correct