| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 114484 | Dung | Two Dishes (JOI19_dishes) | C++11 | 0 ms | 0 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>
#include <iostream>
using namespace std;
unsigned int N,M;
vector<unsigned long> A;
vector<unsigned long> B;
vector<unsigned long long> S;
vector<unsigned long long> T;
vector<long> P;
vector<long> Q;
vector<unsigned long> suma, sumb;
unsigned long sum = 0;
long ans = 0;
unsigned long long curtime = 0;
long dp(unsigned int & posa,unsigned int & posb,const short int & state){
if(state == 1){
if(posa < N){
if(posb >= 0){
curtime = suma[posa] + sumb[posb];
}
else{
curtime = suma[posa];
}
if(curtime < S[posa]){
ans += P[posa];
}
return max(dp(++posa, posb,1),dp(posa,++posb,-1));
}
else{
long long ans1= ans;
ans -= P[posa - 1];
return ans1;
}
}
else if(state == -1){
if(posb < M){
if(posa >= 0){
curtime = suma[posa] + sumb[posb];
}
else{
curtime = sumb[posb];
}
if(curtime < S[posb]){
ans += Q[posb];
}
return max(dp(++posa, posb,1),dp(posa,++posb,-1));
}
else{
long long ans1= ans;
ans -= Q[posb - 1];
return ans1;
}
}
}
int main(){
cin >> N >> M;
A.resize(N);
S.resize(N);
P.resize(N);
suma.resize(N);
B.resize(M); T.resize(M); Q.resize(M); sumb.resize(M);
for(int i = 0;i< N;i++){
cin >> A[i] >> S[i] >> P[i];
sum += A[i];
suma[i] = sum;
}
sum = 0;
for(int i = 0;i< M;i++){
cin >> B[i] >> T[i] >> Q[i];
sum += B[i];
sumb[i] = sum;
}
cout << max(dp(0,-1,1),dp(-1,0,-1));
}