# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
483411 | A_D | Cloud Computing (CEOI18_clo) | C++14 | 18 ms | 34868 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define int long long
#define ii pair<int,int>
#define F first
#define S second
using namespace std;
const int N=2e3+100;
int dp[N][N];
int c[N];
ii f[N];
int C[N];
ii F[N];
int n;
int m;
int bc(int i,int j)
{
if(i==n+1){
return 0;
}
if(j==m+1){
return 0;
}
int&ret=dp[i][j];
if(ret!=-1)return ret;
ret=0;
int u=F[j].S-f[i].S;
if(f[i].F<F[j].F)u=0;
ret=max(ret,u+bc(i+1,j+1));
ret=max(ret,bc(i+1,j));
ret=max(ret,bc(i,j+1));
return ret;
}
void solve()
{
cin>>n;
for(int i=1;i<=n;i++){
scanf("%lld%lld%lld",&c[i],&f[i].F,&f[i].S);
}
cin>>m;
for(int i=1;i<=m;i++){
scanf("%lld%lld%lld",&C[i],&F[i].F,&F[i].S);
}
sort(f+1,f+n+1);
sort(F+1,F+m+1);
memset(dp,-1,sizeof(dp));
cout<<bc(1,1)<<endl;
}
main()
{
// freopen("face.in","r",stdin);
// freopen("face.out","w",stdout);
int t=1;
// cin>>t;
while(t--){
solve();
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |