Submission #956486

# Submission time Handle Problem Language Result Execution time Memory
956486 2024-04-02T05:28:56 Z modwwe Cloud Computing (CEOI18_clo) C++17
100 / 100
235 ms 4200 KB
#include<bits/stdc++.h>
#define int long long
#define down cout<<'\n';
#define NHP     ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
using namespace std;
void phongbeo();
mt19937 rd(chrono::high_resolution_clock::now().time_since_epoch().count    ());
const int mod2=1e9+7;
const int  mod1=998244353;
struct ib
{
    int a;
    int b;
};
struct icd
{
    int a,b;
};
struct ic
{
    int a,b,c;
};
struct id
{
    int a,b,c,d;
};
int minn=1e12+1,maxx=-1e9;
int n,m,s2,s4,s3,sf,k,r,dem=0,mid,s5,s6,mx,s7,s8,s9,mx2,res,dem2=0,l;
int  s,i,s10,s12;
int el=29;
main()
{
#ifndef ONLINE_JUDGE
//fin(task),fou(task);
#endif
    NHP
//modwwe
    phongbeo(),down
}
bool cmp(ic a,ic b)
{
    return a.b<b.b;
}
int dp[200001];
ic a[100001];
ic b[100001];
void phongbeo()
{
     cin>>n;
      for(int i=1;i<=n;i++)
         cin>>a[i].a>>a[i].b>>a[i].c,s5=max(s5,a[i].a),s7+=a[i].a;
          cin>>m;
          for(int i=1;i<=m;i++)
             cin>>b[i].a>>b[i].b>>b[i].c,s7+=b[i].a;
    sort(a+1,a+1+n,cmp);
     sort(b+1,b+1+m,cmp);
    s2=m;
    for(int i=1;i<=s7;i++)
        dp[i]=-1e18;
 for(int i=n;i>=0;--i)
 {
s6+=a[i].a;
  while(s2>=1&&b[s2].b>a[i].b){
        s2--;
             // cout<<dp[2]<<" "<<b[s2].a<<" "<<dp[5]<<" "<<b[s2].c,down
if(b[s2].b>a[i].b&&s2!=0)
          for(int j=b[s2].a;j<=s6;j++)
            dp[j-b[s2].a]=max(dp[j-b[s2].a],dp[j]+b[s2].c);
        }
if(i==0) break;
        for(int j=s6;j>=0;j--){
            dp[j+a[i].a]=max(dp[j+a[i].a],dp[j]-a[i].c);
            }
            if(i!=0)
            if(b[s2].b>a[i-1].b)
        for(int j=b[s2].a;j<=s6;j++){
            dp[j-b[s2].a]=max(dp[j-b[s2].a],dp[j]+b[s2].c);
            }
            //cout<<dp[7]<<" "<<i<<" "<<s2<<" "<<b[s2].a<<" "<<b[s2].c,down

 }
 s4=0;
 for(int j=0;j<=s6;j++){
    s4=max(s4,dp[j]);
   // cout<<dp[j]<<" "<<j,down
     }
 cout<<s4;
}

Compilation message

clo.cpp:38:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   38 | main()
      | ^~~~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2520 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2908 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 2 ms 3164 KB Output is correct
8 Correct 2 ms 3164 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 9 ms 2652 KB Output is correct
6 Correct 1 ms 2528 KB Output is correct
7 Correct 39 ms 2960 KB Output is correct
8 Correct 6 ms 2648 KB Output is correct
9 Correct 65 ms 3164 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2400 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2648 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 4 ms 2396 KB Output is correct
4 Correct 1 ms 2656 KB Output is correct
5 Correct 104 ms 3356 KB Output is correct
6 Correct 200 ms 3936 KB Output is correct
7 Correct 202 ms 3932 KB Output is correct
8 Correct 189 ms 3932 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 8 ms 2652 KB Output is correct
4 Correct 3 ms 2532 KB Output is correct
5 Correct 132 ms 4000 KB Output is correct
6 Correct 200 ms 3932 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2520 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2908 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 2 ms 3164 KB Output is correct
8 Correct 2 ms 3164 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 9 ms 2652 KB Output is correct
14 Correct 1 ms 2528 KB Output is correct
15 Correct 39 ms 2960 KB Output is correct
16 Correct 6 ms 2648 KB Output is correct
17 Correct 65 ms 3164 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 2400 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2648 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 4 ms 2396 KB Output is correct
29 Correct 1 ms 2656 KB Output is correct
30 Correct 104 ms 3356 KB Output is correct
31 Correct 200 ms 3936 KB Output is correct
32 Correct 202 ms 3932 KB Output is correct
33 Correct 189 ms 3932 KB Output is correct
34 Correct 1 ms 2396 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 8 ms 2652 KB Output is correct
37 Correct 3 ms 2532 KB Output is correct
38 Correct 132 ms 4000 KB Output is correct
39 Correct 200 ms 3932 KB Output is correct
40 Correct 9 ms 2904 KB Output is correct
41 Correct 31 ms 3164 KB Output is correct
42 Correct 3 ms 2396 KB Output is correct
43 Correct 229 ms 3928 KB Output is correct
44 Correct 235 ms 3932 KB Output is correct
45 Correct 154 ms 4200 KB Output is correct
46 Correct 2 ms 2392 KB Output is correct
47 Correct 3 ms 2396 KB Output is correct
48 Correct 3 ms 2396 KB Output is correct