oj.uz

답안 #709702

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
709702 2023-03-14T08:13:56 Z alvingogo Two Dishes (JOI19_dishes) C++14
74 / 100
 6227 ms 323304 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define AquA cin.tie(0);ios_base::sync_with_stdio(0);
#define fs first
#define sc second
#define p_q priority_queue
#define int long long
using namespace std;

const int inf=1e18;
struct ST{
	vector<pair<int,int> > st;
	void init(int x){
		st.resize(4*x);
	}
	void upd(int v,int x){
		st[v].fs+=x;
		st[v].sc+=x;
	}
	void pudo(int v){
		upd(2*v+1,st[v].sc);
		upd(2*v+2,st[v].sc);
		st[v].sc=0;
	}
	void pull(int v){
		st[v].fs=max(st[2*v+1].fs,st[2*v+2].fs);
	}
	void update(int v,int L,int R,int l,int r,int k){
		if(L==l && r==R){
			upd(v,k);
			return;
		}
		int m=(L+R)/2;
		pudo(v);
		if(r<=m){
			update(2*v+1,L,m,l,r,k);
		}
		else if(l>m){
			update(2*v+2,m+1,R,l,r,k);
		}
		else{
			update(2*v+1,L,m,l,m,k);
			update(2*v+2,m+1,R,m+1,r,k);
		}
		pull(v);
	}
	int query(int v,int L,int R,int l,int r){
		if(L==l && r==R){
			return st[v].fs;
		}
		pudo(v);
		int m=(L+R)/2;
		if(r<=m){
			return query(2*v+1,L,m,l,r);
		}
		else if(l>m){
			return query(2*v+2,m+1,R,l,r);
		}
		else{
			return max(query(2*v+1,L,m,l,m),query(2*v+2,m+1,R,m+1,r));
		}
	}
}st;

struct BIT{
	int n;
	vector<int> bt;
	void init(int x){
		n=x;
		bt.resize(n+1);
	}
	void update(int x,int y){
		for(;x>0;x-=(x&-x)){
			bt[x]+=y;
		}
	}
	int query(int x){
		int ans=0;
		for(;x<=n;x+=(x&-x)){
			ans+=bt[x];
		}
		return ans;
	}
}bt,bt2;


bool cmp(pair<int,int> a,pair<int,int> b){
	return a.sc!=b.sc?a.sc<b.sc:a.fs<b.fs;
}
signed main(){
    AquA;
	int n,m;
	cin >> n >> m;
	vector<int> a(n+1),b(m+1),s(n+1),t(m+1),p(n+1),q(m+1);
	for(int i=1;i<=n;i++){
		cin >> a[i] >> s[i] >> p[i];
		a[i]+=a[i-1];
	}
	for(int j=1;j<=m;j++){
		cin >> b[j] >> t[j] >> q[j];
		b[j]+=b[j-1];
	}
	vector<pair<int,int> > gg;
	vector<int> oka(n+1),okb(m+2);
	vector<pair<int,int> > to;
	vector<int> vis(n+2);
	for(int i=1;i<=n;i++){
		oka[i]=upper_bound(b.begin(),b.end(),s[i]-a[i])-b.begin()-1;
		if(oka[i]<0){
			continue;
		}
		to.push_back({oka[i],i});
	}
	for(int i=1;i<=m;i++){
		okb[i]=upper_bound(a.begin(),a.end(),t[i]-b[i])-a.begin()-1;
		if(okb[i]<0){
			q[i]=0;
			continue;
		}
		if(okb[i]>=n){
		}
		else{
			to.push_back({i-1,okb[i]+1});
		}
	}
	to.push_back({m,n+1});
	sort(to.begin(),to.end(),[&](pair<int,int> a,pair<int,int> b){
		return a.fs!=b.fs?a.fs<b.fs:a.sc>b.sc;
	});
	to.erase(unique(to.begin(),to.end()),to.end());
	gg=to;
	sort(gg.begin(),gg.end(),cmp);
	n=gg.size();
	vector<int> newp(n+1);
	for(auto &h:to){
		if(h.fs<0){
			continue;
		}
		int flag=-1;
		if(!vis[h.sc] && h.fs==oka[h.sc]){
			vis[h.sc]=1;
			flag=h.sc;
		}
		h.sc=lower_bound(gg.begin(),gg.end(),h,cmp)-gg.begin()+1;
		if(flag>=0){
			newp[h.sc]=p[flag];
		}
	}
	st.init(n+1);
	bt.init(n);
	bt2.init(n);
	st.update(0,0,n,1,n,-inf);
	for(int i=1;i<=n;i++){
		st.update(0,0,n,0,i-1,newp[i]);
		bt.update(i,newp[i]);
	}
	int l=0;
	vector<int> dp(n+1);
	for(int i=1;i<=m;i++){
		if(okb[i]>=0){
			okb[i]=lower_bound(gg.begin(),gg.end(),pair<int,int>(-inf,okb[i]+1),cmp)-gg.begin();
		}
	}
	for(int i=0;i<=m+1;i++){
		if(i>0 && i<=m && okb[i]>=0){
			st.update(0,0,n,0,okb[i],q[i]);
			bt2.update(okb[i],q[i]);
		}
		while(l<(int)to.size() && to[l].fs==i){
			int x=to[l].sc;
			dp[x]=st.query(0,0,n,0,x-1)-bt.query(x+1);
			st.update(0,0,n,x,x,dp[x]+inf-bt2.query(x));
			st.update(0,0,n,0,x-1,-newp[x]);
			bt.update(x,-newp[x]);
			l++;
		}
	}
	cout << dp[n] << "\n";
    return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 470 ms 49216 KB Output is correct
2 Correct 463 ms 50236 KB Output is correct
3 Correct 362 ms 42332 KB Output is correct
4 Correct 375 ms 34760 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 445 ms 48304 KB Output is correct
7 Correct 86 ms 9292 KB Output is correct
8 Correct 245 ms 36176 KB Output is correct
9 Correct 381 ms 42560 KB Output is correct
10 Correct 465 ms 45956 KB Output is correct
11 Correct 309 ms 42736 KB Output is correct

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 4 ms 724 KB Output is correct
18 Correct 4 ms 972 KB Output is correct
19 Correct 6 ms 1032 KB Output is correct
20 Correct 4 ms 724 KB Output is correct
21 Correct 5 ms 980 KB Output is correct
22 Correct 5 ms 980 KB Output is correct
23 Correct 5 ms 976 KB Output is correct

Subtask #4
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 4 ms 724 KB Output is correct
18 Correct 4 ms 972 KB Output is correct
19 Correct 6 ms 1032 KB Output is correct
20 Correct 4 ms 724 KB Output is correct
21 Correct 5 ms 980 KB Output is correct
22 Correct 5 ms 980 KB Output is correct
23 Correct 5 ms 976 KB Output is correct
24 Correct 370 ms 42740 KB Output is correct
25 Correct 478 ms 55220 KB Output is correct
26 Correct 335 ms 42712 KB Output is correct
27 Correct 479 ms 55236 KB Output is correct
28 Correct 475 ms 45888 KB Output is correct
29 Correct 340 ms 42716 KB Output is correct
30 Correct 1043 ms 66332 KB Output is correct
31 Correct 179 ms 21372 KB Output is correct
32 Correct 257 ms 35540 KB Output is correct
33 Correct 518 ms 41996 KB Output is correct
34 Correct 858 ms 62328 KB Output is correct
35 Correct 935 ms 65924 KB Output is correct
36 Correct 850 ms 64612 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 4 ms 724 KB Output is correct
18 Correct 4 ms 972 KB Output is correct
19 Correct 6 ms 1032 KB Output is correct
20 Correct 4 ms 724 KB Output is correct
21 Correct 5 ms 980 KB Output is correct
22 Correct 5 ms 980 KB Output is correct
23 Correct 5 ms 976 KB Output is correct
24 Correct 370 ms 42740 KB Output is correct
25 Correct 478 ms 55220 KB Output is correct
26 Correct 335 ms 42712 KB Output is correct
27 Correct 479 ms 55236 KB Output is correct
28 Correct 475 ms 45888 KB Output is correct
29 Correct 340 ms 42716 KB Output is correct
30 Correct 1043 ms 66332 KB Output is correct
31 Correct 179 ms 21372 KB Output is correct
32 Correct 257 ms 35540 KB Output is correct
33 Correct 518 ms 41996 KB Output is correct
34 Correct 858 ms 62328 KB Output is correct
35 Correct 935 ms 65924 KB Output is correct
36 Correct 850 ms 64612 KB Output is correct
37 Correct 428 ms 42560 KB Output is correct
38 Correct 498 ms 55108 KB Output is correct
39 Correct 436 ms 45848 KB Output is correct
40 Correct 436 ms 45872 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1010 ms 66368 KB Output is correct
43 Correct 516 ms 41508 KB Output is correct
44 Correct 825 ms 61968 KB Output is correct
45 Correct 915 ms 67236 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 4 ms 724 KB Output is correct
18 Correct 4 ms 972 KB Output is correct
19 Correct 6 ms 1032 KB Output is correct
20 Correct 4 ms 724 KB Output is correct
21 Correct 5 ms 980 KB Output is correct
22 Correct 5 ms 980 KB Output is correct
23 Correct 5 ms 976 KB Output is correct
24 Correct 370 ms 42740 KB Output is correct
25 Correct 478 ms 55220 KB Output is correct
26 Correct 335 ms 42712 KB Output is correct
27 Correct 479 ms 55236 KB Output is correct
28 Correct 475 ms 45888 KB Output is correct
29 Correct 340 ms 42716 KB Output is correct
30 Correct 1043 ms 66332 KB Output is correct
31 Correct 179 ms 21372 KB Output is correct
32 Correct 257 ms 35540 KB Output is correct
33 Correct 518 ms 41996 KB Output is correct
34 Correct 858 ms 62328 KB Output is correct
35 Correct 935 ms 65924 KB Output is correct
36 Correct 850 ms 64612 KB Output is correct
37 Correct 428 ms 42560 KB Output is correct
38 Correct 498 ms 55108 KB Output is correct
39 Correct 436 ms 45848 KB Output is correct
40 Correct 436 ms 45872 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1010 ms 66368 KB Output is correct
43 Correct 516 ms 41508 KB Output is correct
44 Correct 825 ms 61968 KB Output is correct
45 Correct 915 ms 67236 KB Output is correct
46 Correct 2260 ms 200180 KB Output is correct
47 Correct 2665 ms 261144 KB Output is correct
48 Correct 2377 ms 214996 KB Output is correct
49 Correct 2363 ms 215140 KB Output is correct
50 Correct 6227 ms 323304 KB Output is correct
51 Correct 3143 ms 191940 KB Output is correct
52 Correct 4851 ms 290676 KB Output is correct
53 Correct 5945 ms 316216 KB Output is correct

Subtask #7
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 470 ms 49216 KB Output is correct
2 Correct 463 ms 50236 KB Output is correct
3 Correct 362 ms 42332 KB Output is correct
4 Correct 375 ms 34760 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 445 ms 48304 KB Output is correct
7 Correct 86 ms 9292 KB Output is correct
8 Correct 245 ms 36176 KB Output is correct
9 Correct 381 ms 42560 KB Output is correct
10 Correct 465 ms 45956 KB Output is correct
11 Correct 309 ms 42736 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 320 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 320 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 320 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 4 ms 724 KB Output is correct
29 Correct 4 ms 972 KB Output is correct
30 Correct 6 ms 1032 KB Output is correct
31 Correct 4 ms 724 KB Output is correct
32 Correct 5 ms 980 KB Output is correct
33 Correct 5 ms 980 KB Output is correct
34 Correct 5 ms 976 KB Output is correct
35 Correct 370 ms 42740 KB Output is correct
36 Correct 478 ms 55220 KB Output is correct
37 Correct 335 ms 42712 KB Output is correct
38 Correct 479 ms 55236 KB Output is correct
39 Correct 475 ms 45888 KB Output is correct
40 Correct 340 ms 42716 KB Output is correct
41 Correct 1043 ms 66332 KB Output is correct
42 Correct 179 ms 21372 KB Output is correct
43 Correct 257 ms 35540 KB Output is correct
44 Correct 518 ms 41996 KB Output is correct
45 Correct 858 ms 62328 KB Output is correct
46 Correct 935 ms 65924 KB Output is correct
47 Correct 850 ms 64612 KB Output is correct
48 Correct 428 ms 42560 KB Output is correct
49 Correct 498 ms 55108 KB Output is correct
50 Correct 436 ms 45848 KB Output is correct
51 Correct 436 ms 45872 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 1010 ms 66368 KB Output is correct
54 Correct 516 ms 41508 KB Output is correct
55 Correct 825 ms 61968 KB Output is correct
56 Correct 915 ms 67236 KB Output is correct
57 Correct 359 ms 42904 KB Output is correct
58 Correct 517 ms 55352 KB Output is correct
59 Correct 444 ms 44040 KB Output is correct
60 Correct 438 ms 44128 KB Output is correct
61 Correct 964 ms 65976 KB Output is correct
62 Correct 0 ms 212 KB Output is correct
63 Correct 944 ms 64512 KB Output is correct
64 Correct 539 ms 45404 KB Output is correct
65 Correct 814 ms 62816 KB Output is correct
66 Incorrect 919 ms 69376 KB Output isn't correct
67 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 470 ms 49216 KB Output is correct
2 Correct 463 ms 50236 KB Output is correct
3 Correct 362 ms 42332 KB Output is correct
4 Correct 375 ms 34760 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 445 ms 48304 KB Output is correct
7 Correct 86 ms 9292 KB Output is correct
8 Correct 245 ms 36176 KB Output is correct
9 Correct 381 ms 42560 KB Output is correct
10 Correct 465 ms 45956 KB Output is correct
11 Correct 309 ms 42736 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 320 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 320 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 320 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 4 ms 724 KB Output is correct
29 Correct 4 ms 972 KB Output is correct
30 Correct 6 ms 1032 KB Output is correct
31 Correct 4 ms 724 KB Output is correct
32 Correct 5 ms 980 KB Output is correct
33 Correct 5 ms 980 KB Output is correct
34 Correct 5 ms 976 KB Output is correct
35 Correct 370 ms 42740 KB Output is correct
36 Correct 478 ms 55220 KB Output is correct
37 Correct 335 ms 42712 KB Output is correct
38 Correct 479 ms 55236 KB Output is correct
39 Correct 475 ms 45888 KB Output is correct
40 Correct 340 ms 42716 KB Output is correct
41 Correct 1043 ms 66332 KB Output is correct
42 Correct 179 ms 21372 KB Output is correct
43 Correct 257 ms 35540 KB Output is correct
44 Correct 518 ms 41996 KB Output is correct
45 Correct 858 ms 62328 KB Output is correct
46 Correct 935 ms 65924 KB Output is correct
47 Correct 850 ms 64612 KB Output is correct
48 Correct 428 ms 42560 KB Output is correct
49 Correct 498 ms 55108 KB Output is correct
50 Correct 436 ms 45848 KB Output is correct
51 Correct 436 ms 45872 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 1010 ms 66368 KB Output is correct
54 Correct 516 ms 41508 KB Output is correct
55 Correct 825 ms 61968 KB Output is correct
56 Correct 915 ms 67236 KB Output is correct
57 Correct 2260 ms 200180 KB Output is correct
58 Correct 2665 ms 261144 KB Output is correct
59 Correct 2377 ms 214996 KB Output is correct
60 Correct 2363 ms 215140 KB Output is correct
61 Correct 6227 ms 323304 KB Output is correct
62 Correct 3143 ms 191940 KB Output is correct
63 Correct 4851 ms 290676 KB Output is correct
64 Correct 5945 ms 316216 KB Output is correct
65 Correct 359 ms 42904 KB Output is correct
66 Correct 517 ms 55352 KB Output is correct
67 Correct 444 ms 44040 KB Output is correct
68 Correct 438 ms 44128 KB Output is correct
69 Correct 964 ms 65976 KB Output is correct
70 Correct 0 ms 212 KB Output is correct
71 Correct 944 ms 64512 KB Output is correct
72 Correct 539 ms 45404 KB Output is correct
73 Correct 814 ms 62816 KB Output is correct
74 Incorrect 919 ms 69376 KB Output isn't correct
75 Halted 0 ms 0 KB -