oj.uz

Submission #538642

# Submission time Handle Problem Language Result Execution time Memory
538642 2022-03-17T10:17:22 Z ddy888 Cloud Computing (CEOI18_clo) C++17
100 / 100
 490 ms 1284 KB 
#undef _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define int long long 
#define pb push_back
#define fi first
#define si second
#define ar array
typedef pair<int,int> pi;
typedef tuple<int,int,int> ti;  
void debug_out() {cerr<<endl;}
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {cerr<<" "<<to_string(H);debug_out(T...);}
#define debug(...) cerr<<"["<<#__VA_ARGS__<<"]:",debug_out(__VA_ARGS__)

struct event {
    int c, f, v, flag;
} items[5010];

const int INF = 1e18, lim = 100010;
int N, M, st, ans = 0;
int dp[100010];

signed main() {
    cin >> N;
    for (int i = 1; i <= N; ++i) {
        cin >> items[i].c >> items[i].f >> items[i].v;
        items[i].flag = 1;
    }
    cin >> M;
    for (int i = N + 1; i <= N + M; ++i) {
        cin >> items[i].c >> items[i].f >> items[i].v;
        items[i].flag = 0;
    }
    sort(items + 1, items + 1 + N + M, [](event a, event b) {
        if (a.f == b.f) return a.flag > b.flag;
        return a.f > b.f;
    });
    for (int i = 0; i <= lim; ++i) dp[i] = -INF;
    dp[0] = 0;
    for (int i = 1; i <= N + M; ++i) {
        if (items[i].flag) {
            for (int j = lim - 1; j >= 0; --j) {
                int index = j + items[i].c;
                int profit = dp[j] - items[i].v;
                if (index < lim) dp[index] = max(dp[index], profit);
            }
        } else {
            for (int j = 0; j < lim; ++j) {
                int index = j - items[i].c;
                int profit = dp[j] + items[i].v;
                if (index >= 0 && dp[j] != -INF) dp[index] = max(dp[index], profit);
            }
        }
    } // push dp
    for (int i = 0; i < lim; ++i) ans = max(ans, dp[i]);
    cout << ans;
    return 0;
}

Compilation message

clo.cpp: In function 'int main()':
clo.cpp:40:42: warning: iteration 100010 invokes undefined behavior [-Waggressive-loop-optimizations]
   40 |     for (int i = 0; i <= lim; ++i) dp[i] = -INF;
      |                                    ~~~~~~^~~~~~
clo.cpp:40:23: note: within this loop
   40 |     for (int i = 0; i <= lim; ++i) dp[i] = -INF;
      |                     ~~^~~~~~

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 16 ms 980 KB Output is correct
4 Correct 25 ms 1092 KB Output is correct
5 Correct 212 ms 1120 KB Output is correct
6 Correct 217 ms 1108 KB Output is correct
7 Correct 316 ms 1128 KB Output is correct
8 Correct 236 ms 1108 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 2 ms 980 KB Output is correct
3 Correct 11 ms 1088 KB Output is correct
4 Correct 17 ms 980 KB Output is correct
5 Correct 94 ms 1088 KB Output is correct
6 Correct 85 ms 1096 KB Output is correct
7 Correct 201 ms 1132 KB Output is correct
8 Correct 250 ms 1128 KB Output is correct
9 Correct 177 ms 1124 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 980 KB Output is correct
2 Correct 4 ms 980 KB Output is correct
3 Correct 18 ms 1080 KB Output is correct
4 Correct 22 ms 1088 KB Output is correct
5 Correct 47 ms 1076 KB Output is correct
6 Correct 47 ms 980 KB Output is correct
7 Correct 50 ms 980 KB Output is correct
8 Correct 50 ms 980 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 980 KB Output is correct
2 Correct 4 ms 980 KB Output is correct
3 Correct 166 ms 1112 KB Output is correct
4 Correct 226 ms 1116 KB Output is correct
5 Correct 387 ms 1180 KB Output is correct
6 Correct 426 ms 1236 KB Output is correct
7 Correct 431 ms 1236 KB Output is correct
8 Correct 406 ms 1236 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 980 KB Output is correct
2 Correct 21 ms 1084 KB Output is correct
3 Correct 81 ms 1108 KB Output is correct
4 Correct 200 ms 1108 KB Output is correct
5 Correct 412 ms 1184 KB Output is correct
6 Correct 463 ms 1192 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 16 ms 980 KB Output is correct
4 Correct 25 ms 1092 KB Output is correct
5 Correct 212 ms 1120 KB Output is correct
6 Correct 217 ms 1108 KB Output is correct
7 Correct 316 ms 1128 KB Output is correct
8 Correct 236 ms 1108 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 2 ms 980 KB Output is correct
11 Correct 11 ms 1088 KB Output is correct
12 Correct 17 ms 980 KB Output is correct
13 Correct 94 ms 1088 KB Output is correct
14 Correct 85 ms 1096 KB Output is correct
15 Correct 201 ms 1132 KB Output is correct
16 Correct 250 ms 1128 KB Output is correct
17 Correct 177 ms 1124 KB Output is correct
18 Correct 4 ms 980 KB Output is correct
19 Correct 4 ms 980 KB Output is correct
20 Correct 18 ms 1080 KB Output is correct
21 Correct 22 ms 1088 KB Output is correct
22 Correct 47 ms 1076 KB Output is correct
23 Correct 47 ms 980 KB Output is correct
24 Correct 50 ms 980 KB Output is correct
25 Correct 50 ms 980 KB Output is correct
26 Correct 3 ms 980 KB Output is correct
27 Correct 4 ms 980 KB Output is correct
28 Correct 166 ms 1112 KB Output is correct
29 Correct 226 ms 1116 KB Output is correct
30 Correct 387 ms 1180 KB Output is correct
31 Correct 426 ms 1236 KB Output is correct
32 Correct 431 ms 1236 KB Output is correct
33 Correct 406 ms 1236 KB Output is correct
34 Correct 2 ms 980 KB Output is correct
35 Correct 21 ms 1084 KB Output is correct
36 Correct 81 ms 1108 KB Output is correct
37 Correct 200 ms 1108 KB Output is correct
38 Correct 412 ms 1184 KB Output is correct
39 Correct 463 ms 1192 KB Output is correct
40 Correct 105 ms 1228 KB Output is correct
41 Correct 226 ms 1148 KB Output is correct
42 Correct 354 ms 1208 KB Output is correct
43 Correct 459 ms 1236 KB Output is correct
44 Correct 490 ms 1264 KB Output is correct
45 Correct 479 ms 1284 KB Output is correct
46 Correct 194 ms 1228 KB Output is correct
47 Correct 287 ms 1216 KB Output is correct
48 Correct 299 ms 1196 KB Output is correct