oj.uz

답안 #369658

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
369658 2021-02-22T07:38:01 Z jainbot27 Cloud Computing (CEOI18_clo) C++17
100 / 100
 924 ms 1644 KB 
#include <bits/stdc++.h>
using namespace std;

#define int ll 
#define f first
#define s second
#define pb push_back
#define ar array
#define all(x) x.begin(), x.end()
#define siz(x) (int)x.size()

#define FOR(x, y, z) for(int x = (y); x < (z); x++)
#define ROF(x, z, y) for(int x = (y-1); x >= (z); x--)
#define F0R(x, z) FOR(x, 0, z)
#define R0F(x, z) ROF(x, 0, z)
#define trav(x, y) for(auto&x:y)

using ll = long long;
using vi = vector<int>;
using vl = vector<long long>;
using pii = pair<int, int>;
using vpii = vector<pair<int, int>>;

template<class T> inline bool ckmin(T&a, T b) {return b < a ? a = b, 1 : 0;}
template<class T> inline bool ckmax(T&a, T b) {return b > a ? a = b, 1 : 0;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const char nl = '\n';
const int mxN = 2e5 + 10;
const int MOD = 1e9 + 7;
const long long infLL = 1e18;

struct event{
    int v, f, c, t;
};

int n, m;
vector<event> e;
int dp[100005];

int32_t main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n;
    F0R(i, n){
        int V, F, C; cin >> C >> F >> V; e.pb({V, F, C, 0});
    }
    cin >> m;
    F0R(i, m){
        int V, F, C; cin >> C >> F >> V; e.pb({V, F, C, 1});
    }
    sort(all(e), [](event a, event b){
        if(a.f!=b.f) return a.f>b.f;
        if(a.t!=b.t) return a.t == 0;
        return a.v<b.v;
    });
    F0R(i, 100005) dp[i] = -infLL;
    dp[0] = 0;
    trav(x, e){
        if(x.t==0){
            R0F(j, 100005-x.c){
                ckmax(dp[j+x.c], dp[j]-x.v);
            }
        }
        else{
            FOR(j, x.c, 100005){
                ckmax(dp[j-x.c], dp[j]+x.v);
            }
        }
    }
    cout << *max_element(dp, dp+100005) << nl;
    return 0;
}

Subtask #1
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1132 KB Output is correct
2 Correct 1 ms 1132 KB Output is correct
3 Correct 36 ms 1132 KB Output is correct
4 Correct 69 ms 1260 KB Output is correct
5 Correct 601 ms 1388 KB Output is correct
6 Correct 632 ms 1312 KB Output is correct
7 Correct 562 ms 1312 KB Output is correct
8 Correct 506 ms 1388 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1132 KB Output is correct
2 Correct 3 ms 1132 KB Output is correct
3 Correct 14 ms 1132 KB Output is correct
4 Correct 14 ms 1132 KB Output is correct
5 Correct 117 ms 1132 KB Output is correct
6 Correct 110 ms 1260 KB Output is correct
7 Correct 286 ms 1260 KB Output is correct
8 Correct 245 ms 1260 KB Output is correct
9 Correct 230 ms 1388 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 1132 KB Output is correct
2 Correct 9 ms 1132 KB Output is correct
3 Correct 43 ms 1200 KB Output is correct
4 Correct 43 ms 1132 KB Output is correct
5 Correct 73 ms 1132 KB Output is correct
6 Correct 73 ms 1132 KB Output is correct
7 Correct 114 ms 1260 KB Output is correct
8 Correct 113 ms 1260 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1132 KB Output is correct
2 Correct 4 ms 1132 KB Output is correct
3 Correct 174 ms 1260 KB Output is correct
4 Correct 595 ms 1388 KB Output is correct
5 Correct 676 ms 1432 KB Output is correct
6 Correct 514 ms 1524 KB Output is correct
7 Correct 897 ms 1440 KB Output is correct
8 Correct 882 ms 1440 KB Output is correct

Subtask #5
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1132 KB Output is correct
2 Correct 41 ms 1132 KB Output is correct
3 Correct 151 ms 1260 KB Output is correct
4 Correct 493 ms 1388 KB Output is correct
5 Correct 619 ms 1516 KB Output is correct
6 Correct 474 ms 1388 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1132 KB Output is correct
2 Correct 1 ms 1132 KB Output is correct
3 Correct 36 ms 1132 KB Output is correct
4 Correct 69 ms 1260 KB Output is correct
5 Correct 601 ms 1388 KB Output is correct
6 Correct 632 ms 1312 KB Output is correct
7 Correct 562 ms 1312 KB Output is correct
8 Correct 506 ms 1388 KB Output is correct
9 Correct 2 ms 1132 KB Output is correct
10 Correct 3 ms 1132 KB Output is correct
11 Correct 14 ms 1132 KB Output is correct
12 Correct 14 ms 1132 KB Output is correct
13 Correct 117 ms 1132 KB Output is correct
14 Correct 110 ms 1260 KB Output is correct
15 Correct 286 ms 1260 KB Output is correct
16 Correct 245 ms 1260 KB Output is correct
17 Correct 230 ms 1388 KB Output is correct
18 Correct 9 ms 1132 KB Output is correct
19 Correct 9 ms 1132 KB Output is correct
20 Correct 43 ms 1200 KB Output is correct
21 Correct 43 ms 1132 KB Output is correct
22 Correct 73 ms 1132 KB Output is correct
23 Correct 73 ms 1132 KB Output is correct
24 Correct 114 ms 1260 KB Output is correct
25 Correct 113 ms 1260 KB Output is correct
26 Correct 4 ms 1132 KB Output is correct
27 Correct 4 ms 1132 KB Output is correct
28 Correct 174 ms 1260 KB Output is correct
29 Correct 595 ms 1388 KB Output is correct
30 Correct 676 ms 1432 KB Output is correct
31 Correct 514 ms 1524 KB Output is correct
32 Correct 897 ms 1440 KB Output is correct
33 Correct 882 ms 1440 KB Output is correct
34 Correct 2 ms 1132 KB Output is correct
35 Correct 41 ms 1132 KB Output is correct
36 Correct 151 ms 1260 KB Output is correct
37 Correct 493 ms 1388 KB Output is correct
38 Correct 619 ms 1516 KB Output is correct
39 Correct 474 ms 1388 KB Output is correct
40 Correct 236 ms 1260 KB Output is correct
41 Correct 436 ms 1312 KB Output is correct
42 Correct 675 ms 1412 KB Output is correct
43 Correct 800 ms 1516 KB Output is correct
44 Correct 702 ms 1516 KB Output is correct
45 Correct 924 ms 1644 KB Output is correct
46 Correct 446 ms 1336 KB Output is correct
47 Correct 678 ms 1452 KB Output is correct
48 Correct 655 ms 1388 KB Output is correct