oj.uz

Submission #467942

# Submission time Handle Problem Language Result Execution time Memory
467942 2021-08-25T16:31:26 Z ivan_tudor Cloud Computing (CEOI18_clo) C++14
100 / 100
 492 ms 1476 KB 
#include<bits/stdc++.h>
using namespace std;
const int N = 2005;
const int NM = N * 50;
long long dp[NM];
struct requesth{
  int c, f, v;
  bool tip;
};
bool cmp(requesth a, requesth b){
  if(a.f == b.f)
    return a.tip < b.tip;
  return a.f > b.f;
}
vector<requesth> v;
int main()
{
  //freopen(".in","r",stdin);
  ios::sync_with_stdio(false);
  cin.tie(0),cout.tie(0);
  long long sum = 0;
  int n, m;
  cin>>n;
  for(int i =1; i<=n; i++){
    int c, f, val;
    cin>>c>>f>>val;
    sum -= 1LL * val;
    v.push_back({c, f, val, false});
    v.push_back({c, f, val, true});
  }
  cin>>m;
  for(int i =1; i<=m; i++ ){
    int c, f, val;
    cin>>c>>f>>val;
    v.push_back({c, f, val, true});
  }
  sort(v.begin(), v.end(), cmp);
  for(int i = 0; i < NM; i++){
    dp[i] = LLONG_MIN;
  }
  dp[0] = sum;
  long long csum = 0;
  for(auto x: v){
    if(x.tip == 0){
      csum += x.c;
      for(int i = csum; i >= 0; i--){
        if(i - x.c >= 0)
          dp[i] = dp[i - x.c];
        else
          dp[i] = LLONG_MIN;
      }

    }
    if(x.tip == 1){
      for(int i = 0; i<= csum - x.c; i++){
        dp[i] = max(dp[i], dp[i + x.c] + 1LL * x.v);
      }
    }
  }
  long long ans = 0;
  for(int i = 0; i < NM; i++)
    ans = max(ans, dp[i]);
  cout<<ans;
  return 0;
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1084 KB Output is correct
3 Correct 1 ms 1088 KB Output is correct
4 Correct 1 ms 1100 KB Output is correct
5 Correct 2 ms 1100 KB Output is correct
6 Correct 2 ms 1100 KB Output is correct
7 Correct 3 ms 1100 KB Output is correct
8 Correct 3 ms 1100 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 1220 KB Output is correct
3 Correct 1 ms 1100 KB Output is correct
4 Correct 1 ms 1100 KB Output is correct
5 Correct 24 ms 1176 KB Output is correct
6 Correct 2 ms 1100 KB Output is correct
7 Correct 111 ms 1168 KB Output is correct
8 Correct 15 ms 1268 KB Output is correct
9 Correct 261 ms 1228 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 1 ms 1100 KB Output is correct
4 Correct 1 ms 1100 KB Output is correct
5 Correct 1 ms 1100 KB Output is correct
6 Correct 1 ms 1136 KB Output is correct
7 Correct 2 ms 1100 KB Output is correct
8 Correct 2 ms 1100 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 16 ms 1092 KB Output is correct
4 Correct 2 ms 1100 KB Output is correct
5 Correct 242 ms 1368 KB Output is correct
6 Correct 492 ms 1356 KB Output is correct
7 Correct 455 ms 1356 KB Output is correct
8 Correct 438 ms 1360 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 21 ms 1088 KB Output is correct
4 Correct 7 ms 1228 KB Output is correct
5 Correct 283 ms 1360 KB Output is correct
6 Correct 474 ms 1228 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1084 KB Output is correct
3 Correct 1 ms 1088 KB Output is correct
4 Correct 1 ms 1100 KB Output is correct
5 Correct 2 ms 1100 KB Output is correct
6 Correct 2 ms 1100 KB Output is correct
7 Correct 3 ms 1100 KB Output is correct
8 Correct 3 ms 1100 KB Output is correct
9 Correct 1 ms 972 KB Output is correct
10 Correct 1 ms 1220 KB Output is correct
11 Correct 1 ms 1100 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 24 ms 1176 KB Output is correct
14 Correct 2 ms 1100 KB Output is correct
15 Correct 111 ms 1168 KB Output is correct
16 Correct 15 ms 1268 KB Output is correct
17 Correct 261 ms 1228 KB Output is correct
18 Correct 1 ms 1100 KB Output is correct
19 Correct 1 ms 1100 KB Output is correct
20 Correct 1 ms 1100 KB Output is correct
21 Correct 1 ms 1100 KB Output is correct
22 Correct 1 ms 1100 KB Output is correct
23 Correct 1 ms 1136 KB Output is correct
24 Correct 2 ms 1100 KB Output is correct
25 Correct 2 ms 1100 KB Output is correct
26 Correct 1 ms 1100 KB Output is correct
27 Correct 1 ms 1100 KB Output is correct
28 Correct 16 ms 1092 KB Output is correct
29 Correct 2 ms 1100 KB Output is correct
30 Correct 242 ms 1368 KB Output is correct
31 Correct 492 ms 1356 KB Output is correct
32 Correct 455 ms 1356 KB Output is correct
33 Correct 438 ms 1360 KB Output is correct
34 Correct 1 ms 1100 KB Output is correct
35 Correct 1 ms 1100 KB Output is correct
36 Correct 21 ms 1088 KB Output is correct
37 Correct 7 ms 1228 KB Output is correct
38 Correct 283 ms 1360 KB Output is correct
39 Correct 474 ms 1228 KB Output is correct
40 Correct 19 ms 1172 KB Output is correct
41 Correct 52 ms 1228 KB Output is correct
42 Correct 7 ms 1228 KB Output is correct
43 Correct 425 ms 1476 KB Output is correct
44 Correct 402 ms 1476 KB Output is correct
45 Correct 331 ms 1396 KB Output is correct
46 Correct 3 ms 1228 KB Output is correct
47 Correct 6 ms 1228 KB Output is correct
48 Correct 6 ms 1228 KB Output is correct