# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
927035 | 2024-02-14T07:11:50 Z | Amaarsaa | Cloud Computing (CEOI18_clo) | C++14 | 364 ms | 1544 KB |
#include<bits/stdc++.h> using namespace std; using ll = long long ; const int N = 1e5 + 2; struct Com { ll c, f, v, req; }; Com C; int main() { // freopen("moocast.in", "r", stdin); // freopen("moocast.out", "w", stdout); ios::sync_with_stdio(false); cin.tie(NULL); ll t, n, m, ans, s, sum, x, y, r, p, i, j; cin >> n; vector < Com > v; for (i = 1; i <= n; i ++) { cin >> C.c >> C.f >> C.v; C.req = 0; v.push_back(C); } cin >> m; for (i = 1; i <= m; i ++) { cin >> C.c >> C.f >> C.v; C.req = 1; v.push_back(C); } sort(v.begin(), v.end(), [](Com& A, Com& B){ if ( A.f == B.f) return A.req > B.req; return A.f > B.f; }); vector < ll > dp(N + 2, -1e9); dp[0] = 0; for (Com& A : v) { if ( A.req == 1) { for (i = 0; i + A.c <= N; i ++) { dp[i] = max(dp[i], dp[i + A.c] + A.v); } } else { for (i = N; i >= A.c; i --) { dp[i] = max(dp[i], dp[i - A.c] - A.v); } } } ans = 0; for (i= 0; i <= N; i ++) { ans =max(ans, dp[i]); } cout << ans << endl; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 1116 KB | Output is correct |
2 | Correct | 1 ms | 1116 KB | Output is correct |
3 | Correct | 10 ms | 1116 KB | Output is correct |
4 | Correct | 19 ms | 1116 KB | Output is correct |
5 | Correct | 195 ms | 1400 KB | Output is correct |
6 | Incorrect | 175 ms | 1400 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 1116 KB | Output is correct |
2 | Correct | 2 ms | 1116 KB | Output is correct |
3 | Correct | 11 ms | 1264 KB | Output is correct |
4 | Correct | 11 ms | 1256 KB | Output is correct |
5 | Correct | 90 ms | 1116 KB | Output is correct |
6 | Correct | 86 ms | 1116 KB | Output is correct |
7 | Correct | 190 ms | 1372 KB | Output is correct |
8 | Incorrect | 188 ms | 1372 KB | Output isn't correct |
9 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 1116 KB | Output is correct |
2 | Correct | 3 ms | 1220 KB | Output is correct |
3 | Correct | 17 ms | 1116 KB | Output is correct |
4 | Correct | 17 ms | 1116 KB | Output is correct |
5 | Incorrect | 34 ms | 1116 KB | Output isn't correct |
6 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 1368 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 1116 KB | Output is correct |
2 | Correct | 15 ms | 1112 KB | Output is correct |
3 | Correct | 95 ms | 1296 KB | Output is correct |
4 | Correct | 182 ms | 1372 KB | Output is correct |
5 | Correct | 363 ms | 1544 KB | Output is correct |
6 | Correct | 364 ms | 1368 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 1116 KB | Output is correct |
2 | Correct | 1 ms | 1116 KB | Output is correct |
3 | Correct | 10 ms | 1116 KB | Output is correct |
4 | Correct | 19 ms | 1116 KB | Output is correct |
5 | Correct | 195 ms | 1400 KB | Output is correct |
6 | Incorrect | 175 ms | 1400 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |