oj.uz

답안 #751991

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
751991 2023-06-02T03:15:24 Z pemguimn Cloud Computing (CEOI18_clo) C++14
100 / 100
 707 ms 5332 KB 
#include <bits/stdc++.h>
#define int long long
#define pii pair<int, int>
#define pb push_back
#define gcd __gcd
#define endl "\n"
#define task "hihi"
using namespace std;
const int N = 3e5 + 5, MOD = 1e9 + 7, INF = 1e18 + 5;  
int n, m, dp[N], pre[N];
vector<array<int, 3>> a;
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    //freopen(task".inp", "r", stdin);
    //freopen(task".out", "w", stdout);
    cin >> n;
    for(int i = 1; i <= n; i++){
        int x, y, z; cin >> x >> y >> z;
        a.pb({x, y, -z});
    }
    cin >> m;
    for(int i = 1; i <= m; i++){
        int x, y, z; cin >> x >> y >> z;
        a.pb({-x, y, z});
    }
    sort(a.begin(), a.end(), [](array<int, 3> x, array<int, 3> y){
        return (x[1] == y[1] ? x[2] < y[2] : x[1] > y[1]);
    });
    fill(pre, pre + N, -INF);
    fill(dp, dp + N, -INF);
    pre[0] = 0;
    int sum = 0, ans = 0;
    for(int i = 0; i < a.size(); i++){
        for(int j = max(0LL, a[i][0]); j <= sum + a[i][0]; j++){
            if(pre[j - a[i][0]] == -INF) continue;
            dp[j] = max(dp[j], pre[j - a[i][0]] + a[i][2]);
            ans = max(ans, dp[j]);
        }
        sum = max(sum, sum + a[i][0]);
        for(int j = max(0LL, a[i][0]); j <= sum; j++){
            pre[j] = max(dp[j], pre[j]);  
        } 
    }
    cout << ans;
    return 0;
}

Compilation message

clo.cpp: In function 'int main()':
clo.cpp:34:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::array<long long int, 3> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |     for(int i = 0; i < a.size(); i++){
      |                    ~~^~~~~~~~~~

Subtask #1
18.0 / 18.0

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

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 29 ms 5076 KB Output is correct
6 Correct 3 ms 5068 KB Output is correct
7 Correct 156 ms 5096 KB Output is correct
8 Correct 19 ms 5076 KB Output is correct
9 Correct 217 ms 5092 KB Output is correct

Subtask #3
18.0 / 18.0

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

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 12 ms 5076 KB Output is correct
4 Correct 5 ms 5076 KB Output is correct
5 Correct 391 ms 5204 KB Output is correct
6 Correct 707 ms 5332 KB Output is correct
7 Correct 689 ms 5204 KB Output is correct
8 Correct 670 ms 5204 KB Output is correct

Subtask #5
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 29 ms 5064 KB Output is correct
4 Correct 11 ms 5076 KB Output is correct
5 Correct 447 ms 5188 KB Output is correct
6 Correct 675 ms 5204 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 4 ms 5076 KB Output is correct
6 Correct 3 ms 5016 KB Output is correct
7 Correct 5 ms 5076 KB Output is correct
8 Correct 6 ms 5076 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 29 ms 5076 KB Output is correct
14 Correct 3 ms 5068 KB Output is correct
15 Correct 156 ms 5096 KB Output is correct
16 Correct 19 ms 5076 KB Output is correct
17 Correct 217 ms 5092 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 4 ms 4948 KB Output is correct
22 Correct 3 ms 5076 KB Output is correct
23 Correct 4 ms 4948 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 3 ms 4948 KB Output is correct
27 Correct 2 ms 4948 KB Output is correct
28 Correct 12 ms 5076 KB Output is correct
29 Correct 5 ms 5076 KB Output is correct
30 Correct 391 ms 5204 KB Output is correct
31 Correct 707 ms 5332 KB Output is correct
32 Correct 689 ms 5204 KB Output is correct
33 Correct 670 ms 5204 KB Output is correct
34 Correct 2 ms 4948 KB Output is correct
35 Correct 3 ms 4948 KB Output is correct
36 Correct 29 ms 5064 KB Output is correct
37 Correct 11 ms 5076 KB Output is correct
38 Correct 447 ms 5188 KB Output is correct
39 Correct 675 ms 5204 KB Output is correct
40 Correct 35 ms 4948 KB Output is correct
41 Correct 90 ms 5092 KB Output is correct
42 Correct 9 ms 5076 KB Output is correct
43 Correct 562 ms 5204 KB Output is correct
44 Correct 569 ms 5204 KB Output is correct
45 Correct 383 ms 5204 KB Output is correct
46 Correct 6 ms 5076 KB Output is correct
47 Correct 9 ms 5088 KB Output is correct
48 Correct 9 ms 5076 KB Output is correct