Submission #1006342

# Submission time Handle Problem Language Result Execution time Memory
1006342 2024-06-23T19:24:56 Z christinelynn Cloud Computing (CEOI18_clo) C++17
100 / 100
345 ms 1472 KB
#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define repp(i,x,n) for(int i=x;i<=n;i++)
#define repo(i,x,n) for(int i=x;i>=n;i--)
#define cy cout<<"Yes"<<endl
#define cn cout<<"No"<<endl
#define r0 return 0
#define fi first
#define se second
#define liow ios_base::sync_with_stdio(false);cin.tie(NULL)
#define jelek cout<<"jelek"<<endl
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define pi pair<pair<int,int>,pair<int,int>>
#define p4 pair<pii,pii>
#define fl fflush(stdout)
using namespace std;
const int mod=1e9+7,maxn=1e6+5,N=(1<<17),INF=1e18;

void solve(){
  int n;cin>>n;
  vector<pair<pair<int,int>,pair<int,int>>>v;
  repp(i,1,n){
    int c,f,d;cin>>c>>f>>d;
    v.pb({{f,1},{c,d}});
  }
  int m;cin>>m;
  repp(i,1,m){
    int c,f,d;cin>>c>>f>>d;
    v.pb({{f,0},{c,d}});
  }
  sort(all(v),greater<p4>());
  int dp[100005];
  dp[0]=0;
  repp(i,1,100000) dp[i]=-INF;
  for(int i=0;i<v.size();i++){
    if(v[i].fi.se==1){
      for(int j=100000;j>=1;j--){
        if(j-v[i].se.fi<0 || dp[j-v[i].se.fi]==-INF) continue;
        dp[j]=max(dp[j],dp[j-v[i].se.fi]-v[i].se.se);
      }
    } else {
      for(int j=0;j<=100000;j++){
        if(j+v[i].se.fi>100000 || dp[j+v[i].se.fi]==-INF) continue;
        dp[j]=max(dp[j],dp[j+v[i].se.fi]+v[i].se.se);
      }
    }
  }
  int ans=0;
  repp(i,0,100000){
    ans=max(ans,dp[i]);
  }
  cout<<ans;
}

signed main() {
    liow;
    int t=1;
//  cin>>t;
    while(t--){
      solve();
  }
}

Compilation message

clo.cpp: In function 'void solve()':
clo.cpp:37:16: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<std::pair<long long int, long long int>, std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |   for(int i=0;i<v.size();i++){
      |               ~^~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1112 KB Output is correct
3 Correct 7 ms 1236 KB Output is correct
4 Correct 12 ms 1116 KB Output is correct
5 Correct 128 ms 1332 KB Output is correct
6 Correct 112 ms 1112 KB Output is correct
7 Correct 121 ms 1116 KB Output is correct
8 Correct 143 ms 1340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 7 ms 1236 KB Output is correct
4 Correct 8 ms 1236 KB Output is correct
5 Correct 61 ms 1112 KB Output is correct
6 Correct 53 ms 1112 KB Output is correct
7 Correct 138 ms 1336 KB Output is correct
8 Correct 116 ms 1112 KB Output is correct
9 Correct 179 ms 1112 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 1112 KB Output is correct
2 Correct 3 ms 1116 KB Output is correct
3 Correct 13 ms 1116 KB Output is correct
4 Correct 13 ms 1112 KB Output is correct
5 Correct 21 ms 1112 KB Output is correct
6 Correct 24 ms 1112 KB Output is correct
7 Correct 34 ms 1116 KB Output is correct
8 Correct 34 ms 1112 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 1116 KB Output is correct
2 Correct 2 ms 1116 KB Output is correct
3 Correct 94 ms 1328 KB Output is correct
4 Correct 115 ms 1112 KB Output is correct
5 Correct 285 ms 1456 KB Output is correct
6 Correct 297 ms 1372 KB Output is correct
7 Correct 314 ms 1368 KB Output is correct
8 Correct 286 ms 1368 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 11 ms 1116 KB Output is correct
3 Correct 77 ms 1116 KB Output is correct
4 Correct 141 ms 1336 KB Output is correct
5 Correct 269 ms 1464 KB Output is correct
6 Correct 345 ms 1372 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1112 KB Output is correct
3 Correct 7 ms 1236 KB Output is correct
4 Correct 12 ms 1116 KB Output is correct
5 Correct 128 ms 1332 KB Output is correct
6 Correct 112 ms 1112 KB Output is correct
7 Correct 121 ms 1116 KB Output is correct
8 Correct 143 ms 1340 KB Output is correct
9 Correct 1 ms 1112 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 7 ms 1236 KB Output is correct
12 Correct 8 ms 1236 KB Output is correct
13 Correct 61 ms 1112 KB Output is correct
14 Correct 53 ms 1112 KB Output is correct
15 Correct 138 ms 1336 KB Output is correct
16 Correct 116 ms 1112 KB Output is correct
17 Correct 179 ms 1112 KB Output is correct
18 Correct 3 ms 1112 KB Output is correct
19 Correct 3 ms 1116 KB Output is correct
20 Correct 13 ms 1116 KB Output is correct
21 Correct 13 ms 1112 KB Output is correct
22 Correct 21 ms 1112 KB Output is correct
23 Correct 24 ms 1112 KB Output is correct
24 Correct 34 ms 1116 KB Output is correct
25 Correct 34 ms 1112 KB Output is correct
26 Correct 2 ms 1116 KB Output is correct
27 Correct 2 ms 1116 KB Output is correct
28 Correct 94 ms 1328 KB Output is correct
29 Correct 115 ms 1112 KB Output is correct
30 Correct 285 ms 1456 KB Output is correct
31 Correct 297 ms 1372 KB Output is correct
32 Correct 314 ms 1368 KB Output is correct
33 Correct 286 ms 1368 KB Output is correct
34 Correct 1 ms 1116 KB Output is correct
35 Correct 11 ms 1116 KB Output is correct
36 Correct 77 ms 1116 KB Output is correct
37 Correct 141 ms 1336 KB Output is correct
38 Correct 269 ms 1464 KB Output is correct
39 Correct 345 ms 1372 KB Output is correct
40 Correct 71 ms 1116 KB Output is correct
41 Correct 133 ms 1340 KB Output is correct
42 Correct 239 ms 1436 KB Output is correct
43 Correct 311 ms 1472 KB Output is correct
44 Correct 286 ms 1372 KB Output is correct
45 Correct 300 ms 1472 KB Output is correct
46 Correct 128 ms 1116 KB Output is correct
47 Correct 224 ms 1372 KB Output is correct
48 Correct 196 ms 1368 KB Output is correct