Submission #447565

# Submission time Handle Problem Language Result Execution time Memory
447565 2021-07-26T18:55:50 Z SirCovidThe19th Cloud Computing (CEOI18_clo) C++14
100 / 100
738 ms 2012 KB
#include <bits/stdc++.h>
using namespace std; 

#define FOR(i, x, y) for (int i = x; i < y; i++)
#define mx (int)1e5+5
#define ll long long
struct CP{ int c; ll f, v; };

int main(){
    int n, m; CP A[4005]; array<ll, mx> dp;
    cin >> n; FOR(i, 0, n) cin >> A[i].c >> A[i].f >> A[i].v, A[i].v *= -1;
    cin >> m; FOR(i, n, m+n) cin >> A[i].c >> A[i].f >> A[i].v, A[i].c *= -1;
    sort(A, A+n+m, [](CP a, CP b){ return (a.f > b.f) or (a.f == b.f and a.c > b.c); } );
    dp.fill(-1e18); dp[0] = 0;
    FOR(i, 0, m+n){ 
        array<ll, mx> DP;
        FOR(j, 0, mx){
            DP[j] = dp[j]; if (j-A[i].c < 0 or j-A[i].c >= mx) continue;
            DP[j] = max(DP[j], dp[j-A[i].c]+A[i].v);
        }dp = DP;
    }cout<<*max_element(dp.begin(), dp.end())<<endl;
}
 
# Verdict Execution time Memory Grader output
1 Correct 2 ms 1868 KB Output is correct
2 Correct 2 ms 1868 KB Output is correct
3 Correct 20 ms 1940 KB Output is correct
4 Correct 40 ms 1988 KB Output is correct
5 Correct 334 ms 1988 KB Output is correct
6 Correct 331 ms 1920 KB Output is correct
7 Correct 353 ms 1868 KB Output is correct
8 Correct 354 ms 1868 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 1868 KB Output is correct
2 Correct 3 ms 1868 KB Output is correct
3 Correct 20 ms 1868 KB Output is correct
4 Correct 20 ms 1868 KB Output is correct
5 Correct 159 ms 1868 KB Output is correct
6 Correct 158 ms 1868 KB Output is correct
7 Correct 349 ms 1868 KB Output is correct
8 Correct 353 ms 1924 KB Output is correct
9 Correct 344 ms 1920 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 7 ms 1944 KB Output is correct
2 Correct 6 ms 1868 KB Output is correct
3 Correct 32 ms 1944 KB Output is correct
4 Correct 32 ms 1924 KB Output is correct
5 Correct 65 ms 1936 KB Output is correct
6 Correct 64 ms 1924 KB Output is correct
7 Correct 90 ms 1868 KB Output is correct
8 Correct 87 ms 1868 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 1868 KB Output is correct
2 Correct 4 ms 1868 KB Output is correct
3 Correct 264 ms 1868 KB Output is correct
4 Correct 316 ms 1928 KB Output is correct
5 Correct 660 ms 1968 KB Output is correct
6 Correct 734 ms 1948 KB Output is correct
7 Correct 702 ms 1952 KB Output is correct
8 Correct 711 ms 1948 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 1868 KB Output is correct
2 Correct 29 ms 1868 KB Output is correct
3 Correct 145 ms 1928 KB Output is correct
4 Correct 362 ms 1928 KB Output is correct
5 Correct 721 ms 1924 KB Output is correct
6 Correct 711 ms 1928 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 1868 KB Output is correct
2 Correct 2 ms 1868 KB Output is correct
3 Correct 20 ms 1940 KB Output is correct
4 Correct 40 ms 1988 KB Output is correct
5 Correct 334 ms 1988 KB Output is correct
6 Correct 331 ms 1920 KB Output is correct
7 Correct 353 ms 1868 KB Output is correct
8 Correct 354 ms 1868 KB Output is correct
9 Correct 2 ms 1868 KB Output is correct
10 Correct 3 ms 1868 KB Output is correct
11 Correct 20 ms 1868 KB Output is correct
12 Correct 20 ms 1868 KB Output is correct
13 Correct 159 ms 1868 KB Output is correct
14 Correct 158 ms 1868 KB Output is correct
15 Correct 349 ms 1868 KB Output is correct
16 Correct 353 ms 1924 KB Output is correct
17 Correct 344 ms 1920 KB Output is correct
18 Correct 7 ms 1944 KB Output is correct
19 Correct 6 ms 1868 KB Output is correct
20 Correct 32 ms 1944 KB Output is correct
21 Correct 32 ms 1924 KB Output is correct
22 Correct 65 ms 1936 KB Output is correct
23 Correct 64 ms 1924 KB Output is correct
24 Correct 90 ms 1868 KB Output is correct
25 Correct 87 ms 1868 KB Output is correct
26 Correct 4 ms 1868 KB Output is correct
27 Correct 4 ms 1868 KB Output is correct
28 Correct 264 ms 1868 KB Output is correct
29 Correct 316 ms 1928 KB Output is correct
30 Correct 660 ms 1968 KB Output is correct
31 Correct 734 ms 1948 KB Output is correct
32 Correct 702 ms 1952 KB Output is correct
33 Correct 711 ms 1948 KB Output is correct
34 Correct 2 ms 1868 KB Output is correct
35 Correct 29 ms 1868 KB Output is correct
36 Correct 145 ms 1928 KB Output is correct
37 Correct 362 ms 1928 KB Output is correct
38 Correct 721 ms 1924 KB Output is correct
39 Correct 711 ms 1928 KB Output is correct
40 Correct 184 ms 1936 KB Output is correct
41 Correct 361 ms 1940 KB Output is correct
42 Correct 566 ms 1944 KB Output is correct
43 Correct 725 ms 1952 KB Output is correct
44 Correct 717 ms 1996 KB Output is correct
45 Correct 738 ms 2012 KB Output is correct
46 Correct 361 ms 1948 KB Output is correct
47 Correct 537 ms 1968 KB Output is correct
48 Correct 542 ms 1960 KB Output is correct