oj.uz

답안 #243428

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
243428 2020-07-01T05:57:47 Z arnold518 Two Dishes (JOI19_dishes) C++14
5 / 100
 726 ms 31052 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 1e6;

int N, M;
ll A[MAXN+10], S[MAXN+10], P[MAXN+10];
ll B[MAXN+10], T[MAXN+10], Q[MAXN+10];
ll ans;

struct Point
{
	int x, y; ll w;
};
vector<Point> V;

ll tree[MAXN*4+10];
bool lazy[MAXN*4+10];

void busy(int node, int tl, int tr)
{
	if(!lazy[node]) return;
	tree[node]=0;
	if(tl!=tr) lazy[node*2]=true, lazy[node*2+1]=true;
	lazy[node]=false;
}

ll query(int node, int tl, int tr, int l, int r)
{
	busy(node, tl, tr);
	if(l<=tl && tr<=r) return tree[node];
	if(r<tl || tr<l) return 0;
	int mid=tl+tr>>1;
	return query(node*2, tl, mid, l, r)+query(node*2+1, mid+1, tr, l, r);
}

void update1(int node, int tl, int tr, int p, ll v)
{
	busy(node, tl, tr);
	if(tr<p) return;
	if(tl==tr)
	{
		tree[node]+=v;
		return;
	}
	int mid=tl+tr>>1;
	if(p<=mid) update1(node*2, tl, mid, p, v);
	else update1(node*2+1, mid+1, tr, p, v);
	tree[node]=tree[node*2]+tree[node*2+1];
}

void update2(int node, int tl, int tr, int l, int r)
{
	if(r<l) return;
	busy(node, tl, tr);
	if(l<=tl && tr<=r)
	{
		lazy[node]=true;
		busy(node, tl, tr);
		return;
	}
	if(r<tl || tr<l) return;
	int mid=tl+tr>>1;
	update2(node*2, tl, mid, l, r);
	update2(node*2+1, mid+1, tr, l, r);
	tree[node]=tree[node*2]+tree[node*2+1];
}

int main()
{
	int i, j;

	scanf("%d%d", &N, &M);
	for(i=1; i<=N; i++) scanf("%lld%lld%lld", &A[i], &S[i], &P[i]), A[i]+=A[i-1];
	for(i=1; i<=M; i++) scanf("%lld%lld%lld", &B[i], &T[i], &Q[i]), B[i]+=B[i-1];

	for(i=1; i<=N; i++)
	{
		if(A[i]>S[i]) continue;
		int x=i, y=upper_bound(B+1, B+M+1, S[i]-A[i])-B-1;
		
		ans+=P[i];

		if(y!=M)
		{
			x--; y++;
			V.push_back({x, y, -P[i]});
		}
	}
	for(i=1; i<=M; i++)
	{
		if(B[i]>T[i]) continue;
		int y=i, x=upper_bound(A+1, A+N+1, T[i]-B[i])-A-1;
		
		if(x!=N)
		{	
			V.push_back({x, y, Q[i]});
		}
		else ans+=Q[i];
	}
	//printf("ANS %lld\n", ans);

	sort(V.begin(), V.end(), [&](const Point &p, const Point &q)
	{
		if(p.x!=q.x) return p.x<q.x;
		if(p.y!=q.y) return p.y>q.y;
		return p.w>q.w;
	});

	//for(i=0; i<V.size(); i++) printf("%d %d %lld\n", V[i].x, V[i].y, V[i].w);

	if(V.empty()) return !printf("%lld\n", ans);

	for(i=0; i+1<V.size(); i++)
	{	
		//printf("!%d %d %lld\n", V[i].x, V[i].y, V[i].w);
		int y=V[i].y; ll w=V[i].w;

		if(w>=0)
		{
			update1(1, 0, M, y, w);
		}
		else
		{
			int lo=0, hi=M+1;
			ll t=query(1, 0, M, 0, y-1)-w;
			while(lo+1<hi)
			{
				int mid=lo+hi>>1;
				if(query(1, 0, M, 0, mid)<=t) lo=mid;
				else hi=mid;
			}
			//printf("U2 %d %d\n", y, lo);
			ll p=query(1, 0, M, 0, hi), q=query(1, 0, M, hi, hi);
			update2(1, 0, M, y, lo);
			update1(1, 0, M, hi, -q+p-t);
		}
		//for(j=0; j<=M; j++) printf("%lld ", query(1, 0, M, 0, j));
		//printf("\n");
	}
	ll t=0;
	update1(1, 0, M, V.back().y, V.back().w);
	for(i=0; i<=M; i++)  t=max(t, query(1, 0, M, 0, i));
	ans+=t;
	printf("%lld\n", ans);
}

Compilation message

dishes.cpp: In function 'll query(int, int, int, int, int)':
dishes.cpp:37:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid=tl+tr>>1;
          ~~^~~
dishes.cpp: In function 'void update1(int, int, int, int, ll)':
dishes.cpp:50:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid=tl+tr>>1;
          ~~^~~
dishes.cpp: In function 'void update2(int, int, int, int, int)':
dishes.cpp:67:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid=tl+tr>>1;
          ~~^~~
dishes.cpp: In function 'int main()':
dishes.cpp:118:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(i=0; i+1<V.size(); i++)
           ~~~^~~~~~~~~
dishes.cpp:133:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
     int mid=lo+hi>>1;
             ~~^~~
dishes.cpp:75:9: warning: unused variable 'j' [-Wunused-variable]
  int i, j;
         ^
dishes.cpp:77: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:78:64: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(i=1; i<=N; i++) scanf("%lld%lld%lld", &A[i], &S[i], &P[i]), A[i]+=A[i-1];
                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
dishes.cpp:79:64: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(i=1; i<=M; i++) scanf("%lld%lld%lld", &B[i], &T[i], &Q[i]), B[i]+=B[i-1];
                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 705 ms 20176 KB Output is correct
2 Correct 607 ms 19256 KB Output is correct
3 Correct 210 ms 9976 KB Output is correct
4 Correct 540 ms 16476 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 671 ms 31052 KB Output is correct
7 Correct 131 ms 12028 KB Output is correct
8 Correct 110 ms 12216 KB Output is correct
9 Correct 216 ms 24184 KB Output is correct
10 Correct 726 ms 28244 KB Output is correct
11 Correct 155 ms 17528 KB Output is correct

Subtask #2
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 705 ms 20176 KB Output is correct
2 Correct 607 ms 19256 KB Output is correct
3 Correct 210 ms 9976 KB Output is correct
4 Correct 540 ms 16476 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 671 ms 31052 KB Output is correct
7 Correct 131 ms 12028 KB Output is correct
8 Correct 110 ms 12216 KB Output is correct
9 Correct 216 ms 24184 KB Output is correct
10 Correct 726 ms 28244 KB Output is correct
11 Correct 155 ms 17528 KB Output is correct
12 Incorrect 5 ms 384 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 705 ms 20176 KB Output is correct
2 Correct 607 ms 19256 KB Output is correct
3 Correct 210 ms 9976 KB Output is correct
4 Correct 540 ms 16476 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 671 ms 31052 KB Output is correct
7 Correct 131 ms 12028 KB Output is correct
8 Correct 110 ms 12216 KB Output is correct
9 Correct 216 ms 24184 KB Output is correct
10 Correct 726 ms 28244 KB Output is correct
11 Correct 155 ms 17528 KB Output is correct
12 Incorrect 5 ms 384 KB Output isn't correct
13 Halted 0 ms 0 KB -