oj.uz

답안 #629921

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
629921 2022-08-15T11:01:54 Z NintsiChkhaidze Cloud Computing (CEOI18_clo) C++14
100 / 100
 765 ms 2036 KB 
#include <bits/stdc++.h>
#include <iostream>
#define ll long long
#define s second
#define pb push_back
#define f first
using namespace std;

const int N = 100005;
vector<pair<pair<int,int>,int> > vec;
int tot;
ll dpold[N],dpnew[N];

bool cmp(pair<pair<int,int>,int> a, pair<pair<int,int>,int> b){
    if (a.f.s < b.f.s) return 0;
    if (a.f.s > b.f.s) return 1;
    return (a.f.f > b.f.f);
}
signed main() {
    int n;
    cin>>n;
    for (int i = 0; i < n; i++){
        int c,f,v;
        cin>>c>>f>>v;
        tot += c;
        vec.pb({{c,f},-v});
    }
    
    int m;
    cin>>m;
    for (int i = 0; i < m; i++){
        int c,f,v;
        cin>>c>>f>>v;
        vec.pb({{-c,f},v});
    }
    sort(vec.begin(),vec.end(),cmp);

    for (int i = 1;i <= tot; i++)
        dpold[i] = dpnew[i] = -1e18;

    for (int i = 0; i < vec.size(); i++){
        int pr = vec[i].s,cr = vec[i].f.f;
        
        for (int j = 0; j <= tot; j++){
            int nw = j + cr;
            if (nw < 0 || nw > tot || dpold[j] == -1e18) continue;
            dpnew[nw] = max(dpnew[nw], dpold[j] + pr);
        }

        for (int j = 0; j <= tot; j++)
            dpold[j] = dpnew[j];
    }

    ll ans=0;
    for (int j = 0; j <= tot; j++)
        ans=max(ans,dpold[j]);
    
    cout<<ans;
}

Compilation message

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

Subtask #1
18.0 / 18.0

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

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 46 ms 712 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 174 ms 1196 KB Output is correct
8 Correct 30 ms 468 KB Output is correct
9 Correct 284 ms 1712 KB Output is correct

Subtask #3
18.0 / 18.0

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

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 12 ms 436 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 412 ms 1240 KB Output is correct
6 Correct 666 ms 1832 KB Output is correct
7 Correct 752 ms 1860 KB Output is correct
8 Correct 670 ms 1788 KB Output is correct

Subtask #5
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 46 ms 728 KB Output is correct
4 Correct 9 ms 324 KB Output is correct
5 Correct 678 ms 1832 KB Output is correct
6 Correct 680 ms 1816 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 5 ms 416 KB Output is correct
8 Correct 5 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 46 ms 712 KB Output is correct
14 Correct 3 ms 340 KB Output is correct
15 Correct 174 ms 1196 KB Output is correct
16 Correct 30 ms 468 KB Output is correct
17 Correct 284 ms 1712 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 12 ms 436 KB Output is correct
29 Correct 3 ms 340 KB Output is correct
30 Correct 412 ms 1240 KB Output is correct
31 Correct 666 ms 1832 KB Output is correct
32 Correct 752 ms 1860 KB Output is correct
33 Correct 670 ms 1788 KB Output is correct
34 Correct 1 ms 308 KB Output is correct
35 Correct 2 ms 340 KB Output is correct
36 Correct 46 ms 728 KB Output is correct
37 Correct 9 ms 324 KB Output is correct
38 Correct 678 ms 1832 KB Output is correct
39 Correct 680 ms 1816 KB Output is correct
40 Correct 47 ms 696 KB Output is correct
41 Correct 138 ms 896 KB Output is correct
42 Correct 15 ms 456 KB Output is correct
43 Correct 716 ms 1992 KB Output is correct
44 Correct 675 ms 2004 KB Output is correct
45 Correct 765 ms 2036 KB Output is correct
46 Correct 6 ms 340 KB Output is correct
47 Correct 11 ms 448 KB Output is correct
48 Correct 10 ms 396 KB Output is correct