oj.uz

Submission #291949

# Submission time Handle Problem Language Result Execution time Memory
291949 2020-09-06T05:12:12 Z ngotienhung Cloud Computing (CEOI18_clo) C++14
100 / 100
 454 ms 1404 KB 
#include <bits/stdc++.h>
#define int long long
#define fi first
#define se second

using namespace std;

//20 1 -9999
//4 1 -700
//4 1 -750
//2 1 -10
//-1 1 300
//-3 1 4550
//-6 1 1500
//4890

const int maxN = 1e5 + 10;
const int maxC = 2000 * 50 + 69;
const int inf = 1e9 + 10;

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

int     n,m;
int     mark[maxN];
int     f[maxC];
TCom    a[maxN * 2];

bool cmp(TCom a, TCom b){
    return a.f > b.f;
}

int32_t main()
{
    ios_base::sync_with_stdio(); cin.tie(); cout.tie();
    //freopen("inputtt.inp", "r", stdin);
    //freopen("cc.out", "w", stdout);
    cin >> n;

    bool f1 = true, f2 = true;

    for(int i = 1; i <= n; ++i){
        cin >> a[i].c >> a[i].f >> a[i].v;
        if(a[i].f != 1)
            f1 = false;
    }
    cin >> m;
    for(int i = 1; i <= m; ++i){
        cin >> a[i + n].c >> a[i + n].f >> a[i + n].v;
        if(a[i + n].f != 1)
            f2 = false;
    }

    for(int i = 1; i <= n; ++i)
        a[i].v = -a[i].v;
    for(int i = n + 1; i <= n + m; ++i)
        a[i].c = -a[i].c;

    if(!(f1 && f2))
        sort(a + 1, a + n + m + 1, cmp);

    memset(f, 0, sizeof(f));

    for(int i = n + m; i >= 1; --i){
        if(a[i].v < 0){
            for(int j = 0; j <= maxC; ++j)
                if(j + a[i].c >= 0 && j + a[i].c <= maxC)
                    f[j] = max(f[j], f[j + a[i].c] + a[i].v);
        }
        else{
            for(int j = maxC; j >= 0; --j)
                if(j + a[i].c >= 0 && j + a[i].c <= maxC)
                    f[j] = max(f[j], f[j + a[i].c] + a[i].v);
        }
    }

    cout << f[0];
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1152 KB Output is correct
2 Correct 1 ms 1152 KB Output is correct
3 Correct 13 ms 1152 KB Output is correct
4 Correct 25 ms 1152 KB Output is correct
5 Correct 232 ms 1204 KB Output is correct
6 Correct 224 ms 1272 KB Output is correct
7 Correct 238 ms 1152 KB Output is correct
8 Correct 240 ms 1272 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1152 KB Output is correct
2 Correct 2 ms 1152 KB Output is correct
3 Correct 13 ms 1152 KB Output is correct
4 Correct 12 ms 1152 KB Output is correct
5 Correct 101 ms 1152 KB Output is correct
6 Correct 98 ms 1172 KB Output is correct
7 Correct 224 ms 1272 KB Output is correct
8 Correct 219 ms 1152 KB Output is correct
9 Correct 210 ms 1272 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1152 KB Output is correct
2 Correct 5 ms 1280 KB Output is correct
3 Correct 21 ms 1152 KB Output is correct
4 Correct 21 ms 1152 KB Output is correct
5 Correct 41 ms 1152 KB Output is correct
6 Correct 44 ms 1152 KB Output is correct
7 Correct 57 ms 1152 KB Output is correct
8 Correct 58 ms 1272 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1152 KB Output is correct
2 Correct 3 ms 1152 KB Output is correct
3 Correct 164 ms 1272 KB Output is correct
4 Correct 217 ms 1152 KB Output is correct
5 Correct 421 ms 1400 KB Output is correct
6 Correct 444 ms 1400 KB Output is correct
7 Correct 445 ms 1400 KB Output is correct
8 Correct 441 ms 1400 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1152 KB Output is correct
2 Correct 19 ms 1168 KB Output is correct
3 Correct 93 ms 1176 KB Output is correct
4 Correct 226 ms 1152 KB Output is correct
5 Correct 449 ms 1256 KB Output is correct
6 Correct 446 ms 1272 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1152 KB Output is correct
2 Correct 1 ms 1152 KB Output is correct
3 Correct 13 ms 1152 KB Output is correct
4 Correct 25 ms 1152 KB Output is correct
5 Correct 232 ms 1204 KB Output is correct
6 Correct 224 ms 1272 KB Output is correct
7 Correct 238 ms 1152 KB Output is correct
8 Correct 240 ms 1272 KB Output is correct
9 Correct 1 ms 1152 KB Output is correct
10 Correct 2 ms 1152 KB Output is correct
11 Correct 13 ms 1152 KB Output is correct
12 Correct 12 ms 1152 KB Output is correct
13 Correct 101 ms 1152 KB Output is correct
14 Correct 98 ms 1172 KB Output is correct
15 Correct 224 ms 1272 KB Output is correct
16 Correct 219 ms 1152 KB Output is correct
17 Correct 210 ms 1272 KB Output is correct
18 Correct 4 ms 1152 KB Output is correct
19 Correct 5 ms 1280 KB Output is correct
20 Correct 21 ms 1152 KB Output is correct
21 Correct 21 ms 1152 KB Output is correct
22 Correct 41 ms 1152 KB Output is correct
23 Correct 44 ms 1152 KB Output is correct
24 Correct 57 ms 1152 KB Output is correct
25 Correct 58 ms 1272 KB Output is correct
26 Correct 3 ms 1152 KB Output is correct
27 Correct 3 ms 1152 KB Output is correct
28 Correct 164 ms 1272 KB Output is correct
29 Correct 217 ms 1152 KB Output is correct
30 Correct 421 ms 1400 KB Output is correct
31 Correct 444 ms 1400 KB Output is correct
32 Correct 445 ms 1400 KB Output is correct
33 Correct 441 ms 1400 KB Output is correct
34 Correct 2 ms 1152 KB Output is correct
35 Correct 19 ms 1168 KB Output is correct
36 Correct 93 ms 1176 KB Output is correct
37 Correct 226 ms 1152 KB Output is correct
38 Correct 449 ms 1256 KB Output is correct
39 Correct 446 ms 1272 KB Output is correct
40 Correct 121 ms 1152 KB Output is correct
41 Correct 237 ms 1152 KB Output is correct
42 Correct 339 ms 1272 KB Output is correct
43 Correct 454 ms 1300 KB Output is correct
44 Correct 449 ms 1404 KB Output is correct
45 Correct 452 ms 1400 KB Output is correct
46 Correct 226 ms 1220 KB Output is correct
47 Correct 332 ms 1272 KB Output is correct
48 Correct 327 ms 1152 KB Output is correct