Submission #1174911

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1174911	2025-03-27 15:54:03	Dan4Life	Cloud Computing (CEOI18_clo)	C++20	100 / 100	234 ms	1480 KiB

clo

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) begin(a),end(a)
using ll = long long;
using ar4 = array<ll,4>;
const int mxN = (int)2e5+10;
const int mxM = 50*2000+2;
const ll LINF = (ll)2e18;
ll dp[mxM];
vector<ar4> a;
int main(){
  ios_base::sync_with_stdio(false); cin.tie(0);
  for(int t:{0,1}){
    int n,c,f,v; cin >> n;
    while(n--) cin>>c>>f>>v, a.pb({c,f,v*(t?1:-1),t});
  }
  sort(all(a),[&](ar4 x, ar4 y){
    if(x[1]!=y[1]) return x[1]>y[1];
    return x[3]<y[3];
  });
  fill(dp+1,dp+mxM,-LINF);
  for(auto [c,f,v,t] : a){
    if(!t){
      for(int j = mxM-1; j>=c; j--)
        dp[j] = max(dp[j], dp[j-c]+v);
    }
    else{
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 18 / 18
• Subtask 2: 18 / 18
• Subtask 3: 18 / 18
• Subtask 4: 18 / 18
• Subtask 5: 18 / 18
• Subtask 6: 10 / 10