oj.uz

Submission #217606

# Submission time Handle Problem Language Result Execution time Memory
217606 2020-03-30T10:49:01 Z DystoriaX Cloud Computing (CEOI18_clo) C++14
100 / 100
 413 ms 1284 KB 
#include <bits/stdc++.h>

using namespace std;

struct node{
    int c, f, v;
};

int n, m;
const int MAX = 100001;
vector<node> comp, dem;
priority_queue<int, vector<int>, greater<int> > pq;
long long ans = 0, dp[MAX];

bool cp(node a, node b){
    return a.f > b.f;
}

int main(){
    scanf("%d", &n);

    comp.resize(n + 1);
    for(int i = 1; i <= n; i++) scanf("%d%d%d", &comp[i].c, &comp[i].f, &comp[i].v);

    scanf("%d", &m);

    dem.resize(m + 1);
    for(int i = 1; i <= m; i++) scanf("%d%d%d", &dem[i].c, &dem[i].f, &dem[i].v);

    sort(comp.begin() + 1, comp.end(), cp);
    sort(dem.begin() + 1, dem.end(), cp);

    //dp = maxProfit
    for(int i = 0; i < MAX; i++) dp[i] = -1e18;

    dp[0] = 0;
    
    int idx = 1;
    for(int i = 1; i <= m; i++){
        while(idx <= n && comp[idx].f >= dem[i].f){
            for(int k = MAX - 1; k >= comp[idx].c; k--){
                dp[k] = max(dp[k], dp[k - comp[idx].c] - comp[idx].v);

            }
            idx++;
        }

        for(int k = 0; k + dem[i].c < MAX; k++){
            dp[k] = max(dp[k], dp[k + dem[i].c] + dem[i].v);
        }
    }

    for(int i = 0; i < MAX; i++) ans = max(ans, dp[i]);

    printf("%lld\n", ans);

    return 0;
}

Compilation message

clo.cpp: In function 'int main()':
clo.cpp:20:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
clo.cpp:23:38: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i = 1; i <= n; i++) scanf("%d%d%d", &comp[i].c, &comp[i].f, &comp[i].v);
                                 ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
clo.cpp:25:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &m);
     ~~~~~^~~~~~~~~~
clo.cpp:28:38: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i = 1; i <= m; i++) scanf("%d%d%d", &dem[i].c, &dem[i].f, &dem[i].v);
                                 ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1024 KB Output is correct
2 Correct 5 ms 1152 KB Output is correct
3 Correct 18 ms 1152 KB Output is correct
4 Correct 25 ms 1152 KB Output is correct
5 Correct 185 ms 1152 KB Output is correct
6 Correct 185 ms 1152 KB Output is correct
7 Correct 198 ms 1284 KB Output is correct
8 Correct 207 ms 1152 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1152 KB Output is correct
2 Correct 6 ms 1152 KB Output is correct
3 Correct 15 ms 1152 KB Output is correct
4 Correct 15 ms 1152 KB Output is correct
5 Correct 87 ms 1152 KB Output is correct
6 Correct 88 ms 1152 KB Output is correct
7 Correct 171 ms 1152 KB Output is correct
8 Correct 209 ms 1152 KB Output is correct
9 Correct 193 ms 1152 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1152 KB Output is correct
2 Correct 8 ms 1152 KB Output is correct
3 Correct 18 ms 1152 KB Output is correct
4 Correct 17 ms 1152 KB Output is correct
5 Correct 39 ms 1272 KB Output is correct
6 Correct 39 ms 1152 KB Output is correct
7 Correct 53 ms 1152 KB Output is correct
8 Correct 51 ms 1144 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1152 KB Output is correct
2 Correct 6 ms 1152 KB Output is correct
3 Correct 144 ms 1152 KB Output is correct
4 Correct 178 ms 1152 KB Output is correct
5 Correct 364 ms 1272 KB Output is correct
6 Correct 383 ms 1152 KB Output is correct
7 Correct 404 ms 1196 KB Output is correct
8 Correct 380 ms 1152 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1152 KB Output is correct
2 Correct 15 ms 1152 KB Output is correct
3 Correct 100 ms 1180 KB Output is correct
4 Correct 210 ms 1188 KB Output is correct
5 Correct 403 ms 1256 KB Output is correct
6 Correct 402 ms 1152 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1024 KB Output is correct
2 Correct 5 ms 1152 KB Output is correct
3 Correct 18 ms 1152 KB Output is correct
4 Correct 25 ms 1152 KB Output is correct
5 Correct 185 ms 1152 KB Output is correct
6 Correct 185 ms 1152 KB Output is correct
7 Correct 198 ms 1284 KB Output is correct
8 Correct 207 ms 1152 KB Output is correct
9 Correct 5 ms 1152 KB Output is correct
10 Correct 6 ms 1152 KB Output is correct
11 Correct 15 ms 1152 KB Output is correct
12 Correct 15 ms 1152 KB Output is correct
13 Correct 87 ms 1152 KB Output is correct
14 Correct 88 ms 1152 KB Output is correct
15 Correct 171 ms 1152 KB Output is correct
16 Correct 209 ms 1152 KB Output is correct
17 Correct 193 ms 1152 KB Output is correct
18 Correct 8 ms 1152 KB Output is correct
19 Correct 8 ms 1152 KB Output is correct
20 Correct 18 ms 1152 KB Output is correct
21 Correct 17 ms 1152 KB Output is correct
22 Correct 39 ms 1272 KB Output is correct
23 Correct 39 ms 1152 KB Output is correct
24 Correct 53 ms 1152 KB Output is correct
25 Correct 51 ms 1144 KB Output is correct
26 Correct 6 ms 1152 KB Output is correct
27 Correct 6 ms 1152 KB Output is correct
28 Correct 144 ms 1152 KB Output is correct
29 Correct 178 ms 1152 KB Output is correct
30 Correct 364 ms 1272 KB Output is correct
31 Correct 383 ms 1152 KB Output is correct
32 Correct 404 ms 1196 KB Output is correct
33 Correct 380 ms 1152 KB Output is correct
34 Correct 5 ms 1152 KB Output is correct
35 Correct 15 ms 1152 KB Output is correct
36 Correct 100 ms 1180 KB Output is correct
37 Correct 210 ms 1188 KB Output is correct
38 Correct 403 ms 1256 KB Output is correct
39 Correct 402 ms 1152 KB Output is correct
40 Correct 113 ms 1176 KB Output is correct
41 Correct 200 ms 1152 KB Output is correct
42 Correct 314 ms 1152 KB Output is correct
43 Correct 413 ms 1152 KB Output is correct
44 Correct 406 ms 1152 KB Output is correct
45 Correct 399 ms 1284 KB Output is correct
46 Correct 196 ms 1152 KB Output is correct
47 Correct 286 ms 1152 KB Output is correct
48 Correct 311 ms 1272 KB Output is correct