oj.uz

Submission #518449

# Submission time Handle Problem Language Result Execution time Memory
518449 2022-01-23T20:29:45 Z Yazan_Alattar Cloud Computing (CEOI18_clo) C++14
100 / 100
 408 ms 1248 KB 
#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <list>
#include <utility>
#include <cmath>
#include <numeric>
#include <assert.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define all(x) x.begin(), x.end()
const int M = 300007;
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const double pi = acos(-1);
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};

pair < ll, pair <ll,ll> > a[M], b[M];
ll n, m, dp[M];

int main()
{
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n;
    for(int i = 1; i <= n; ++i) cin >> a[i].S.F >> a[i].F >> a[i].S.S;
    cin >> m;
    for(int i = 1; i <= m; ++i) cin >> b[i].S.F >> b[i].F >> b[i].S.S;
    sort(a + 1, a + n + 1);
    sort(b + 1, b + m + 1);
    for(int i = 1; i <= 1e5; ++i) dp[i] = -inf;
    int pos = n;
    for(int i = m; i > 0; --i){
        while(a[pos].F >= b[i].F){
            for(int j = 1e5; j >= a[pos].S.F; --j){
                dp[j] = max(dp[j], dp[j - a[pos].S.F] - a[pos].S.S);
            }
            --pos;
        }
        for(int j = b[i].S.F; j <= 1e5; ++j) dp[j - b[i].S.F] = max(dp[j - b[i].S.F], dp[j] + b[i].S.S);
    }
    ll ans = 0;
    for(int i = 0; i <= 1e5; ++i) ans = max(ans, dp[i]);
    cout << ans << endl;
    return 0;
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 10 ms 1100 KB Output is correct
4 Correct 18 ms 1120 KB Output is correct
5 Correct 153 ms 1140 KB Output is correct
6 Correct 157 ms 1100 KB Output is correct
7 Correct 160 ms 1100 KB Output is correct
8 Correct 163 ms 1152 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 11 ms 1100 KB Output is correct
4 Correct 9 ms 1100 KB Output is correct
5 Correct 72 ms 1120 KB Output is correct
6 Correct 83 ms 1120 KB Output is correct
7 Correct 149 ms 1144 KB Output is correct
8 Correct 165 ms 1144 KB Output is correct
9 Correct 156 ms 1144 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1100 KB Output is correct
2 Correct 3 ms 1112 KB Output is correct
3 Correct 14 ms 1116 KB Output is correct
4 Correct 11 ms 1116 KB Output is correct
5 Correct 31 ms 1100 KB Output is correct
6 Correct 31 ms 1104 KB Output is correct
7 Correct 41 ms 1100 KB Output is correct
8 Correct 44 ms 1108 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1100 KB Output is correct
2 Correct 2 ms 1100 KB Output is correct
3 Correct 123 ms 1132 KB Output is correct
4 Correct 164 ms 1160 KB Output is correct
5 Correct 312 ms 1232 KB Output is correct
6 Correct 363 ms 1240 KB Output is correct
7 Correct 343 ms 1232 KB Output is correct
8 Correct 315 ms 1248 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 10 ms 1100 KB Output is correct
3 Correct 71 ms 1100 KB Output is correct
4 Correct 161 ms 1144 KB Output is correct
5 Correct 332 ms 1192 KB Output is correct
6 Correct 335 ms 1196 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 10 ms 1100 KB Output is correct
4 Correct 18 ms 1120 KB Output is correct
5 Correct 153 ms 1140 KB Output is correct
6 Correct 157 ms 1100 KB Output is correct
7 Correct 160 ms 1100 KB Output is correct
8 Correct 163 ms 1152 KB Output is correct
9 Correct 1 ms 1100 KB Output is correct
10 Correct 1 ms 1100 KB Output is correct
11 Correct 11 ms 1100 KB Output is correct
12 Correct 9 ms 1100 KB Output is correct
13 Correct 72 ms 1120 KB Output is correct
14 Correct 83 ms 1120 KB Output is correct
15 Correct 149 ms 1144 KB Output is correct
16 Correct 165 ms 1144 KB Output is correct
17 Correct 156 ms 1144 KB Output is correct
18 Correct 3 ms 1100 KB Output is correct
19 Correct 3 ms 1112 KB Output is correct
20 Correct 14 ms 1116 KB Output is correct
21 Correct 11 ms 1116 KB Output is correct
22 Correct 31 ms 1100 KB Output is correct
23 Correct 31 ms 1104 KB Output is correct
24 Correct 41 ms 1100 KB Output is correct
25 Correct 44 ms 1108 KB Output is correct
26 Correct 2 ms 1100 KB Output is correct
27 Correct 2 ms 1100 KB Output is correct
28 Correct 123 ms 1132 KB Output is correct
29 Correct 164 ms 1160 KB Output is correct
30 Correct 312 ms 1232 KB Output is correct
31 Correct 363 ms 1240 KB Output is correct
32 Correct 343 ms 1232 KB Output is correct
33 Correct 315 ms 1248 KB Output is correct
34 Correct 1 ms 1100 KB Output is correct
35 Correct 10 ms 1100 KB Output is correct
36 Correct 71 ms 1100 KB Output is correct
37 Correct 161 ms 1144 KB Output is correct
38 Correct 332 ms 1192 KB Output is correct
39 Correct 335 ms 1196 KB Output is correct
40 Correct 83 ms 1136 KB Output is correct
41 Correct 160 ms 1180 KB Output is correct
42 Correct 246 ms 1244 KB Output is correct
43 Correct 335 ms 1248 KB Output is correct
44 Correct 408 ms 1232 KB Output is correct
45 Correct 326 ms 1232 KB Output is correct
46 Correct 161 ms 1176 KB Output is correct
47 Correct 240 ms 1208 KB Output is correct
48 Correct 244 ms 1224 KB Output is correct