oj.uz

Submission #73124

# Submission time Handle Problem Language Result Execution time Memory
73124 2018-08-27T18:05:54 Z win11905 Cloud Computing (CEOI18_clo) C++11
100 / 100
 504 ms 1612 KB 
#include <bits/stdc++.h>
using namespace std;

#define iii tuple<int, int, int>
#define long long long

const int N = 2005;

int n, m;
long dp[N * 50];
vector<iii> A, B;

int main() {
    scanf("%d", &n);
    for(int i = 0, a, b, c; i < n; ++i) {
        scanf("%d %d %d", &a, &b, &c);
        A.emplace_back(a, b, c);
    }
    scanf("%d", &m);
    for(int i = 0, a, b, c; i < m; ++i) {
        scanf("%d %d %d", &a, &b, &c);
        B.emplace_back(a, b, c);
    } 
    fill_n(dp, N*50, (long)(-1e18));
    dp[0] = 0;
    sort(A.begin(), A.end(), [&](const iii &a, const iii &b) { return get<1>(a) > get<1>(b); });
    sort(B.begin(), B.end(), [&](const iii &a, const iii &b) { return get<1>(a) > get<1>(b); });
    int ptr = 0;
    for(int i = 0; i < m; ++i) {
        while(ptr != n && get<1>(A[ptr]) >= get<1>(B[i])) {
            int a, b, c; tie(a, b, c) = A[ptr++];
            for(int i = 100000 - a; ~i; --i) dp[i+a] = max(dp[i+a], dp[i] - c);
        }
        int a, b, c; tie(a, b, c) = B[i];
        for(int i = a; i <= 100000; ++i) dp[i-a] = max(dp[i-a], dp[i] + c);
    }
    printf("%lld\n", *max_element(dp, dp+N*50));
}

Compilation message

clo.cpp: In function 'int main()':
clo.cpp:14:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
clo.cpp:16:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %d", &a, &b, &c);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
clo.cpp:19:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &m);
     ~~~~~^~~~~~~~~~
clo.cpp:21:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %d", &a, &b, &c);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1112 KB Output is correct
2 Correct 4 ms 1232 KB Output is correct
3 Correct 14 ms 1244 KB Output is correct
4 Correct 47 ms 1244 KB Output is correct
5 Correct 222 ms 1320 KB Output is correct
6 Correct 241 ms 1364 KB Output is correct
7 Correct 207 ms 1364 KB Output is correct
8 Correct 207 ms 1412 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1412 KB Output is correct
2 Correct 4 ms 1412 KB Output is correct
3 Correct 15 ms 1412 KB Output is correct
4 Correct 14 ms 1412 KB Output is correct
5 Correct 93 ms 1412 KB Output is correct
6 Correct 96 ms 1516 KB Output is correct
7 Correct 169 ms 1516 KB Output is correct
8 Correct 238 ms 1516 KB Output is correct
9 Correct 200 ms 1516 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1516 KB Output is correct
2 Correct 6 ms 1516 KB Output is correct
3 Correct 18 ms 1516 KB Output is correct
4 Correct 25 ms 1516 KB Output is correct
5 Correct 66 ms 1516 KB Output is correct
6 Correct 60 ms 1516 KB Output is correct
7 Correct 62 ms 1516 KB Output is correct
8 Correct 94 ms 1516 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 1516 KB Output is correct
2 Correct 5 ms 1516 KB Output is correct
3 Correct 215 ms 1516 KB Output is correct
4 Correct 212 ms 1580 KB Output is correct
5 Correct 438 ms 1580 KB Output is correct
6 Correct 469 ms 1580 KB Output is correct
7 Correct 504 ms 1580 KB Output is correct
8 Correct 429 ms 1580 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1580 KB Output is correct
2 Correct 14 ms 1580 KB Output is correct
3 Correct 99 ms 1580 KB Output is correct
4 Correct 236 ms 1580 KB Output is correct
5 Correct 427 ms 1580 KB Output is correct
6 Correct 498 ms 1580 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1112 KB Output is correct
2 Correct 4 ms 1232 KB Output is correct
3 Correct 14 ms 1244 KB Output is correct
4 Correct 47 ms 1244 KB Output is correct
5 Correct 222 ms 1320 KB Output is correct
6 Correct 241 ms 1364 KB Output is correct
7 Correct 207 ms 1364 KB Output is correct
8 Correct 207 ms 1412 KB Output is correct
9 Correct 3 ms 1412 KB Output is correct
10 Correct 4 ms 1412 KB Output is correct
11 Correct 15 ms 1412 KB Output is correct
12 Correct 14 ms 1412 KB Output is correct
13 Correct 93 ms 1412 KB Output is correct
14 Correct 96 ms 1516 KB Output is correct
15 Correct 169 ms 1516 KB Output is correct
16 Correct 238 ms 1516 KB Output is correct
17 Correct 200 ms 1516 KB Output is correct
18 Correct 6 ms 1516 KB Output is correct
19 Correct 6 ms 1516 KB Output is correct
20 Correct 18 ms 1516 KB Output is correct
21 Correct 25 ms 1516 KB Output is correct
22 Correct 66 ms 1516 KB Output is correct
23 Correct 60 ms 1516 KB Output is correct
24 Correct 62 ms 1516 KB Output is correct
25 Correct 94 ms 1516 KB Output is correct
26 Correct 10 ms 1516 KB Output is correct
27 Correct 5 ms 1516 KB Output is correct
28 Correct 215 ms 1516 KB Output is correct
29 Correct 212 ms 1580 KB Output is correct
30 Correct 438 ms 1580 KB Output is correct
31 Correct 469 ms 1580 KB Output is correct
32 Correct 504 ms 1580 KB Output is correct
33 Correct 429 ms 1580 KB Output is correct
34 Correct 4 ms 1580 KB Output is correct
35 Correct 14 ms 1580 KB Output is correct
36 Correct 99 ms 1580 KB Output is correct
37 Correct 236 ms 1580 KB Output is correct
38 Correct 427 ms 1580 KB Output is correct
39 Correct 498 ms 1580 KB Output is correct
40 Correct 104 ms 1580 KB Output is correct
41 Correct 226 ms 1580 KB Output is correct
42 Correct 350 ms 1580 KB Output is correct
43 Correct 455 ms 1596 KB Output is correct
44 Correct 457 ms 1612 KB Output is correct
45 Correct 469 ms 1612 KB Output is correct
46 Correct 197 ms 1612 KB Output is correct
47 Correct 293 ms 1612 KB Output is correct
48 Correct 296 ms 1612 KB Output is correct