oj.uz

답안 #260198

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
260198 2020-08-09T16:37:28 Z HynDuf Cloud Computing (CEOI18_clo) C++14
100 / 100
 1222 ms 2168 KB 
#include <bits/stdc++.h>

#define task "C"
#define all(v) (v).begin(), (v).end()
#define rep(i, l, r) for (int i = (l); i <= (r); ++i)
#define Rep(i, r, l) for (int i = (r); i >= (l); --i)
#define DB(X) { cerr << #X << " = " << (X) << '\n'; }
#define DB1(A, _) { cerr << #A << "[" << _ << "] = " << (A[_]) << '\n'; }
#define DB2(A, _, __) { cerr << #A << "[" << _ << "][" << __ << "] = " << (A[_][__]) << '\n'; }
#define DB3(A, _, __, ___) { cerr << #A << "[" << _ << "][" << __ << "][" << ___ << "] = " << (A[_][__][___]) << '\n'; }
#define PR(A, l, r) { cerr << '\n'; rep(_, l, r) DB1(A, _); cerr << '\n';}
#define SZ(x) ((int)(x).size())
#define pb push_back
#define eb emplace_back
#define pf push_front
#define F first
#define S second
#define by(x) [](const auto& a, const auto& b) { return a.x < b.x; } // sort(arr, arr + N, by(a));
#define next ___next
#define prev ___prev
#define y1 ___y1
#define left ___left
#define right ___right
#define y0 ___y0
#define div ___div
#define j0 ___j0
#define jn ___jn

using ll = long long;
using ld = long double;
using ull = unsigned long long;
using namespace std;
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<ll> vl;
const int N = 2003;
int n, m;
ll dp[2][N * 50];
struct Item
{
    int cores, fr, val;
    Item() {}
    Item(int c, int f, int v) : cores(c), fr(f), val(v) {}
    bool operator < (const Item &oth)
    {
        return (fr > oth.fr) || (fr == oth.fr && cores > oth.cores);
    }
};
vector<Item> order;
int main()
{
#ifdef HynDuf
    freopen(task".in", "r", stdin);
    //freopen(task".out", "w", stdout);
#else
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
#endif
    cin >> n;
    int mxCores = 0;
    rep(i, 1, n)
    {
        int c, f, v;
        cin >> c >> f >> v;
        order.pb(Item(c, f, -v));
        mxCores += c;
    }
    cin >> m;
    rep(i, 1, m)
    {
        int c, f, v;
        cin >> c >> f >> v;
        order.pb(Item(-c, f, v));
    }
    sort(all(order));
    rep(i, 1, mxCores) dp[0][i] = -1e18;
    int now = 0, lst = 1;
    for (Item I : order)
    {
        swap(now, lst);
        rep(i, 0, mxCores) dp[now][i] = dp[lst][i];
        rep(numCores, 0, mxCores)
        {
            if (numCores >= I.cores && numCores - I.cores <= mxCores
                && dp[lst][numCores - I.cores] != -1e18)
                dp[now][numCores] = max(dp[now][numCores], dp[lst][numCores - I.cores] + I.val);
        }
    }
    ll ans = 0;
    rep(numCores, 0, mxCores) ans = max(ans, dp[now][numCores]);
    cout << ans;
    return 0;
}

Subtask #1
18.0 / 18.0

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

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 67 ms 768 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 328 ms 1332 KB Output is correct
8 Correct 58 ms 640 KB Output is correct
9 Correct 530 ms 1816 KB Output is correct

Subtask #3
18.0 / 18.0

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

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 22 ms 512 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 643 ms 1340 KB Output is correct
6 Correct 1193 ms 1980 KB Output is correct
7 Correct 1211 ms 1920 KB Output is correct
8 Correct 1211 ms 1888 KB Output is correct

Subtask #5
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 64 ms 768 KB Output is correct
4 Correct 14 ms 384 KB Output is correct
5 Correct 1087 ms 1912 KB Output is correct
6 Correct 1222 ms 1896 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 6 ms 384 KB Output is correct
8 Correct 7 ms 512 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 67 ms 768 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 328 ms 1332 KB Output is correct
16 Correct 58 ms 640 KB Output is correct
17 Correct 530 ms 1816 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 0 ms 384 KB Output is correct
27 Correct 0 ms 384 KB Output is correct
28 Correct 22 ms 512 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 643 ms 1340 KB Output is correct
31 Correct 1193 ms 1980 KB Output is correct
32 Correct 1211 ms 1920 KB Output is correct
33 Correct 1211 ms 1888 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 2 ms 384 KB Output is correct
36 Correct 64 ms 768 KB Output is correct
37 Correct 14 ms 384 KB Output is correct
38 Correct 1087 ms 1912 KB Output is correct
39 Correct 1222 ms 1896 KB Output is correct
40 Correct 77 ms 768 KB Output is correct
41 Correct 203 ms 1016 KB Output is correct
42 Correct 16 ms 512 KB Output is correct
43 Correct 1152 ms 2108 KB Output is correct
44 Correct 1144 ms 2168 KB Output is correct
45 Correct 1119 ms 2168 KB Output is correct
46 Correct 7 ms 384 KB Output is correct
47 Correct 16 ms 512 KB Output is correct
48 Correct 16 ms 512 KB Output is correct