oj.uz

Submission #152590

# Submission time Handle Problem Language Result Execution time Memory
152590 2019-09-08T13:51:17 Z Mercenary Cloud Computing (CEOI18_clo) C++14
100 / 100
 396 ms 1400 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>

#define pb push_back
#define mp make_pair
#define taskname "A"

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef tree <int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;

const int maxn = 2e3 + 5;

ll dp[maxn * 50];

struct object{
    int c , f , v;
    bool operator < (const object & other){
        if(f == other.f)return v < other.v;
        return f > other.f;
    }
}a[maxn * 2];

int n , m;

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    if(fopen(taskname".INP","r")){
		freopen(taskname".INP", "r",stdin);
		freopen(taskname".OUT", "w",stdout);
    }
    cin >> n;
    for(int i = 1 ; i <= n ; ++i){
        cin >> a[i].c >> a[i].f >> a[i].v;
        a[i].v = -a[i].v;
    }
    cin >> m;
    for(int i = 1 ; i <= m ; ++i){
        cin >> a[i + n].c >> a[i + n].f >> a[i + n].v;
    }
    sort(a + 1 , a + n + m + 1);
    fill_n(&dp[0],maxn*50,-1e18);
    dp[0] = 0;
    for(int i = 1 ; i <= n + m ; ++i){
        if(a[i].v < 0){
            for(int j = 100000 - a[i].c ; j >= 0 ; --j){
                dp[j + a[i].c] = max(dp[j + a[i].c] , dp[j] + a[i].v);
            }
        }else{
            for(int j = a[i].c ; j <= 100000 ; ++j){
                dp[j - a[i].c] = max(dp[j - a[i].c] , dp[j] + a[i].v);
            }
        }
    }
    cout << *max_element(dp,dp+maxn*50);
}

Compilation message

clo.cpp: In function 'int main()':
clo.cpp:37:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen(taskname".INP", "r",stdin);
   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
clo.cpp:38:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen(taskname".OUT", "w",stdout);
   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1148 KB Output is correct
2 Correct 3 ms 1144 KB Output is correct
3 Correct 14 ms 1144 KB Output is correct
4 Correct 23 ms 1144 KB Output is correct
5 Correct 190 ms 1144 KB Output is correct
6 Correct 191 ms 1144 KB Output is correct
7 Correct 199 ms 1272 KB Output is correct
8 Correct 200 ms 1144 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1144 KB Output is correct
2 Correct 4 ms 1144 KB Output is correct
3 Correct 13 ms 1236 KB Output is correct
4 Correct 13 ms 1144 KB Output is correct
5 Correct 92 ms 1196 KB Output is correct
6 Correct 92 ms 1144 KB Output is correct
7 Correct 199 ms 1244 KB Output is correct
8 Correct 200 ms 1272 KB Output is correct
9 Correct 193 ms 1272 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1144 KB Output is correct
2 Correct 6 ms 1144 KB Output is correct
3 Correct 20 ms 1144 KB Output is correct
4 Correct 21 ms 1144 KB Output is correct
5 Correct 39 ms 1176 KB Output is correct
6 Correct 38 ms 1184 KB Output is correct
7 Correct 52 ms 1144 KB Output is correct
8 Correct 53 ms 1192 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1144 KB Output is correct
2 Correct 5 ms 1192 KB Output is correct
3 Correct 150 ms 1244 KB Output is correct
4 Correct 181 ms 1208 KB Output is correct
5 Correct 373 ms 1272 KB Output is correct
6 Correct 396 ms 1144 KB Output is correct
7 Correct 393 ms 1272 KB Output is correct
8 Correct 386 ms 1272 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1144 KB Output is correct
2 Correct 18 ms 1144 KB Output is correct
3 Correct 83 ms 1272 KB Output is correct
4 Correct 198 ms 1144 KB Output is correct
5 Correct 389 ms 1272 KB Output is correct
6 Correct 393 ms 1292 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1148 KB Output is correct
2 Correct 3 ms 1144 KB Output is correct
3 Correct 14 ms 1144 KB Output is correct
4 Correct 23 ms 1144 KB Output is correct
5 Correct 190 ms 1144 KB Output is correct
6 Correct 191 ms 1144 KB Output is correct
7 Correct 199 ms 1272 KB Output is correct
8 Correct 200 ms 1144 KB Output is correct
9 Correct 3 ms 1144 KB Output is correct
10 Correct 4 ms 1144 KB Output is correct
11 Correct 13 ms 1236 KB Output is correct
12 Correct 13 ms 1144 KB Output is correct
13 Correct 92 ms 1196 KB Output is correct
14 Correct 92 ms 1144 KB Output is correct
15 Correct 199 ms 1244 KB Output is correct
16 Correct 200 ms 1272 KB Output is correct
17 Correct 193 ms 1272 KB Output is correct
18 Correct 6 ms 1144 KB Output is correct
19 Correct 6 ms 1144 KB Output is correct
20 Correct 20 ms 1144 KB Output is correct
21 Correct 21 ms 1144 KB Output is correct
22 Correct 39 ms 1176 KB Output is correct
23 Correct 38 ms 1184 KB Output is correct
24 Correct 52 ms 1144 KB Output is correct
25 Correct 53 ms 1192 KB Output is correct
26 Correct 4 ms 1144 KB Output is correct
27 Correct 5 ms 1192 KB Output is correct
28 Correct 150 ms 1244 KB Output is correct
29 Correct 181 ms 1208 KB Output is correct
30 Correct 373 ms 1272 KB Output is correct
31 Correct 396 ms 1144 KB Output is correct
32 Correct 393 ms 1272 KB Output is correct
33 Correct 386 ms 1272 KB Output is correct
34 Correct 4 ms 1144 KB Output is correct
35 Correct 18 ms 1144 KB Output is correct
36 Correct 83 ms 1272 KB Output is correct
37 Correct 198 ms 1144 KB Output is correct
38 Correct 389 ms 1272 KB Output is correct
39 Correct 393 ms 1292 KB Output is correct
40 Correct 103 ms 1144 KB Output is correct
41 Correct 191 ms 1216 KB Output is correct
42 Correct 297 ms 1400 KB Output is correct
43 Correct 394 ms 1144 KB Output is correct
44 Correct 395 ms 1272 KB Output is correct
45 Correct 392 ms 1300 KB Output is correct
46 Correct 200 ms 1272 KB Output is correct
47 Correct 296 ms 1272 KB Output is correct
48 Correct 292 ms 1272 KB Output is correct