oj.uz

답안 #153944

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
153944 2019-09-17T14:40:04 Z karma Cloud Computing (CEOI18_clo) C++14
100 / 100
 425 ms 1528 KB 
#include<bits/stdc++.h>
#define pb      emplace_back
#define ll      long long

using namespace std;

const int N = int(2e3) + 7;
const int M = N * 55;
const ll oo = (ll)1e18;

struct TComp{
    int c, f, v;
    bool type;
    bool operator<(const TComp& o)const& {
        return f > o.f || (f == o.f && type < o.type);
    }
};
vector<TComp> v;
ll f[M], res = 0;
int n, m;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    if(fopen("test.inp", "r")) {
        freopen("test.inp", "r", stdin);
        freopen("test.out", "w", stdout);
    }
    cin >> n; v.resize(n);
    for(int i = 0; i < n; ++i) {
       cin >> v[i].c >> v[i].f >> v[i].v;
       v[i].v *= -1, v[i].type = 0;
    }
    cin >> m; m += n; v.resize(m);
    for(int i = n; i < m; ++i) {
       cin >> v[i].c >> v[i].f >> v[i].v;
       v[i].c *= -1, v[i].type = 1;
    }
    fill(f, f + M, -oo);
    f[0] = 0;
    sort(v.begin(), v.end());
    for(TComp& comp: v) {
       if(comp.c > 0) {
          for(int i = int(1e5); i >= comp.c; --i)
             f[i] = max(f[i - comp.c] + comp.v, f[i]);
       } else {
          for(int i = 0, lim = int(1e5) + comp.c; i <= lim; ++i)
             f[i] = max(f[i - comp.c] + comp.v, f[i]);
       }
    }
    for(int i = 0; i < M; ++i) res = max(res, f[i]);
    cout << res;
}

Compilation message

clo.cpp: In function 'int main()':
clo.cpp:26:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         freopen("test.inp", "r", stdin);
         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
clo.cpp:27:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         freopen("test.out", "w", stdout);
         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1144 KB Output is correct
2 Correct 3 ms 1144 KB Output is correct
3 Correct 14 ms 1144 KB Output is correct
4 Correct 24 ms 1272 KB Output is correct
5 Correct 192 ms 1312 KB Output is correct
6 Correct 192 ms 1400 KB Output is correct
7 Correct 220 ms 1340 KB Output is correct
8 Correct 202 ms 1400 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1272 KB Output is correct
2 Correct 4 ms 1152 KB Output is correct
3 Correct 15 ms 1144 KB Output is correct
4 Correct 15 ms 1272 KB Output is correct
5 Correct 101 ms 1300 KB Output is correct
6 Correct 100 ms 1400 KB Output is correct
7 Correct 217 ms 1368 KB Output is correct
8 Correct 214 ms 1272 KB Output is correct
9 Correct 204 ms 1272 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1148 KB Output is correct
2 Correct 6 ms 1144 KB Output is correct
3 Correct 23 ms 1144 KB Output is correct
4 Correct 22 ms 1272 KB Output is correct
5 Correct 40 ms 1276 KB Output is correct
6 Correct 41 ms 1272 KB Output is correct
7 Correct 55 ms 1272 KB Output is correct
8 Correct 55 ms 1272 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1144 KB Output is correct
2 Correct 5 ms 1144 KB Output is correct
3 Correct 162 ms 1272 KB Output is correct
4 Correct 186 ms 1284 KB Output is correct
5 Correct 387 ms 1400 KB Output is correct
6 Correct 414 ms 1380 KB Output is correct
7 Correct 421 ms 1404 KB Output is correct
8 Correct 413 ms 1392 KB Output is correct

Subtask #5
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1272 KB Output is correct
2 Correct 19 ms 1272 KB Output is correct
3 Correct 91 ms 1272 KB Output is correct
4 Correct 208 ms 1312 KB Output is correct
5 Correct 405 ms 1412 KB Output is correct
6 Correct 409 ms 1276 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1144 KB Output is correct
2 Correct 3 ms 1144 KB Output is correct
3 Correct 14 ms 1144 KB Output is correct
4 Correct 24 ms 1272 KB Output is correct
5 Correct 192 ms 1312 KB Output is correct
6 Correct 192 ms 1400 KB Output is correct
7 Correct 220 ms 1340 KB Output is correct
8 Correct 202 ms 1400 KB Output is correct
9 Correct 3 ms 1272 KB Output is correct
10 Correct 4 ms 1152 KB Output is correct
11 Correct 15 ms 1144 KB Output is correct
12 Correct 15 ms 1272 KB Output is correct
13 Correct 101 ms 1300 KB Output is correct
14 Correct 100 ms 1400 KB Output is correct
15 Correct 217 ms 1368 KB Output is correct
16 Correct 214 ms 1272 KB Output is correct
17 Correct 204 ms 1272 KB Output is correct
18 Correct 6 ms 1148 KB Output is correct
19 Correct 6 ms 1144 KB Output is correct
20 Correct 23 ms 1144 KB Output is correct
21 Correct 22 ms 1272 KB Output is correct
22 Correct 40 ms 1276 KB Output is correct
23 Correct 41 ms 1272 KB Output is correct
24 Correct 55 ms 1272 KB Output is correct
25 Correct 55 ms 1272 KB Output is correct
26 Correct 5 ms 1144 KB Output is correct
27 Correct 5 ms 1144 KB Output is correct
28 Correct 162 ms 1272 KB Output is correct
29 Correct 186 ms 1284 KB Output is correct
30 Correct 387 ms 1400 KB Output is correct
31 Correct 414 ms 1380 KB Output is correct
32 Correct 421 ms 1404 KB Output is correct
33 Correct 413 ms 1392 KB Output is correct
34 Correct 4 ms 1272 KB Output is correct
35 Correct 19 ms 1272 KB Output is correct
36 Correct 91 ms 1272 KB Output is correct
37 Correct 208 ms 1312 KB Output is correct
38 Correct 405 ms 1412 KB Output is correct
39 Correct 409 ms 1276 KB Output is correct
40 Correct 107 ms 1288 KB Output is correct
41 Correct 198 ms 1400 KB Output is correct
42 Correct 313 ms 1276 KB Output is correct
43 Correct 425 ms 1528 KB Output is correct
44 Correct 411 ms 1276 KB Output is correct
45 Correct 410 ms 1444 KB Output is correct
46 Correct 206 ms 1312 KB Output is correct
47 Correct 308 ms 1360 KB Output is correct
48 Correct 303 ms 1372 KB Output is correct