oj.uz

Submission #320924

# Submission time Handle Problem Language Result Execution time Memory
320924 2020-11-10T09:13:31 Z phathnv Cloud Computing (CEOI18_clo) C++11
100 / 100
 1379 ms 2156 KB 
#include <bits/stdc++.h>

#define mp make_pair
#define X first
#define Y second
#define taskname "CloudComputing"

using namespace std;

typedef long long ll;
typedef pair <int, int> ii;

const int C = 100001;
const ll INF = 1e18;

struct order{
    int type; /// 0 buy, 1: sell
    int c, f, v;
    order(int _t, int _c, int _f, int _v){
        type = _t;
        c = _c;
        f = _f;
        v = _v;
    }
};

int n, m;
ll dp[C], nxtDp[C];
vector <order> ords;

void readInput(){
    cin >> n;
    for(int i = 1; i <= n; i++){
        int c, f, v;
        cin >> c >> f >> v;
        ords.push_back(order(0, c, f, -v));
    }
    cin >> m;
    for(int i = 1; i <= m; i++){
        int c, f, v;
        cin >> c >> f >> v;
        ords.push_back(order(1, -c, f, v));
    }
}

void solve(){
    sort(ords.begin(), ords.end(), [](const order &a, const order &b){
            if (a.f != b.f)
                return a.f > b.f;
            return a.type < b.type;
        });

    dp[0] = 0;
    for(int i = 1; i < C; i++)
        dp[i] = -INF;
    for(order o : ords){
        int c = o.c;
        int v = o.v;
        for(int i = 0; i < C; i++)
            nxtDp[i] = -INF;
        for(int i = 0; i < C; i++){
            nxtDp[i] = max(nxtDp[i], dp[i]);
            if (0 <= i + c && i + c < C)
                nxtDp[i + c] = max(nxtDp[i + c], dp[i] + v);
        }
        for(int i = 0; i < C; i++)
            swap(dp[i], nxtDp[i]);
    }
    ll res = -1;
    for(int i = 0; i < C; i++)
        res = max(res, dp[i]);
    cout << res;
}

int main(){
    if (fopen(taskname".inp", "r")){
        freopen(taskname".inp", "r", stdin);
        freopen(taskname".out", "w", stdout);
    }
    readInput();
    solve();
    return 0;
}

Compilation message

clo.cpp: In function 'int main()':
clo.cpp:77:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   77 |         freopen(taskname".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
clo.cpp:78:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   78 |         freopen(taskname".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1900 KB Output is correct
2 Correct 2 ms 1900 KB Output is correct
3 Correct 37 ms 1900 KB Output is correct
4 Correct 71 ms 1900 KB Output is correct
5 Correct 637 ms 2156 KB Output is correct
6 Correct 646 ms 2040 KB Output is correct
7 Correct 688 ms 2148 KB Output is correct
8 Correct 664 ms 2148 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1900 KB Output is correct
2 Correct 5 ms 2028 KB Output is correct
3 Correct 38 ms 1900 KB Output is correct
4 Correct 40 ms 1900 KB Output is correct
5 Correct 304 ms 1900 KB Output is correct
6 Correct 335 ms 2020 KB Output is correct
7 Correct 679 ms 2148 KB Output is correct
8 Correct 705 ms 2040 KB Output is correct
9 Correct 653 ms 1900 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 1900 KB Output is correct
2 Correct 12 ms 1900 KB Output is correct
3 Correct 71 ms 1900 KB Output is correct
4 Correct 65 ms 1920 KB Output is correct
5 Correct 134 ms 1956 KB Output is correct
6 Correct 132 ms 1900 KB Output is correct
7 Correct 179 ms 1900 KB Output is correct
8 Correct 182 ms 2020 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1900 KB Output is correct
2 Correct 7 ms 1900 KB Output is correct
3 Correct 513 ms 2004 KB Output is correct
4 Correct 604 ms 2012 KB Output is correct
5 Correct 1281 ms 2148 KB Output is correct
6 Correct 1350 ms 2100 KB Output is correct
7 Correct 1347 ms 2108 KB Output is correct
8 Correct 1303 ms 2028 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1900 KB Output is correct
2 Correct 54 ms 2020 KB Output is correct
3 Correct 293 ms 1900 KB Output is correct
4 Correct 681 ms 2012 KB Output is correct
5 Correct 1325 ms 2116 KB Output is correct
6 Correct 1354 ms 2084 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1900 KB Output is correct
2 Correct 2 ms 1900 KB Output is correct
3 Correct 37 ms 1900 KB Output is correct
4 Correct 71 ms 1900 KB Output is correct
5 Correct 637 ms 2156 KB Output is correct
6 Correct 646 ms 2040 KB Output is correct
7 Correct 688 ms 2148 KB Output is correct
8 Correct 664 ms 2148 KB Output is correct
9 Correct 3 ms 1900 KB Output is correct
10 Correct 5 ms 2028 KB Output is correct
11 Correct 38 ms 1900 KB Output is correct
12 Correct 40 ms 1900 KB Output is correct
13 Correct 304 ms 1900 KB Output is correct
14 Correct 335 ms 2020 KB Output is correct
15 Correct 679 ms 2148 KB Output is correct
16 Correct 705 ms 2040 KB Output is correct
17 Correct 653 ms 1900 KB Output is correct
18 Correct 12 ms 1900 KB Output is correct
19 Correct 12 ms 1900 KB Output is correct
20 Correct 71 ms 1900 KB Output is correct
21 Correct 65 ms 1920 KB Output is correct
22 Correct 134 ms 1956 KB Output is correct
23 Correct 132 ms 1900 KB Output is correct
24 Correct 179 ms 1900 KB Output is correct
25 Correct 182 ms 2020 KB Output is correct
26 Correct 7 ms 1900 KB Output is correct
27 Correct 7 ms 1900 KB Output is correct
28 Correct 513 ms 2004 KB Output is correct
29 Correct 604 ms 2012 KB Output is correct
30 Correct 1281 ms 2148 KB Output is correct
31 Correct 1350 ms 2100 KB Output is correct
32 Correct 1347 ms 2108 KB Output is correct
33 Correct 1303 ms 2028 KB Output is correct
34 Correct 4 ms 1900 KB Output is correct
35 Correct 54 ms 2020 KB Output is correct
36 Correct 293 ms 1900 KB Output is correct
37 Correct 681 ms 2012 KB Output is correct
38 Correct 1325 ms 2116 KB Output is correct
39 Correct 1354 ms 2084 KB Output is correct
40 Correct 359 ms 1900 KB Output is correct
41 Correct 633 ms 2020 KB Output is correct
42 Correct 1202 ms 2088 KB Output is correct
43 Correct 1326 ms 2112 KB Output is correct
44 Correct 1342 ms 2120 KB Output is correct
45 Correct 1379 ms 2156 KB Output is correct
46 Correct 730 ms 2020 KB Output is correct
47 Correct 1078 ms 2144 KB Output is correct
48 Correct 1052 ms 2088 KB Output is correct