oj.uz

Submission #246518

# Submission time Handle Problem Language Result Execution time Memory
246518 2020-07-09T13:50:29 Z red1108 Two Dishes (JOI19_dishes) C++17
8 / 100
 436 ms 66848 KB 
#include<bits/stdc++.h>
#include<ext/rope>
using namespace std;
using namespace __gnu_cxx;
#define fi first
#define se second
#define fastio ios_base::sync_with_stdio(false);cin.tie(0)
#define fopen freopen("input.txt", "r", stdin)
#define eb emplace_back
#define em emplace
#define prec(a) cout<<fixed;cout.precision(a);
#define all(a) (a).begin(), (a).end()
typedef long long ll;typedef long double ld;typedef unsigned long long ul;typedef unsigned int ui;typedef pair<int,int> pii;typedef pair<ll,ll> pll;
typedef tuple<int,int,int> tiii;
const ll INF = 2e18;
const int inf = 2e9;
template<class T>
void pr(T t) {cerr << t << " ";}
template<class T, class ...Args>
void pr(T a, Args ...args) {cerr << a << " ";pr(args...);}
template<class ...Args>
void prl(Args ...args) {pr(args...);cerr << endl;}


int n, m;
struct In{
	ll ti, lim, cost;
}A[1000100], B[1000100];
ll ans;
vector<pll> ad[1000100];
ll asum[1000100],bsum[1000100];
ll seg[3000100],blazy[3000100]; // 구간 max, +lazy, fix
int alazy[3000100];

void prop(int x, int l, int r){
	if(alazy[x]==1&&blazy[x]==0) return ;
	if(l!=r){
		alazy[x*2]*=alazy[x];
		blazy[x*2] = blazy[x*2]*alazy[x]+blazy[x];
		alazy[x*2+1]*=alazy[x];
		blazy[x*2+1] = blazy[x*2+1]*alazy[x]+blazy[x];
	}
	seg[x] = seg[x]*alazy[x] + blazy[x];
	alazy[x]=1;blazy[x]=0;
	return ;
}
void gang(int x, int l, int r,int s, int e, int a, ll b){
	prop(x,l,r);
	if(r<s||e<l) return ;
	if(s<=l&&r<=e){
		alazy[x]*=a;
		blazy[x] = blazy[x]*a+b;
		prop(x,l,r);
		return ;
	}
	gang(x*2, l, (l+r)/2, s, e, a,b);gang(x*2+1, (l+r)/2+1, r,s,e,a,b);
	seg[x] = max(seg[x*2], seg[x*2+1]);
}
ll get_val(int x, int l, int r, int i){
	prop(x,l,r);
	if(l==r) return seg[x];
	int  m = (l+r)/2;
	if(i<=m) return get_val(x*2, l, m,i);
	else return get_val(x*2+1, m+1, r, i);
}
int get_left(int x, int l, int r, ll v){
	prop(x,l,r);
	if(l==r) return l;
	if(seg[x*2]>=v) return get_left(x*2, l,(l+r)/2, v);
	return get_left(x*2+1, (l+r)/2+1, r, v);
}
int main(){
	fastio;
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		cin>>A[i].ti>>A[i].lim>>A[i].cost;
		asum[i]=asum[i-1]+A[i].ti;
	}
	for(int i=1;i<=m;i++){
		cin>>B[i].ti>>B[i].lim>>B[i].cost;
		bsum[i]=bsum[i-1]+B[i].ti;
	}
	for(int i=1;i<=n;i++){
		if(asum[i]>A[i].lim) continue;
		int j = upper_bound(bsum,bsum+m+1, A[i].lim-asum[i])-bsum-1;
		ans+=A[i].cost;
		ad[i-1].eb(j+1, -A[i].cost);
	}
	for(int i=1;i<=m;i++){
		if(bsum[i]>B[i].lim) continue;
		int j = upper_bound(asum,asum+n+1, B[i].lim-bsum[i])-asum-1;
		ad[j].eb(i,B[i].cost);
	}
	for(int i=1;i<=3000000;i++){
		alazy[i]=1;
	}
	for(int i=0;i<=n;i++){
		sort(all(ad[i]), [](pll &a,pll &b){
			return a.se>b.se;});
		for(auto j:ad[i]){
			if(j.se>=0){
				gang(1,0,m,j.fi,m,1,j.se);
				continue;
			}
			else{
				ll t = get_val(1,0,m,j.fi-1);
				int ind = get_left(1,0,m,t-j.se);
				if(ind==m&&seg[1]<t-j.se){
					gang(1,0,m,j.fi,m,0,t);
					continue;
				}
				if(j.fi<=ind-1) gang(1,0,m,j.fi,ind-1,0,t);
				gang(1,0,m,ind,m,1,j.se);
			}
		}
	}
	cout<<ans+seg[1];
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 416 ms 65632 KB Output is correct
2 Correct 435 ms 66848 KB Output is correct
3 Correct 403 ms 65884 KB Output is correct
4 Correct 345 ms 59000 KB Output is correct
5 Correct 26 ms 35584 KB Output is correct
6 Correct 436 ms 66032 KB Output is correct
7 Correct 256 ms 52320 KB Output is correct
8 Correct 128 ms 48120 KB Output is correct
9 Correct 425 ms 65988 KB Output is correct
10 Correct 435 ms 65784 KB Output is correct
11 Correct 402 ms 65948 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 35584 KB Output is correct
2 Correct 24 ms 35584 KB Output is correct
3 Correct 25 ms 35584 KB Output is correct
4 Correct 25 ms 35584 KB Output is correct
5 Correct 24 ms 35584 KB Output is correct
6 Correct 26 ms 35704 KB Output is correct
7 Correct 27 ms 35584 KB Output is correct
8 Correct 26 ms 35584 KB Output is correct
9 Correct 25 ms 35584 KB Output is correct
10 Correct 25 ms 35584 KB Output is correct
11 Correct 26 ms 35584 KB Output is correct
12 Correct 25 ms 35584 KB Output is correct
13 Correct 25 ms 35584 KB Output is correct
14 Correct 27 ms 35584 KB Output is correct
15 Correct 26 ms 35584 KB Output is correct
16 Correct 26 ms 35584 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 35584 KB Output is correct
2 Correct 24 ms 35584 KB Output is correct
3 Correct 25 ms 35584 KB Output is correct
4 Correct 25 ms 35584 KB Output is correct
5 Correct 24 ms 35584 KB Output is correct
6 Correct 26 ms 35704 KB Output is correct
7 Correct 27 ms 35584 KB Output is correct
8 Correct 26 ms 35584 KB Output is correct
9 Correct 25 ms 35584 KB Output is correct
10 Correct 25 ms 35584 KB Output is correct
11 Correct 26 ms 35584 KB Output is correct
12 Correct 25 ms 35584 KB Output is correct
13 Correct 25 ms 35584 KB Output is correct
14 Correct 27 ms 35584 KB Output is correct
15 Correct 26 ms 35584 KB Output is correct
16 Correct 26 ms 35584 KB Output is correct
17 Correct 27 ms 35968 KB Output is correct
18 Correct 27 ms 35960 KB Output is correct
19 Incorrect 28 ms 35968 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #4
0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 35584 KB Output is correct
2 Correct 24 ms 35584 KB Output is correct
3 Correct 25 ms 35584 KB Output is correct
4 Correct 25 ms 35584 KB Output is correct
5 Correct 24 ms 35584 KB Output is correct
6 Correct 26 ms 35704 KB Output is correct
7 Correct 27 ms 35584 KB Output is correct
8 Correct 26 ms 35584 KB Output is correct
9 Correct 25 ms 35584 KB Output is correct
10 Correct 25 ms 35584 KB Output is correct
11 Correct 26 ms 35584 KB Output is correct
12 Correct 25 ms 35584 KB Output is correct
13 Correct 25 ms 35584 KB Output is correct
14 Correct 27 ms 35584 KB Output is correct
15 Correct 26 ms 35584 KB Output is correct
16 Correct 26 ms 35584 KB Output is correct
17 Correct 27 ms 35968 KB Output is correct
18 Correct 27 ms 35960 KB Output is correct
19 Incorrect 28 ms 35968 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 35584 KB Output is correct
2 Correct 24 ms 35584 KB Output is correct
3 Correct 25 ms 35584 KB Output is correct
4 Correct 25 ms 35584 KB Output is correct
5 Correct 24 ms 35584 KB Output is correct
6 Correct 26 ms 35704 KB Output is correct
7 Correct 27 ms 35584 KB Output is correct
8 Correct 26 ms 35584 KB Output is correct
9 Correct 25 ms 35584 KB Output is correct
10 Correct 25 ms 35584 KB Output is correct
11 Correct 26 ms 35584 KB Output is correct
12 Correct 25 ms 35584 KB Output is correct
13 Correct 25 ms 35584 KB Output is correct
14 Correct 27 ms 35584 KB Output is correct
15 Correct 26 ms 35584 KB Output is correct
16 Correct 26 ms 35584 KB Output is correct
17 Correct 27 ms 35968 KB Output is correct
18 Correct 27 ms 35960 KB Output is correct
19 Incorrect 28 ms 35968 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 35584 KB Output is correct
2 Correct 24 ms 35584 KB Output is correct
3 Correct 25 ms 35584 KB Output is correct
4 Correct 25 ms 35584 KB Output is correct
5 Correct 24 ms 35584 KB Output is correct
6 Correct 26 ms 35704 KB Output is correct
7 Correct 27 ms 35584 KB Output is correct
8 Correct 26 ms 35584 KB Output is correct
9 Correct 25 ms 35584 KB Output is correct
10 Correct 25 ms 35584 KB Output is correct
11 Correct 26 ms 35584 KB Output is correct
12 Correct 25 ms 35584 KB Output is correct
13 Correct 25 ms 35584 KB Output is correct
14 Correct 27 ms 35584 KB Output is correct
15 Correct 26 ms 35584 KB Output is correct
16 Correct 26 ms 35584 KB Output is correct
17 Correct 27 ms 35968 KB Output is correct
18 Correct 27 ms 35960 KB Output is correct
19 Incorrect 28 ms 35968 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #7
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 416 ms 65632 KB Output is correct
2 Correct 435 ms 66848 KB Output is correct
3 Correct 403 ms 65884 KB Output is correct
4 Correct 345 ms 59000 KB Output is correct
5 Correct 26 ms 35584 KB Output is correct
6 Correct 436 ms 66032 KB Output is correct
7 Correct 256 ms 52320 KB Output is correct
8 Correct 128 ms 48120 KB Output is correct
9 Correct 425 ms 65988 KB Output is correct
10 Correct 435 ms 65784 KB Output is correct
11 Correct 402 ms 65948 KB Output is correct
12 Correct 25 ms 35584 KB Output is correct
13 Correct 24 ms 35584 KB Output is correct
14 Correct 25 ms 35584 KB Output is correct
15 Correct 25 ms 35584 KB Output is correct
16 Correct 24 ms 35584 KB Output is correct
17 Correct 26 ms 35704 KB Output is correct
18 Correct 27 ms 35584 KB Output is correct
19 Correct 26 ms 35584 KB Output is correct
20 Correct 25 ms 35584 KB Output is correct
21 Correct 25 ms 35584 KB Output is correct
22 Correct 26 ms 35584 KB Output is correct
23 Correct 25 ms 35584 KB Output is correct
24 Correct 25 ms 35584 KB Output is correct
25 Correct 27 ms 35584 KB Output is correct
26 Correct 26 ms 35584 KB Output is correct
27 Correct 26 ms 35584 KB Output is correct
28 Correct 27 ms 35968 KB Output is correct
29 Correct 27 ms 35960 KB Output is correct
30 Incorrect 28 ms 35968 KB Output isn't correct
31 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 416 ms 65632 KB Output is correct
2 Correct 435 ms 66848 KB Output is correct
3 Correct 403 ms 65884 KB Output is correct
4 Correct 345 ms 59000 KB Output is correct
5 Correct 26 ms 35584 KB Output is correct
6 Correct 436 ms 66032 KB Output is correct
7 Correct 256 ms 52320 KB Output is correct
8 Correct 128 ms 48120 KB Output is correct
9 Correct 425 ms 65988 KB Output is correct
10 Correct 435 ms 65784 KB Output is correct
11 Correct 402 ms 65948 KB Output is correct
12 Correct 25 ms 35584 KB Output is correct
13 Correct 24 ms 35584 KB Output is correct
14 Correct 25 ms 35584 KB Output is correct
15 Correct 25 ms 35584 KB Output is correct
16 Correct 24 ms 35584 KB Output is correct
17 Correct 26 ms 35704 KB Output is correct
18 Correct 27 ms 35584 KB Output is correct
19 Correct 26 ms 35584 KB Output is correct
20 Correct 25 ms 35584 KB Output is correct
21 Correct 25 ms 35584 KB Output is correct
22 Correct 26 ms 35584 KB Output is correct
23 Correct 25 ms 35584 KB Output is correct
24 Correct 25 ms 35584 KB Output is correct
25 Correct 27 ms 35584 KB Output is correct
26 Correct 26 ms 35584 KB Output is correct
27 Correct 26 ms 35584 KB Output is correct
28 Correct 27 ms 35968 KB Output is correct
29 Correct 27 ms 35960 KB Output is correct
30 Incorrect 28 ms 35968 KB Output isn't correct
31 Halted 0 ms 0 KB -