Submission #259184

#	Time	Username	Problem	Language	Result	Execution time	Memory
259184		patrikpavic2	Two Dishes (JOI19_dishes)	C++17	10 / 100	10076 ms	49768 KiB

dishes

#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
 
#define PB push_back
 
using namespace std;
 
typedef long long ll;
 
const int N = 1e6 + 500;
const ll INF = 1e18;
 
ll del[N],  mora[N], S[N], T[N];
int n, m;
int Q[N], P[N], A[N], B[N];
int SS[N], TT[N];
vector < ll > v, v2;
vector < int > brisi[N];
 
/** 
 
int bio[N][N];
ll dp[N][N];
 
ll f(int x, int y){
	if(x == 0 && y == 0) return 0;
	if(bio[x][y]) return dp[x][y];
	ll ret = -INF;
	if(x)
		ret = max(ret, f(x - 1, y) + (y <= SS[x] ? P[x] : 0));
	if(y)
		ret = max(ret, f(x, y - 1) + (x <= TT[y] ? Q[y] : 0));
	bio[x][y] = 1; dp[x][y] = ret;
	return dp[x][y];
}
 
**/
 
void pocisti(int sad){
	while(sad <= m && del[sad] < mora[sad]){
		del[sad + 1] -= mora[sad] - del[sad];
		del[sad] = mora[sad]; sad++;
	}
}
 
 
int main(){
	scanf("%d%d", &n, &m);
	for(int i = 1;i <= n;i++)
		scanf("%d%lld%d", A + i, S + i, P + i);
	for(int i = 1;i <= m;i++)
		scanf("%d%lld%d", B + i, T + i, Q + i);
	ll cur = 0; v.PB(cur);
	for(int i = 1;i <= m;i++)
		cur += B[i], v.PB(cur);
	cur = 0; v2.PB(cur);
	for(int i = 1;i <= n;i++){
		cur += A[i]; v2.PB(cur);
		if(S[i] < cur)
			P[i] = 0, S[i] = cur;
		SS[i] = upper_bound(v.begin(), v.end(), S[i] - cur) - v.begin() - 1;
	}
	cur = 0;
	for(int i = 1;i <= m;i++){
		cur += B[i];
		if(T[i] < cur)
			Q[i] = 0, T[i] = cur;
		TT[i] = upper_bound(v2.begin(), v2.end(), T[i] - cur) - v2.begin() - 1;
	}
	for(int i = 1;i <= m;i++){
		del[i] = Q[i], mora[i] = Q[i];
		if(TT[i]) brisi[TT[i]].PB(i);
		else{
			mora[i] = 0; pocisti(i);
		}
	}
	//cur = 0;
	//for(int i = 1;i <= n;i++)
	//	printf("S[ %d ] = %d P[ %d ] = %d\n", i, SS[i], i, P[i]);
	//for(int i = 1;i <= m;i++)
	//	printf("T[ %d ] = %d Q[ %d ] = %d\n", i, TT[i], i, Q[i]);
	//for(int j = 0;j <= m;j++){
	//	cur += del[j];
	//	printf("%lld ", cur);
	//	if(j == m) printf("\n");
	//}
	for(int i = 1;i <= n;i++){
		del[0] += P[i];
		del[SS[i] + 1] -= P[i];
		pocisti(SS[i] + 1);
		//for(int j = 0;j <= m;j++)
		//	printf("mora[ %d ] = %d\n", j, mora[j]);
		//ll cur = 0;
		//for(int j = 0;j <= m;j++){
		//	cur += del[j];
			//if(f(i, j) != cur){
			//	printf("kurac na %d %d\n", i, j);
			//}
			//printf("%lld ", cur);
			//if(j == m) printf("\n");
		//}
		if(i == n) break;
		for(int j : brisi[i]){
			mora[j] = 0; pocisti(j);
		}
		//for(int j = 0;j <= m;j++){
		//	printf("%lld ", del[j]);
		//	if(j == m) printf("\n");
		//}
	}
	//printf("----------\n");
	//for(int i = 0;i <= n;i++){
	//	for(int j = 0;j <= m;j++)
	//		printf("%lld ", f(i, j));
	//	printf("\n");
	//}
	ll ans = 0;
	for(int i = 0;i <= m;i++)
		ans += del[i];
	printf("%lld\n", ans);
	//printf("%lld %lld\n", ans, f(n, m));
}

Compilation message (stderr)

dishes.cpp: In function 'int main()':
dishes.cpp:50:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &m);
  ~~~~~^~~~~~~~~~~~~~~~
dishes.cpp:52:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%lld%d", A + i, S + i, P + i);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dishes.cpp:54:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%lld%d", B + i, T + i, Q + i);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 5
• Subtask 2: 3 / 3
• Subtask 3: 7 / 7
• Subtask 4: 0 / 39
• Subtask 5: 0 / 11
• Subtask 6: 0 / 9
• Subtask 7: 0 / 17
• Subtask 8: 0 / 9