oj.uz

답안 #709643

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
709643 2023-03-14T05:32:58 Z alvingogo Two Dishes (JOI19_dishes) C++14
74 / 100
 6232 ms 318824 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+1);
	vector<pair<int,int> > to;
	vector<int> vis(n+1);
	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});
	}
	int y=0;
	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]>=n){
			y+=q[i];
		}
		else{
			to.push_back({i-1,okb[i]+1});
		}
	}
	/*
	for(int i=1;i<=n;i++){
		cout << oka[i] << " ";
	}
	cout << "\n";
	for(int j=1;j<=m;j++){
		cout << okb[j] << " ";
	}
	cout << "\n";
	*/
	sort(to.begin(),to.end());
	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:gg){
		//cout << h.fs << " " << h.sc << endl;
	}
	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++){
		if(newp[i]){
			//cout << i << "f" << newp[i] << "\n";
			st.update(0,0,n,0,i-1,newp[i]);
			bt.update(i,newp[i]);
		}
	}
	for(auto h:to){
		//cout << h.fs << " " << h.sc << "\n";
	}
	
	//cout << "\n";
	int l=0;
	while(l<(int)to.size() && to[l].fs<0){
		l++;
	}
	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();
			//cout << okb[i] << "\n";
		}
	}
	for(int i=0;i<=m;i++){
		if(i>0 && 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);
			//cout << x << " " << dp[x] << endl;
			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 << st.query(0,0,n,0,n) << "\n";
    return 0;
}

Compilation message

dishes.cpp: In function 'int main()':
dishes.cpp:140:11: warning: variable 'h' set but not used [-Wunused-but-set-variable]
  140 |  for(auto h:gg){
      |           ^
dishes.cpp:168:11: warning: variable 'h' set but not used [-Wunused-but-set-variable]
  168 |  for(auto h:to){
      |           ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 461 ms 48872 KB Output is correct
2 Correct 426 ms 47488 KB Output is correct
3 Correct 316 ms 39412 KB Output is correct
4 Correct 370 ms 41636 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 409 ms 45516 KB Output is correct
7 Correct 90 ms 9080 KB Output is correct
8 Correct 265 ms 33212 KB Output is correct
9 Correct 327 ms 39404 KB Output is correct
10 Correct 341 ms 42616 KB Output is correct
11 Correct 291 ms 39480 KB Output is correct

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 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 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 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

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 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 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 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 4 ms 852 KB Output is correct
18 Correct 4 ms 856 KB Output is correct
19 Correct 5 ms 852 KB Output is correct
20 Correct 4 ms 724 KB Output is correct
21 Correct 5 ms 852 KB Output is correct
22 Correct 7 ms 980 KB Output is correct
23 Correct 6 ms 944 KB Output is correct

Subtask #4
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 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 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 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 4 ms 852 KB Output is correct
18 Correct 4 ms 856 KB Output is correct
19 Correct 5 ms 852 KB Output is correct
20 Correct 4 ms 724 KB Output is correct
21 Correct 5 ms 852 KB Output is correct
22 Correct 7 ms 980 KB Output is correct
23 Correct 6 ms 944 KB Output is correct
24 Correct 454 ms 52060 KB Output is correct
25 Correct 399 ms 51992 KB Output is correct
26 Correct 431 ms 52016 KB Output is correct
27 Correct 469 ms 51928 KB Output is correct
28 Correct 450 ms 45764 KB Output is correct
29 Correct 320 ms 39356 KB Output is correct
30 Correct 950 ms 63576 KB Output is correct
31 Correct 157 ms 19116 KB Output is correct
32 Correct 275 ms 33212 KB Output is correct
33 Correct 596 ms 51152 KB Output is correct
34 Correct 838 ms 59160 KB Output is correct
35 Correct 899 ms 64048 KB Output is correct
36 Correct 848 ms 63112 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 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 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 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 4 ms 852 KB Output is correct
18 Correct 4 ms 856 KB Output is correct
19 Correct 5 ms 852 KB Output is correct
20 Correct 4 ms 724 KB Output is correct
21 Correct 5 ms 852 KB Output is correct
22 Correct 7 ms 980 KB Output is correct
23 Correct 6 ms 944 KB Output is correct
24 Correct 454 ms 52060 KB Output is correct
25 Correct 399 ms 51992 KB Output is correct
26 Correct 431 ms 52016 KB Output is correct
27 Correct 469 ms 51928 KB Output is correct
28 Correct 450 ms 45764 KB Output is correct
29 Correct 320 ms 39356 KB Output is correct
30 Correct 950 ms 63576 KB Output is correct
31 Correct 157 ms 19116 KB Output is correct
32 Correct 275 ms 33212 KB Output is correct
33 Correct 596 ms 51152 KB Output is correct
34 Correct 838 ms 59160 KB Output is correct
35 Correct 899 ms 64048 KB Output is correct
36 Correct 848 ms 63112 KB Output is correct
37 Correct 423 ms 52012 KB Output is correct
38 Correct 447 ms 52208 KB Output is correct
39 Correct 407 ms 42544 KB Output is correct
40 Correct 384 ms 42572 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 943 ms 63564 KB Output is correct
43 Correct 591 ms 50952 KB Output is correct
44 Correct 874 ms 58916 KB Output is correct
45 Correct 877 ms 64028 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 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 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 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 4 ms 852 KB Output is correct
18 Correct 4 ms 856 KB Output is correct
19 Correct 5 ms 852 KB Output is correct
20 Correct 4 ms 724 KB Output is correct
21 Correct 5 ms 852 KB Output is correct
22 Correct 7 ms 980 KB Output is correct
23 Correct 6 ms 944 KB Output is correct
24 Correct 454 ms 52060 KB Output is correct
25 Correct 399 ms 51992 KB Output is correct
26 Correct 431 ms 52016 KB Output is correct
27 Correct 469 ms 51928 KB Output is correct
28 Correct 450 ms 45764 KB Output is correct
29 Correct 320 ms 39356 KB Output is correct
30 Correct 950 ms 63576 KB Output is correct
31 Correct 157 ms 19116 KB Output is correct
32 Correct 275 ms 33212 KB Output is correct
33 Correct 596 ms 51152 KB Output is correct
34 Correct 838 ms 59160 KB Output is correct
35 Correct 899 ms 64048 KB Output is correct
36 Correct 848 ms 63112 KB Output is correct
37 Correct 423 ms 52012 KB Output is correct
38 Correct 447 ms 52208 KB Output is correct
39 Correct 407 ms 42544 KB Output is correct
40 Correct 384 ms 42572 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 943 ms 63564 KB Output is correct
43 Correct 591 ms 50952 KB Output is correct
44 Correct 874 ms 58916 KB Output is correct
45 Correct 877 ms 64028 KB Output is correct
46 Correct 2323 ms 258548 KB Output is correct
47 Correct 2518 ms 258804 KB Output is correct
48 Correct 2036 ms 211700 KB Output is correct
49 Correct 2106 ms 211712 KB Output is correct
50 Correct 6232 ms 318824 KB Output is correct
51 Correct 3417 ms 247512 KB Output is correct
52 Correct 4641 ms 284480 KB Output is correct
53 Correct 5594 ms 314148 KB Output is correct

Subtask #7
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 461 ms 48872 KB Output is correct
2 Correct 426 ms 47488 KB Output is correct
3 Correct 316 ms 39412 KB Output is correct
4 Correct 370 ms 41636 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 409 ms 45516 KB Output is correct
7 Correct 90 ms 9080 KB Output is correct
8 Correct 265 ms 33212 KB Output is correct
9 Correct 327 ms 39404 KB Output is correct
10 Correct 341 ms 42616 KB Output is correct
11 Correct 291 ms 39480 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 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 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 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 852 KB Output is correct
29 Correct 4 ms 856 KB Output is correct
30 Correct 5 ms 852 KB Output is correct
31 Correct 4 ms 724 KB Output is correct
32 Correct 5 ms 852 KB Output is correct
33 Correct 7 ms 980 KB Output is correct
34 Correct 6 ms 944 KB Output is correct
35 Correct 454 ms 52060 KB Output is correct
36 Correct 399 ms 51992 KB Output is correct
37 Correct 431 ms 52016 KB Output is correct
38 Correct 469 ms 51928 KB Output is correct
39 Correct 450 ms 45764 KB Output is correct
40 Correct 320 ms 39356 KB Output is correct
41 Correct 950 ms 63576 KB Output is correct
42 Correct 157 ms 19116 KB Output is correct
43 Correct 275 ms 33212 KB Output is correct
44 Correct 596 ms 51152 KB Output is correct
45 Correct 838 ms 59160 KB Output is correct
46 Correct 899 ms 64048 KB Output is correct
47 Correct 848 ms 63112 KB Output is correct
48 Correct 423 ms 52012 KB Output is correct
49 Correct 447 ms 52208 KB Output is correct
50 Correct 407 ms 42544 KB Output is correct
51 Correct 384 ms 42572 KB Output is correct
52 Correct 0 ms 212 KB Output is correct
53 Correct 943 ms 63564 KB Output is correct
54 Correct 591 ms 50952 KB Output is correct
55 Correct 874 ms 58916 KB Output is correct
56 Correct 877 ms 64028 KB Output is correct
57 Correct 456 ms 51944 KB Output is correct
58 Correct 443 ms 52580 KB Output is correct
59 Correct 416 ms 42904 KB Output is correct
60 Correct 393 ms 42816 KB Output is correct
61 Correct 913 ms 64744 KB Output is correct
62 Correct 1 ms 212 KB Output is correct
63 Incorrect 962 ms 63792 KB Output isn't correct
64 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 461 ms 48872 KB Output is correct
2 Correct 426 ms 47488 KB Output is correct
3 Correct 316 ms 39412 KB Output is correct
4 Correct 370 ms 41636 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 409 ms 45516 KB Output is correct
7 Correct 90 ms 9080 KB Output is correct
8 Correct 265 ms 33212 KB Output is correct
9 Correct 327 ms 39404 KB Output is correct
10 Correct 341 ms 42616 KB Output is correct
11 Correct 291 ms 39480 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 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 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 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 852 KB Output is correct
29 Correct 4 ms 856 KB Output is correct
30 Correct 5 ms 852 KB Output is correct
31 Correct 4 ms 724 KB Output is correct
32 Correct 5 ms 852 KB Output is correct
33 Correct 7 ms 980 KB Output is correct
34 Correct 6 ms 944 KB Output is correct
35 Correct 454 ms 52060 KB Output is correct
36 Correct 399 ms 51992 KB Output is correct
37 Correct 431 ms 52016 KB Output is correct
38 Correct 469 ms 51928 KB Output is correct
39 Correct 450 ms 45764 KB Output is correct
40 Correct 320 ms 39356 KB Output is correct
41 Correct 950 ms 63576 KB Output is correct
42 Correct 157 ms 19116 KB Output is correct
43 Correct 275 ms 33212 KB Output is correct
44 Correct 596 ms 51152 KB Output is correct
45 Correct 838 ms 59160 KB Output is correct
46 Correct 899 ms 64048 KB Output is correct
47 Correct 848 ms 63112 KB Output is correct
48 Correct 423 ms 52012 KB Output is correct
49 Correct 447 ms 52208 KB Output is correct
50 Correct 407 ms 42544 KB Output is correct
51 Correct 384 ms 42572 KB Output is correct
52 Correct 0 ms 212 KB Output is correct
53 Correct 943 ms 63564 KB Output is correct
54 Correct 591 ms 50952 KB Output is correct
55 Correct 874 ms 58916 KB Output is correct
56 Correct 877 ms 64028 KB Output is correct
57 Correct 2323 ms 258548 KB Output is correct
58 Correct 2518 ms 258804 KB Output is correct
59 Correct 2036 ms 211700 KB Output is correct
60 Correct 2106 ms 211712 KB Output is correct
61 Correct 6232 ms 318824 KB Output is correct
62 Correct 3417 ms 247512 KB Output is correct
63 Correct 4641 ms 284480 KB Output is correct
64 Correct 5594 ms 314148 KB Output is correct
65 Correct 456 ms 51944 KB Output is correct
66 Correct 443 ms 52580 KB Output is correct
67 Correct 416 ms 42904 KB Output is correct
68 Correct 393 ms 42816 KB Output is correct
69 Correct 913 ms 64744 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Incorrect 962 ms 63792 KB Output isn't correct
72 Halted 0 ms 0 KB -