oj.uz

Submission #762263

# Submission time Handle Problem Language Result Execution time Memory
762263 2023-06-21T07:40:48 Z NeroZein Cloud Computing (CEOI18_clo) C++17
100 / 100
 494 ms 2056 KB 
#include "bits/stdc++.h"
#define int long long
using namespace std;

#ifdef Nero
#include "Deb.h"
#else
#define deb(...)
#endif

struct sth {
  int c, f, v;
};

const int N = 4003;
const int MX = 2000 * 50 + 1; 

sth a[N];
int pd[MX];
int dp[MX]; 

signed main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int n;
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    int c, f, v;
    cin >> c >> f >> v;
    a[i] = {c, f, -v};
  }
  int m;
  cin >> m;
  for (int i = 1; i <= m; ++i) {
    int c, f, v;
    cin >> c >> f >> v;
    a[i + n] = {-c, f, v}; 
  }
  sort(a + 1, a + n + m + 1, [&](const sth& x, const sth& y) {
    return (x.f == y.f ? x.c > y.c : x.f > y.f); 
  });
  fill(pd + 1, pd + MX, -1e15); 
  for (int i = 1; i <= n + m; ++i) {
    auto [c, f, v] = a[i]; 
    for (int j = 0; j < MX; ++j) {
      dp[j] = pd[j]; 
    }
    if (c < 0) {//order
      for (int j = 0; j - c < MX; ++j) {
        dp[j] = max(dp[j], pd[j - c] + v); 
      }
    } else {
      for (int j = c; j < MX; ++j) {
        dp[j] = max(dp[j], pd[j - c] + v);
      }
    }
    for (int j = 0; j < MX; ++j) {
      pd[j] = dp[j]; 
    }
  }
  int ans = 0; 
  for (int i = 0; i < MX; ++i) {
    ans = max(ans, dp[i]);
  }
  cout << ans << '\n'; 
  return 0;
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1876 KB Output is correct
2 Correct 1 ms 1864 KB Output is correct
3 Correct 14 ms 1876 KB Output is correct
4 Correct 25 ms 1904 KB Output is correct
5 Correct 240 ms 1948 KB Output is correct
6 Correct 227 ms 1960 KB Output is correct
7 Correct 248 ms 1960 KB Output is correct
8 Correct 262 ms 1956 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1820 KB Output is correct
2 Correct 2 ms 1864 KB Output is correct
3 Correct 14 ms 1860 KB Output is correct
4 Correct 14 ms 1892 KB Output is correct
5 Correct 112 ms 1912 KB Output is correct
6 Correct 114 ms 1904 KB Output is correct
7 Correct 245 ms 1920 KB Output is correct
8 Correct 244 ms 1960 KB Output is correct
9 Correct 232 ms 1936 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1860 KB Output is correct
2 Correct 5 ms 1876 KB Output is correct
3 Correct 23 ms 1900 KB Output is correct
4 Correct 25 ms 1884 KB Output is correct
5 Correct 44 ms 1884 KB Output is correct
6 Correct 43 ms 1888 KB Output is correct
7 Correct 60 ms 1872 KB Output is correct
8 Correct 59 ms 1876 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1876 KB Output is correct
2 Correct 3 ms 1876 KB Output is correct
3 Correct 188 ms 1916 KB Output is correct
4 Correct 226 ms 1928 KB Output is correct
5 Correct 450 ms 2004 KB Output is correct
6 Correct 473 ms 2004 KB Output is correct
7 Correct 482 ms 2012 KB Output is correct
8 Correct 494 ms 2004 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1876 KB Output is correct
2 Correct 22 ms 1876 KB Output is correct
3 Correct 98 ms 1876 KB Output is correct
4 Correct 278 ms 1932 KB Output is correct
5 Correct 474 ms 2020 KB Output is correct
6 Correct 477 ms 2004 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1876 KB Output is correct
2 Correct 1 ms 1864 KB Output is correct
3 Correct 14 ms 1876 KB Output is correct
4 Correct 25 ms 1904 KB Output is correct
5 Correct 240 ms 1948 KB Output is correct
6 Correct 227 ms 1960 KB Output is correct
7 Correct 248 ms 1960 KB Output is correct
8 Correct 262 ms 1956 KB Output is correct
9 Correct 2 ms 1820 KB Output is correct
10 Correct 2 ms 1864 KB Output is correct
11 Correct 14 ms 1860 KB Output is correct
12 Correct 14 ms 1892 KB Output is correct
13 Correct 112 ms 1912 KB Output is correct
14 Correct 114 ms 1904 KB Output is correct
15 Correct 245 ms 1920 KB Output is correct
16 Correct 244 ms 1960 KB Output is correct
17 Correct 232 ms 1936 KB Output is correct
18 Correct 5 ms 1860 KB Output is correct
19 Correct 5 ms 1876 KB Output is correct
20 Correct 23 ms 1900 KB Output is correct
21 Correct 25 ms 1884 KB Output is correct
22 Correct 44 ms 1884 KB Output is correct
23 Correct 43 ms 1888 KB Output is correct
24 Correct 60 ms 1872 KB Output is correct
25 Correct 59 ms 1876 KB Output is correct
26 Correct 4 ms 1876 KB Output is correct
27 Correct 3 ms 1876 KB Output is correct
28 Correct 188 ms 1916 KB Output is correct
29 Correct 226 ms 1928 KB Output is correct
30 Correct 450 ms 2004 KB Output is correct
31 Correct 473 ms 2004 KB Output is correct
32 Correct 482 ms 2012 KB Output is correct
33 Correct 494 ms 2004 KB Output is correct
34 Correct 2 ms 1876 KB Output is correct
35 Correct 22 ms 1876 KB Output is correct
36 Correct 98 ms 1876 KB Output is correct
37 Correct 278 ms 1932 KB Output is correct
38 Correct 474 ms 2020 KB Output is correct
39 Correct 477 ms 2004 KB Output is correct
40 Correct 125 ms 1996 KB Output is correct
41 Correct 227 ms 1936 KB Output is correct
42 Correct 361 ms 1876 KB Output is correct
43 Correct 469 ms 2008 KB Output is correct
44 Correct 484 ms 2020 KB Output is correct
45 Correct 479 ms 2056 KB Output is correct
46 Correct 242 ms 1940 KB Output is correct
47 Correct 361 ms 1984 KB Output is correct
48 Correct 384 ms 1980 KB Output is correct