oj.uz

Submission #709672

# Submission time Handle Problem Language Result Execution time Memory
709672 2023-03-14T07:08:51 Z alvingogo Two Dishes (JOI19_dishes) C++14
74 / 100
 5974 ms 321528 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;
	//freopen("07-03.txt","r",stdin);
	//freopen("ans.txt","w",stdout);
	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});
	}
	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){
		}
		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++){
		///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;
	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:166:11: warning: variable 'h' set but not used [-Wunused-but-set-variable]
  166 |  for(auto h:to){
      |           ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 477 ms 48896 KB Output is correct
2 Correct 465 ms 50868 KB Output is correct
3 Correct 475 ms 64548 KB Output is correct
4 Correct 392 ms 41612 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 474 ms 51396 KB Output is correct
7 Correct 271 ms 31636 KB Output is correct
8 Correct 238 ms 33284 KB Output is correct
9 Correct 483 ms 64612 KB Output is correct
10 Correct 346 ms 42552 KB Output is correct
11 Correct 437 ms 64532 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 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 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 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 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 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 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 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 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 4 ms 980 KB Output is correct
18 Correct 4 ms 852 KB Output is correct
19 Correct 6 ms 972 KB Output is correct
20 Correct 5 ms 724 KB Output is correct
21 Correct 7 ms 852 KB Output is correct
22 Correct 5 ms 972 KB Output is correct
23 Correct 6 ms 852 KB Output is correct

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 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 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 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 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 4 ms 980 KB Output is correct
18 Correct 4 ms 852 KB Output is correct
19 Correct 6 ms 972 KB Output is correct
20 Correct 5 ms 724 KB Output is correct
21 Correct 7 ms 852 KB Output is correct
22 Correct 5 ms 972 KB Output is correct
23 Correct 6 ms 852 KB Output is correct
24 Correct 500 ms 64532 KB Output is correct
25 Correct 413 ms 52020 KB Output is correct
26 Correct 542 ms 64528 KB Output is correct
27 Correct 450 ms 52024 KB Output is correct
28 Correct 606 ms 61396 KB Output is correct
29 Correct 455 ms 64616 KB Output is correct
30 Correct 917 ms 64096 KB Output is correct
31 Correct 290 ms 31648 KB Output is correct
32 Correct 249 ms 33172 KB Output is correct
33 Correct 599 ms 51564 KB Output is correct
34 Correct 794 ms 63092 KB Output is correct
35 Correct 922 ms 64304 KB Output is correct
36 Correct 880 ms 63800 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 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 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 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 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 4 ms 980 KB Output is correct
18 Correct 4 ms 852 KB Output is correct
19 Correct 6 ms 972 KB Output is correct
20 Correct 5 ms 724 KB Output is correct
21 Correct 7 ms 852 KB Output is correct
22 Correct 5 ms 972 KB Output is correct
23 Correct 6 ms 852 KB Output is correct
24 Correct 500 ms 64532 KB Output is correct
25 Correct 413 ms 52020 KB Output is correct
26 Correct 542 ms 64528 KB Output is correct
27 Correct 450 ms 52024 KB Output is correct
28 Correct 606 ms 61396 KB Output is correct
29 Correct 455 ms 64616 KB Output is correct
30 Correct 917 ms 64096 KB Output is correct
31 Correct 290 ms 31648 KB Output is correct
32 Correct 249 ms 33172 KB Output is correct
33 Correct 599 ms 51564 KB Output is correct
34 Correct 794 ms 63092 KB Output is correct
35 Correct 922 ms 64304 KB Output is correct
36 Correct 880 ms 63800 KB Output is correct
37 Correct 569 ms 64608 KB Output is correct
38 Correct 465 ms 51936 KB Output is correct
39 Correct 373 ms 42608 KB Output is correct
40 Correct 372 ms 42580 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 926 ms 64144 KB Output is correct
43 Correct 620 ms 51408 KB Output is correct
44 Correct 811 ms 62924 KB Output is correct
45 Correct 917 ms 64488 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 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 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 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 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 4 ms 980 KB Output is correct
18 Correct 4 ms 852 KB Output is correct
19 Correct 6 ms 972 KB Output is correct
20 Correct 5 ms 724 KB Output is correct
21 Correct 7 ms 852 KB Output is correct
22 Correct 5 ms 972 KB Output is correct
23 Correct 6 ms 852 KB Output is correct
24 Correct 500 ms 64532 KB Output is correct
25 Correct 413 ms 52020 KB Output is correct
26 Correct 542 ms 64528 KB Output is correct
27 Correct 450 ms 52024 KB Output is correct
28 Correct 606 ms 61396 KB Output is correct
29 Correct 455 ms 64616 KB Output is correct
30 Correct 917 ms 64096 KB Output is correct
31 Correct 290 ms 31648 KB Output is correct
32 Correct 249 ms 33172 KB Output is correct
33 Correct 599 ms 51564 KB Output is correct
34 Correct 794 ms 63092 KB Output is correct
35 Correct 922 ms 64304 KB Output is correct
36 Correct 880 ms 63800 KB Output is correct
37 Correct 569 ms 64608 KB Output is correct
38 Correct 465 ms 51936 KB Output is correct
39 Correct 373 ms 42608 KB Output is correct
40 Correct 372 ms 42580 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 926 ms 64144 KB Output is correct
43 Correct 620 ms 51408 KB Output is correct
44 Correct 811 ms 62924 KB Output is correct
45 Correct 917 ms 64488 KB Output is correct
46 Correct 3101 ms 321528 KB Output is correct
47 Correct 2499 ms 258676 KB Output is correct
48 Correct 1974 ms 211704 KB Output is correct
49 Correct 1958 ms 211884 KB Output is correct
50 Correct 5974 ms 320044 KB Output is correct
51 Correct 3527 ms 252208 KB Output is correct
52 Correct 4665 ms 303016 KB Output is correct
53 Correct 5628 ms 317776 KB Output is correct

Subtask #7
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 477 ms 48896 KB Output is correct
2 Correct 465 ms 50868 KB Output is correct
3 Correct 475 ms 64548 KB Output is correct
4 Correct 392 ms 41612 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 474 ms 51396 KB Output is correct
7 Correct 271 ms 31636 KB Output is correct
8 Correct 238 ms 33284 KB Output is correct
9 Correct 483 ms 64612 KB Output is correct
10 Correct 346 ms 42552 KB Output is correct
11 Correct 437 ms 64532 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 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 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 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 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 4 ms 980 KB Output is correct
29 Correct 4 ms 852 KB Output is correct
30 Correct 6 ms 972 KB Output is correct
31 Correct 5 ms 724 KB Output is correct
32 Correct 7 ms 852 KB Output is correct
33 Correct 5 ms 972 KB Output is correct
34 Correct 6 ms 852 KB Output is correct
35 Correct 500 ms 64532 KB Output is correct
36 Correct 413 ms 52020 KB Output is correct
37 Correct 542 ms 64528 KB Output is correct
38 Correct 450 ms 52024 KB Output is correct
39 Correct 606 ms 61396 KB Output is correct
40 Correct 455 ms 64616 KB Output is correct
41 Correct 917 ms 64096 KB Output is correct
42 Correct 290 ms 31648 KB Output is correct
43 Correct 249 ms 33172 KB Output is correct
44 Correct 599 ms 51564 KB Output is correct
45 Correct 794 ms 63092 KB Output is correct
46 Correct 922 ms 64304 KB Output is correct
47 Correct 880 ms 63800 KB Output is correct
48 Correct 569 ms 64608 KB Output is correct
49 Correct 465 ms 51936 KB Output is correct
50 Correct 373 ms 42608 KB Output is correct
51 Correct 372 ms 42580 KB Output is correct
52 Correct 0 ms 212 KB Output is correct
53 Correct 926 ms 64144 KB Output is correct
54 Correct 620 ms 51408 KB Output is correct
55 Correct 811 ms 62924 KB Output is correct
56 Correct 917 ms 64488 KB Output is correct
57 Incorrect 567 ms 64432 KB Output isn't correct
58 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 477 ms 48896 KB Output is correct
2 Correct 465 ms 50868 KB Output is correct
3 Correct 475 ms 64548 KB Output is correct
4 Correct 392 ms 41612 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 474 ms 51396 KB Output is correct
7 Correct 271 ms 31636 KB Output is correct
8 Correct 238 ms 33284 KB Output is correct
9 Correct 483 ms 64612 KB Output is correct
10 Correct 346 ms 42552 KB Output is correct
11 Correct 437 ms 64532 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 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 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 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 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 4 ms 980 KB Output is correct
29 Correct 4 ms 852 KB Output is correct
30 Correct 6 ms 972 KB Output is correct
31 Correct 5 ms 724 KB Output is correct
32 Correct 7 ms 852 KB Output is correct
33 Correct 5 ms 972 KB Output is correct
34 Correct 6 ms 852 KB Output is correct
35 Correct 500 ms 64532 KB Output is correct
36 Correct 413 ms 52020 KB Output is correct
37 Correct 542 ms 64528 KB Output is correct
38 Correct 450 ms 52024 KB Output is correct
39 Correct 606 ms 61396 KB Output is correct
40 Correct 455 ms 64616 KB Output is correct
41 Correct 917 ms 64096 KB Output is correct
42 Correct 290 ms 31648 KB Output is correct
43 Correct 249 ms 33172 KB Output is correct
44 Correct 599 ms 51564 KB Output is correct
45 Correct 794 ms 63092 KB Output is correct
46 Correct 922 ms 64304 KB Output is correct
47 Correct 880 ms 63800 KB Output is correct
48 Correct 569 ms 64608 KB Output is correct
49 Correct 465 ms 51936 KB Output is correct
50 Correct 373 ms 42608 KB Output is correct
51 Correct 372 ms 42580 KB Output is correct
52 Correct 0 ms 212 KB Output is correct
53 Correct 926 ms 64144 KB Output is correct
54 Correct 620 ms 51408 KB Output is correct
55 Correct 811 ms 62924 KB Output is correct
56 Correct 917 ms 64488 KB Output is correct
57 Correct 3101 ms 321528 KB Output is correct
58 Correct 2499 ms 258676 KB Output is correct
59 Correct 1974 ms 211704 KB Output is correct
60 Correct 1958 ms 211884 KB Output is correct
61 Correct 5974 ms 320044 KB Output is correct
62 Correct 3527 ms 252208 KB Output is correct
63 Correct 4665 ms 303016 KB Output is correct
64 Correct 5628 ms 317776 KB Output is correct
65 Incorrect 567 ms 64432 KB Output isn't correct
66 Halted 0 ms 0 KB -