oj.uz

답안 #399408

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
399408 2021-05-05T17:21:51 Z Victor Cloud Computing (CEOI18_clo) C++17
100 / 100
 394 ms 1356 KB 
#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define per(i, a, b) for (int i = b - 1; i >= (a); --i)
#define trav(a, x) for (auto &a : x)

#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#define pb push_back

#define umap unordered_map
#define uset unordered_set

typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef long long ll;

const int INF = 1000000007;
const ll llinf = 1000000000000000;

int main() {
    int n, m, c, f, sumc = 1;
    vector<pair<ii, pair<ll, int>>> dpvec;
    ll v, ans = 0;

    scanf("%d", &n);
    rep(i, 0, n) {
        scanf("%d %d %lld", &c, &f, &v);
        dpvec.push_back({{f, 1}, {v, c}});
        sumc += c;
    }

    scanf("%d", &m);
    rep(i, 0, m) {
        scanf("%d %d %lld", &c, &f, &v);
        dpvec.push_back({{f, 0}, {v, c}});
    }

    sort(all(dpvec), greater<>());
    vector<ll> dp(sumc, -llinf);
    dp[0] = 0;

    sumc = 1;
    trav(item, dpvec) {
        int query;
        query = item.first.second;
        tie(v, c) = item.second;

        if (!query)
            rep(i, c, sumc) {
                if (dp[i] == -llinf) continue;
                dp[i - c] = max(dp[i - c], dp[i] + v);
            }

        else {
            per(i, 0, sumc) {
                if (dp[i] == -llinf) continue;

                dp[i + c] = max(dp[i + c], dp[i] - v);
            }
            sumc += c;
        }
    }

    trav(val, dp) ans = max(ans, val);

    printf("%lld\n", ans);
    return 0;
}

Compilation message

clo.cpp: In function 'int main()':
clo.cpp:31:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   31 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
clo.cpp:33:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   33 |         scanf("%d %d %lld", &c, &f, &v);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
clo.cpp:38:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   38 |     scanf("%d", &m);
      |     ~~~~~^~~~~~~~~~
clo.cpp:40:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   40 |         scanf("%d %d %lld", &c, &f, &v);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 3 ms 332 KB Output is correct
7 Correct 3 ms 332 KB Output is correct
8 Correct 3 ms 332 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 18 ms 460 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 82 ms 844 KB Output is correct
8 Correct 11 ms 460 KB Output is correct
9 Correct 132 ms 1100 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 292 KB Output is correct
2 Correct 1 ms 216 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 7 ms 332 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 208 ms 844 KB Output is correct
6 Correct 389 ms 1228 KB Output is correct
7 Correct 389 ms 1228 KB Output is correct
8 Correct 369 ms 1100 KB Output is correct

Subtask #5
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 292 KB Output is correct
3 Correct 16 ms 568 KB Output is correct
4 Correct 6 ms 332 KB Output is correct
5 Correct 263 ms 1228 KB Output is correct
6 Correct 394 ms 1100 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 3 ms 332 KB Output is correct
7 Correct 3 ms 332 KB Output is correct
8 Correct 3 ms 332 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 18 ms 460 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 82 ms 844 KB Output is correct
16 Correct 11 ms 460 KB Output is correct
17 Correct 132 ms 1100 KB Output is correct
18 Correct 1 ms 292 KB Output is correct
19 Correct 1 ms 216 KB Output is correct
20 Correct 1 ms 296 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 7 ms 332 KB Output is correct
29 Correct 3 ms 332 KB Output is correct
30 Correct 208 ms 844 KB Output is correct
31 Correct 389 ms 1228 KB Output is correct
32 Correct 389 ms 1228 KB Output is correct
33 Correct 369 ms 1100 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 292 KB Output is correct
36 Correct 16 ms 568 KB Output is correct
37 Correct 6 ms 332 KB Output is correct
38 Correct 263 ms 1228 KB Output is correct
39 Correct 394 ms 1100 KB Output is correct
40 Correct 18 ms 460 KB Output is correct
41 Correct 50 ms 588 KB Output is correct
42 Correct 6 ms 392 KB Output is correct
43 Correct 374 ms 1228 KB Output is correct
44 Correct 369 ms 1228 KB Output is correct
45 Correct 246 ms 1356 KB Output is correct
46 Correct 3 ms 332 KB Output is correct
47 Correct 5 ms 432 KB Output is correct
48 Correct 5 ms 460 KB Output is correct