oj.uz

Submission #349019

# Submission time Handle Problem Language Result Execution time Memory
349019 2021-01-16T10:44:02 Z doowey Cloud Computing (CEOI18_clo) C++14
100 / 100
 375 ms 2180 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

struct order{
    int cores;
    int fr;
    int val;
    int type; // type == 1 => computer, type ==  2>= order
    bool operator< (const order &q) const {
        if(fr == q.fr){
            return type > q.type;
        }
        return fr < q.fr;
    }
};

const int M = (int)2e5+10;
const ll inf = (ll)1e18;
ll dp[M];

int main(){
    fastIO;
    int n;
    cin >> n;
    int c, f, v;
    vector<order> ff;
    for(int i = 0 ; i < n; i ++ ){
        cin >> c >> f >> v;
        ff.push_back({c,f,v,1});
    }
    int m;
    cin >> m;
    for(int i = 0;  i < m ; i ++ ){
        cin >> c >> f >> v;
        ff.push_back({c,f,v,2});
    }
    sort(ff.begin(),ff.end());
    for(int i = 0 ; i < M; i ++ ){
        dp[i]=-inf;
    }
    dp[0]=0;
    int mx = 0;
    ll ans = 0;
    for(int i = ff.size() - 1; i >= 0 ; i -- ){
        if(ff[i].type == 1){
            for(int j = mx; j >= 0; j -- ){
                dp[j+ff[i].cores]=max(dp[j+ff[i].cores],dp[j]-ff[i].val);
            }
            mx += ff[i].cores;
        }
        else{
            for(int j = ff[i].cores; j <= mx  ; j ++ ){
                dp[j-ff[i].cores]=max(dp[j-ff[i].cores],dp[j]+ff[i].val);
                ans = max(ans,dp[j-ff[i].cores]);
            }
        }
    }
    cout << ans << "\n";
    return 0;
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1900 KB Output is correct
2 Correct 1 ms 1900 KB Output is correct
3 Correct 1 ms 1900 KB Output is correct
4 Correct 1 ms 1900 KB Output is correct
5 Correct 3 ms 2028 KB Output is correct
6 Correct 2 ms 2028 KB Output is correct
7 Correct 3 ms 2028 KB Output is correct
8 Correct 3 ms 2028 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1900 KB Output is correct
2 Correct 2 ms 1900 KB Output is correct
3 Correct 1 ms 1900 KB Output is correct
4 Correct 1 ms 1900 KB Output is correct
5 Correct 14 ms 1900 KB Output is correct
6 Correct 2 ms 1900 KB Output is correct
7 Correct 59 ms 2028 KB Output is correct
8 Correct 8 ms 2028 KB Output is correct
9 Correct 86 ms 2156 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1900 KB Output is correct
2 Correct 2 ms 1900 KB Output is correct
3 Correct 1 ms 1900 KB Output is correct
4 Correct 1 ms 1900 KB Output is correct
5 Correct 2 ms 1900 KB Output is correct
6 Correct 2 ms 1900 KB Output is correct
7 Correct 2 ms 1900 KB Output is correct
8 Correct 2 ms 1900 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1900 KB Output is correct
2 Correct 1 ms 1900 KB Output is correct
3 Correct 5 ms 2028 KB Output is correct
4 Correct 3 ms 2028 KB Output is correct
5 Correct 174 ms 2028 KB Output is correct
6 Correct 343 ms 2028 KB Output is correct
7 Correct 339 ms 2048 KB Output is correct
8 Correct 319 ms 2028 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1920 KB Output is correct
2 Correct 2 ms 1900 KB Output is correct
3 Correct 13 ms 1900 KB Output is correct
4 Correct 6 ms 2028 KB Output is correct
5 Correct 210 ms 2156 KB Output is correct
6 Correct 337 ms 2156 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1900 KB Output is correct
2 Correct 1 ms 1900 KB Output is correct
3 Correct 1 ms 1900 KB Output is correct
4 Correct 1 ms 1900 KB Output is correct
5 Correct 3 ms 2028 KB Output is correct
6 Correct 2 ms 2028 KB Output is correct
7 Correct 3 ms 2028 KB Output is correct
8 Correct 3 ms 2028 KB Output is correct
9 Correct 2 ms 1900 KB Output is correct
10 Correct 2 ms 1900 KB Output is correct
11 Correct 1 ms 1900 KB Output is correct
12 Correct 1 ms 1900 KB Output is correct
13 Correct 14 ms 1900 KB Output is correct
14 Correct 2 ms 1900 KB Output is correct
15 Correct 59 ms 2028 KB Output is correct
16 Correct 8 ms 2028 KB Output is correct
17 Correct 86 ms 2156 KB Output is correct
18 Correct 1 ms 1900 KB Output is correct
19 Correct 2 ms 1900 KB Output is correct
20 Correct 1 ms 1900 KB Output is correct
21 Correct 1 ms 1900 KB Output is correct
22 Correct 2 ms 1900 KB Output is correct
23 Correct 2 ms 1900 KB Output is correct
24 Correct 2 ms 1900 KB Output is correct
25 Correct 2 ms 1900 KB Output is correct
26 Correct 1 ms 1900 KB Output is correct
27 Correct 1 ms 1900 KB Output is correct
28 Correct 5 ms 2028 KB Output is correct
29 Correct 3 ms 2028 KB Output is correct
30 Correct 174 ms 2028 KB Output is correct
31 Correct 343 ms 2028 KB Output is correct
32 Correct 339 ms 2048 KB Output is correct
33 Correct 319 ms 2028 KB Output is correct
34 Correct 1 ms 1920 KB Output is correct
35 Correct 2 ms 1900 KB Output is correct
36 Correct 13 ms 1900 KB Output is correct
37 Correct 6 ms 2028 KB Output is correct
38 Correct 210 ms 2156 KB Output is correct
39 Correct 337 ms 2156 KB Output is correct
40 Correct 15 ms 1900 KB Output is correct
41 Correct 42 ms 2028 KB Output is correct
42 Correct 5 ms 2028 KB Output is correct
43 Correct 375 ms 2156 KB Output is correct
44 Correct 370 ms 2156 KB Output is correct
45 Correct 240 ms 2180 KB Output is correct
46 Correct 3 ms 2028 KB Output is correct
47 Correct 6 ms 2156 KB Output is correct
48 Correct 5 ms 2028 KB Output is correct