oj.uz

Submission #317431

# Submission time Handle Problem Language Result Execution time Memory
317431 2020-10-29T17:41:54 Z Hehehe Cloud Computing (CEOI18_clo) C++14
100 / 100
 466 ms 1400 KB 
#include<bits/stdc++.h> //:3
using namespace std;
typedef long long LL;
#define all(a) (a).begin(), (a).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pi pair<int, int>
#define sz(x) (int)((x).size())
#define int long long

const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};

const LL inf = 2e6;
const LL mod = 1e9 + 7;
const int N = 2e6 + 11;
const LL INF64 = 3e18 + 1;
const double eps = 1e-14;
const double PI = acos(-1);

LL n, m, dp[N];

struct yes{
    int c, f, cost, tip;
};

yes a[N];

void solve(){

    cin >> n;

    int sum = 0;
    for(int i = 1; i <= n; i++){
        cin >> a[i].c >> a[i].f >> a[i].cost;
        a[i].tip = 0;
        sum += a[i].c;
    }

    cin >> m;
    for(int i = n + 1; i <= n + m; i++){
        cin >> a[i].c >> a[i].f >> a[i].cost;
        a[i].tip = 1;
    }

    n += m;

    for(int i = 1; i <= sum; i++){
        dp[i] = -INF64;
    }

    sort(a + 1, a + n + 1, [](yes l, yes r){
         if(l.f == r.f)return (l.tip < r.tip);
         return (l.f > r.f);
    });

    for(int i = 1; i <= n; i++){
        int c = a[i].c, cost = a[i].cost, tip = a[i].tip;
        if(!tip){
            for(int j = sum - c; j >= 0; j--){
                if(dp[j] != -INF64)dp[j + c] = max(dp[j + c], dp[j] - cost);
            }
        }else{
            for(int j = 0; j <= sum - c; j++){
                if(dp[j + c] != -INF64)dp[j] = max(dp[j], dp[j + c] + cost);
            }
        }

    }

    int ans = 0;
    for(int i = 0; i <= sum; i++)ans = max(ans, dp[i]);
    cout << ans << '\n';
}

int32_t main(){
ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);

    //cout << setprecision(6) << fixed;

    int T = 1;
    //cin >> T;
    while(T--){
        solve();
    }
}

Subtask #1
18.0 / 18.0

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

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 22 ms 512 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 106 ms 896 KB Output is correct
8 Correct 21 ms 640 KB Output is correct
9 Correct 171 ms 1152 KB Output is correct

Subtask #3
18.0 / 18.0

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

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 8 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 198 ms 1100 KB Output is correct
6 Correct 383 ms 1400 KB Output is correct
7 Correct 374 ms 1280 KB Output is correct
8 Correct 365 ms 1276 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 22 ms 512 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 361 ms 1272 KB Output is correct
6 Correct 381 ms 1272 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 3 ms 512 KB Output is correct
8 Correct 3 ms 512 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 22 ms 512 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 106 ms 896 KB Output is correct
16 Correct 21 ms 640 KB Output is correct
17 Correct 171 ms 1152 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 8 ms 384 KB Output is correct
29 Correct 2 ms 384 KB Output is correct
30 Correct 198 ms 1100 KB Output is correct
31 Correct 383 ms 1400 KB Output is correct
32 Correct 374 ms 1280 KB Output is correct
33 Correct 365 ms 1276 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 22 ms 512 KB Output is correct
37 Correct 5 ms 384 KB Output is correct
38 Correct 361 ms 1272 KB Output is correct
39 Correct 381 ms 1272 KB Output is correct
40 Correct 25 ms 512 KB Output is correct
41 Correct 68 ms 640 KB Output is correct
42 Correct 6 ms 512 KB Output is correct
43 Correct 459 ms 1280 KB Output is correct
44 Correct 466 ms 1280 KB Output is correct
45 Correct 438 ms 1400 KB Output is correct
46 Correct 3 ms 384 KB Output is correct
47 Correct 6 ms 512 KB Output is correct
48 Correct 6 ms 512 KB Output is correct