Submission #260215

#	Time	Username	Problem	Language	Result	Execution time	Memory
260215		patrikpavic2	Two Dishes (JOI19_dishes)	C++17	74 / 100	3059 ms	168444 KiB

dishes

#include <cstdio>
#include <cstring>
#include <vector>
#include <set>
#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], 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];
set < int > raz;

void pocisti(int sad){
	if(del[sad] > 0){
		raz.insert(sad);
		return;
	}
	if(!del[sad] && raz.count(sad))
		raz.erase(sad);
	if(del[sad] >= 0) return;
	ll trb = -del[sad];
	del[sad] = 0;
	sad++;
	while(sad <= m && trb > 0){
		if(del[sad] > trb){
			del[sad] -= trb;
			break;
		}
		trb -= del[sad]; del[sad] = 0;
		raz.erase(sad);
		if(raz.lower_bound(sad) == raz.end())
			break;
		sad = *(raz.upper_bound(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;
	}
	ll ans = 0;
	for(int i = 1;i <= m;i++){
		brisi[TT[i]].PB(i);	
	}
	for(int i = 0;i <= n;i++){
		if(i){
			del[0] += P[i]; //printf("del[0] += %d\n", P[i]);
			del[SS[i] + 1] -= P[i];		
			pocisti(SS[i] + 1);
		}
		//printf("od %d do %d + %d na %d\n", 0, SS[i], P[i], i);
		for(int j : brisi[i]){
			del[0] -= Q[j]; //printf("del[0] -= %d\n", Q[j]);
			del[j] += Q[j];
			ans += Q[j];
			//printf("od %d do %d + %d na %d\n", 0, j - 1, -Q[j], i);
			pocisti(j);
		}
		//printf("start = %lld\n", ans);
		//ll cur = ans;
		//for(int j = 0;j <= m;j++){
		//	cur += del[j];
		//	printf("%lld ", cur);
		//	if(j == m) printf("\n");
		//}
	}
	for(int i = 0;i <= m;i++)
		ans += del[i];
	printf("%lld\n", ans);
}

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: 5 / 5
• Subtask 2: 3 / 3
• Subtask 3: 7 / 7
• Subtask 4: 39 / 39
• Subtask 5: 11 / 11
• Subtask 6: 9 / 9
• Subtask 7: 0 / 17
• Subtask 8: 0 / 9