oj.uz

Submission #943634

# Submission time Handle Problem Language Result Execution time Memory
943634 2024-03-11T17:12:30 Z vjudge1 Cloud Computing (CEOI18_clo) C++17
18 / 100
 590 ms 2392 KB 
#include <bits/stdc++.h>

using namespace std;
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
#define int long long
const int N = 2e5;
const int mod = 1e9 + 7;
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    int n; cin >> n;
    vector<array<int, 4> > w;
    for(int i = 0;i < n; i++){
        int c, f, cost; cin >> c >> f >> cost;
         w.push_back({c, f, cost, 1});
    }
    int m; cin >> m;
    for(int i = 0;i < m; i++){
        int c, f, cost; cin >> c >> f >> cost;
        w.push_back({c, f, cost, 0});
    }
    
    sort(all(w), [&](auto A, auto B){
        if(A[1] == B[1]) return A[3] > B[3];
        return A[1] > B[1];
    });
    vector<int> dp(N+5, -mod);
    dp[0] = 0;
    
    for(auto [c, f, cost, type] : w){
        if(type == 1){
            for(int i = N; i >= c; i--){
                dp[i] = max(dp[i], dp[i-c] - cost);
            }
        }else{
            for(int i = 0; i <= N - c; i++){
                dp[i] = max(dp[i], dp[i+c] + cost);
            }
        }
    }
    
    
    cout << *max_element(all(dp));
    return 0;
}

Subtask #1
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2036 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Correct 17 ms 1884 KB Output is correct
4 Correct 32 ms 1884 KB Output is correct
5 Correct 300 ms 2140 KB Output is correct
6 Incorrect 283 ms 2136 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1884 KB Output is correct
2 Correct 3 ms 1884 KB Output is correct
3 Correct 17 ms 2136 KB Output is correct
4 Correct 17 ms 1884 KB Output is correct
5 Correct 134 ms 1884 KB Output is correct
6 Correct 134 ms 1880 KB Output is correct
7 Correct 294 ms 2140 KB Output is correct
8 Incorrect 293 ms 2136 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2136 KB Output is correct
2 Correct 6 ms 1880 KB Output is correct
3 Correct 27 ms 1880 KB Output is correct
4 Correct 27 ms 1884 KB Output is correct
5 Incorrect 56 ms 1880 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1884 KB Output is correct
2 Correct 3 ms 1884 KB Output is correct
3 Correct 224 ms 2140 KB Output is correct
4 Correct 277 ms 2392 KB Output is correct
5 Incorrect 549 ms 2136 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1884 KB Output is correct
2 Correct 25 ms 1884 KB Output is correct
3 Correct 121 ms 1880 KB Output is correct
4 Correct 291 ms 2136 KB Output is correct
5 Correct 582 ms 2136 KB Output is correct
6 Correct 590 ms 2136 KB Output is correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2036 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Correct 17 ms 1884 KB Output is correct
4 Correct 32 ms 1884 KB Output is correct
5 Correct 300 ms 2140 KB Output is correct
6 Incorrect 283 ms 2136 KB Output isn't correct
7 Halted 0 ms 0 KB -