oj.uz

Submission #709821

# Submission time Handle Problem Language Result Execution time Memory
709821 2023-03-14T14:34:03 Z alvingogo Two Dishes (JOI19_dishes) C++14
74 / 100
 6782 ms 375184 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-10.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+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){
			p[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<b;
	});
	to.erase(unique(to.begin(),to.end()),to.end());
	gg=to;
	sort(gg.begin(),gg.end(),cmp);
	int sz=gg.size();
	vector<int> newp(sz+1);
	st.init(sz+1);
	bt.init(sz);
	bt2.init(sz);
	st.update(0,0,sz,1,sz,-inf);
	for(int i=1;i<=n;i++){
		if(oka[i]>=0){
			int u=lower_bound(gg.begin(),gg.end(),pair<int,int>(-inf,i),cmp)-gg.begin()+1;
			st.update(0,0,sz,0,u-1,p[i]);
			bt.update(u,p[i]);
		}
	}
	for(auto &h:to){
		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];
		}
	}
	int l=0;
	vector<int> dp(sz+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;i++){
		if(i>0 && okb[i]>=0){
			st.update(0,0,sz,0,okb[i],q[i]);
			bt2.update(okb[i],q[i]);
		}
		int lst=0;
		while(l<(int)to.size() && to[l].fs==i){
			int x=to[l].sc;
			dp[x]=st.query(0,0,sz,lst,x-1)-bt.query(x+1);
			//cout << x << " " << dp[x] << "\n";
			st.update(0,0,sz,x,x,dp[x]+inf-bt2.query(x));
			st.update(0,0,sz,0,x-1,-newp[x]);
			bt.update(x,-newp[x]);
			l++;
			lst=x;
		}
	}
	cout << dp[sz] << "\n";
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 516 ms 59968 KB Output is correct
2 Correct 499 ms 61252 KB Output is correct
3 Correct 362 ms 52924 KB Output is correct
4 Correct 364 ms 45564 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 478 ms 58928 KB Output is correct
7 Correct 107 ms 13324 KB Output is correct
8 Correct 256 ms 40168 KB Output is correct
9 Correct 367 ms 53856 KB Output is correct
10 Correct 466 ms 49988 KB Output is correct
11 Correct 346 ms 47184 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 320 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 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 320 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 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 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 3 ms 724 KB Output is correct
18 Correct 5 ms 852 KB Output is correct
19 Correct 6 ms 980 KB Output is correct
20 Correct 4 ms 724 KB Output is correct
21 Correct 6 ms 980 KB Output is correct
22 Correct 5 ms 972 KB Output is correct
23 Correct 6 ms 980 KB Output is correct

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 320 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 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 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 3 ms 724 KB Output is correct
18 Correct 5 ms 852 KB Output is correct
19 Correct 6 ms 980 KB Output is correct
20 Correct 4 ms 724 KB Output is correct
21 Correct 6 ms 980 KB Output is correct
22 Correct 5 ms 972 KB Output is correct
23 Correct 6 ms 980 KB Output is correct
24 Correct 365 ms 50036 KB Output is correct
25 Correct 425 ms 62452 KB Output is correct
26 Correct 338 ms 50256 KB Output is correct
27 Correct 506 ms 62676 KB Output is correct
28 Correct 506 ms 53420 KB Output is correct
29 Correct 381 ms 50768 KB Output is correct
30 Correct 976 ms 73756 KB Output is correct
31 Correct 163 ms 24352 KB Output is correct
32 Correct 262 ms 38392 KB Output is correct
33 Correct 550 ms 48996 KB Output is correct
34 Correct 819 ms 69748 KB Output is correct
35 Correct 942 ms 68164 KB Output is correct
36 Correct 888 ms 66824 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 320 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 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 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 3 ms 724 KB Output is correct
18 Correct 5 ms 852 KB Output is correct
19 Correct 6 ms 980 KB Output is correct
20 Correct 4 ms 724 KB Output is correct
21 Correct 6 ms 980 KB Output is correct
22 Correct 5 ms 972 KB Output is correct
23 Correct 6 ms 980 KB Output is correct
24 Correct 365 ms 50036 KB Output is correct
25 Correct 425 ms 62452 KB Output is correct
26 Correct 338 ms 50256 KB Output is correct
27 Correct 506 ms 62676 KB Output is correct
28 Correct 506 ms 53420 KB Output is correct
29 Correct 381 ms 50768 KB Output is correct
30 Correct 976 ms 73756 KB Output is correct
31 Correct 163 ms 24352 KB Output is correct
32 Correct 262 ms 38392 KB Output is correct
33 Correct 550 ms 48996 KB Output is correct
34 Correct 819 ms 69748 KB Output is correct
35 Correct 942 ms 68164 KB Output is correct
36 Correct 888 ms 66824 KB Output is correct
37 Correct 472 ms 53108 KB Output is correct
38 Correct 522 ms 65676 KB Output is correct
39 Correct 483 ms 53576 KB Output is correct
40 Correct 488 ms 53576 KB Output is correct
41 Correct 1 ms 320 KB Output is correct
42 Correct 995 ms 76860 KB Output is correct
43 Correct 549 ms 51868 KB Output is correct
44 Correct 831 ms 72344 KB Output is correct
45 Correct 981 ms 71008 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 320 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 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 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 3 ms 724 KB Output is correct
18 Correct 5 ms 852 KB Output is correct
19 Correct 6 ms 980 KB Output is correct
20 Correct 4 ms 724 KB Output is correct
21 Correct 6 ms 980 KB Output is correct
22 Correct 5 ms 972 KB Output is correct
23 Correct 6 ms 980 KB Output is correct
24 Correct 365 ms 50036 KB Output is correct
25 Correct 425 ms 62452 KB Output is correct
26 Correct 338 ms 50256 KB Output is correct
27 Correct 506 ms 62676 KB Output is correct
28 Correct 506 ms 53420 KB Output is correct
29 Correct 381 ms 50768 KB Output is correct
30 Correct 976 ms 73756 KB Output is correct
31 Correct 163 ms 24352 KB Output is correct
32 Correct 262 ms 38392 KB Output is correct
33 Correct 550 ms 48996 KB Output is correct
34 Correct 819 ms 69748 KB Output is correct
35 Correct 942 ms 68164 KB Output is correct
36 Correct 888 ms 66824 KB Output is correct
37 Correct 472 ms 53108 KB Output is correct
38 Correct 522 ms 65676 KB Output is correct
39 Correct 483 ms 53576 KB Output is correct
40 Correct 488 ms 53576 KB Output is correct
41 Correct 1 ms 320 KB Output is correct
42 Correct 995 ms 76860 KB Output is correct
43 Correct 549 ms 51868 KB Output is correct
44 Correct 831 ms 72344 KB Output is correct
45 Correct 981 ms 71008 KB Output is correct
46 Correct 2444 ms 242280 KB Output is correct
47 Correct 2761 ms 296528 KB Output is correct
48 Correct 2513 ms 267912 KB Output is correct
49 Correct 2607 ms 267968 KB Output is correct
50 Correct 6782 ms 375184 KB Output is correct
51 Correct 3245 ms 252136 KB Output is correct
52 Correct 5286 ms 341888 KB Output is correct
53 Correct 6107 ms 348808 KB Output is correct

Subtask #7
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 516 ms 59968 KB Output is correct
2 Correct 499 ms 61252 KB Output is correct
3 Correct 362 ms 52924 KB Output is correct
4 Correct 364 ms 45564 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 478 ms 58928 KB Output is correct
7 Correct 107 ms 13324 KB Output is correct
8 Correct 256 ms 40168 KB Output is correct
9 Correct 367 ms 53856 KB Output is correct
10 Correct 466 ms 49988 KB Output is correct
11 Correct 346 ms 47184 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 320 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 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 340 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 3 ms 724 KB Output is correct
29 Correct 5 ms 852 KB Output is correct
30 Correct 6 ms 980 KB Output is correct
31 Correct 4 ms 724 KB Output is correct
32 Correct 6 ms 980 KB Output is correct
33 Correct 5 ms 972 KB Output is correct
34 Correct 6 ms 980 KB Output is correct
35 Correct 365 ms 50036 KB Output is correct
36 Correct 425 ms 62452 KB Output is correct
37 Correct 338 ms 50256 KB Output is correct
38 Correct 506 ms 62676 KB Output is correct
39 Correct 506 ms 53420 KB Output is correct
40 Correct 381 ms 50768 KB Output is correct
41 Correct 976 ms 73756 KB Output is correct
42 Correct 163 ms 24352 KB Output is correct
43 Correct 262 ms 38392 KB Output is correct
44 Correct 550 ms 48996 KB Output is correct
45 Correct 819 ms 69748 KB Output is correct
46 Correct 942 ms 68164 KB Output is correct
47 Correct 888 ms 66824 KB Output is correct
48 Correct 472 ms 53108 KB Output is correct
49 Correct 522 ms 65676 KB Output is correct
50 Correct 483 ms 53576 KB Output is correct
51 Correct 488 ms 53576 KB Output is correct
52 Correct 1 ms 320 KB Output is correct
53 Correct 995 ms 76860 KB Output is correct
54 Correct 549 ms 51868 KB Output is correct
55 Correct 831 ms 72344 KB Output is correct
56 Correct 981 ms 71008 KB Output is correct
57 Correct 386 ms 53580 KB Output is correct
58 Correct 523 ms 66204 KB Output is correct
59 Correct 487 ms 54620 KB Output is correct
60 Correct 465 ms 54556 KB Output is correct
61 Correct 1041 ms 75344 KB Output is correct
62 Correct 1 ms 212 KB Output is correct
63 Correct 988 ms 77028 KB Output is correct
64 Correct 540 ms 52248 KB Output is correct
65 Correct 847 ms 69992 KB Output is correct
66 Incorrect 918 ms 69920 KB Output isn't correct
67 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 516 ms 59968 KB Output is correct
2 Correct 499 ms 61252 KB Output is correct
3 Correct 362 ms 52924 KB Output is correct
4 Correct 364 ms 45564 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 478 ms 58928 KB Output is correct
7 Correct 107 ms 13324 KB Output is correct
8 Correct 256 ms 40168 KB Output is correct
9 Correct 367 ms 53856 KB Output is correct
10 Correct 466 ms 49988 KB Output is correct
11 Correct 346 ms 47184 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 320 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 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 340 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 3 ms 724 KB Output is correct
29 Correct 5 ms 852 KB Output is correct
30 Correct 6 ms 980 KB Output is correct
31 Correct 4 ms 724 KB Output is correct
32 Correct 6 ms 980 KB Output is correct
33 Correct 5 ms 972 KB Output is correct
34 Correct 6 ms 980 KB Output is correct
35 Correct 365 ms 50036 KB Output is correct
36 Correct 425 ms 62452 KB Output is correct
37 Correct 338 ms 50256 KB Output is correct
38 Correct 506 ms 62676 KB Output is correct
39 Correct 506 ms 53420 KB Output is correct
40 Correct 381 ms 50768 KB Output is correct
41 Correct 976 ms 73756 KB Output is correct
42 Correct 163 ms 24352 KB Output is correct
43 Correct 262 ms 38392 KB Output is correct
44 Correct 550 ms 48996 KB Output is correct
45 Correct 819 ms 69748 KB Output is correct
46 Correct 942 ms 68164 KB Output is correct
47 Correct 888 ms 66824 KB Output is correct
48 Correct 472 ms 53108 KB Output is correct
49 Correct 522 ms 65676 KB Output is correct
50 Correct 483 ms 53576 KB Output is correct
51 Correct 488 ms 53576 KB Output is correct
52 Correct 1 ms 320 KB Output is correct
53 Correct 995 ms 76860 KB Output is correct
54 Correct 549 ms 51868 KB Output is correct
55 Correct 831 ms 72344 KB Output is correct
56 Correct 981 ms 71008 KB Output is correct
57 Correct 2444 ms 242280 KB Output is correct
58 Correct 2761 ms 296528 KB Output is correct
59 Correct 2513 ms 267912 KB Output is correct
60 Correct 2607 ms 267968 KB Output is correct
61 Correct 6782 ms 375184 KB Output is correct
62 Correct 3245 ms 252136 KB Output is correct
63 Correct 5286 ms 341888 KB Output is correct
64 Correct 6107 ms 348808 KB Output is correct
65 Correct 386 ms 53580 KB Output is correct
66 Correct 523 ms 66204 KB Output is correct
67 Correct 487 ms 54620 KB Output is correct
68 Correct 465 ms 54556 KB Output is correct
69 Correct 1041 ms 75344 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 988 ms 77028 KB Output is correct
72 Correct 540 ms 52248 KB Output is correct
73 Correct 847 ms 69992 KB Output is correct
74 Incorrect 918 ms 69920 KB Output isn't correct
75 Halted 0 ms 0 KB -