Submission #814606

# Submission time Handle Problem Language Result Execution time Memory
814606 2023-08-08T08:31:04 Z 이종영(#10372) Arranging Tickets (JOI17_arranging_tickets) C++17
85 / 100
5163 ms 17940 KB
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif
using ll=long long;
using pii=array<int,2>;
using tii=array<int,3>;
const ll inf=1e18;
const int N=2e5+5;
int n,m;
ll k,in[N],w[N],ans;
vector<pii> v[N];
tii a[N];
struct ST{
	ll T[2*N],D[2*N];
	void init(int nd,int l,int r){
		if(l==r){
			T[nd]=w[l];
			D[nd]=0;
			return;
		}
		int m=(l+r)>>1,ln=nd+1,rn=nd+2*(m-l+1);
		init(ln,l,m); init(rn,m+1,r);
		T[nd]=min(T[ln],T[rn]); 
		D[nd]=0;
	}
	void upd(int nd,int l,int r,int s,int e,ll v){
		if(r<s||e<l) return;
		if(s<=l&&r<=e){
			T[nd]+=v;
			D[nd]+=v;
			return;
		}
		int m=(l+r)>>1,ln=nd+1,rn=nd+2*(m-l+1);
		upd(ln,l,m,s,e,v); upd(rn,m+1,r,s,e,v);
		T[nd]=min(T[ln],T[rn])+D[nd];
	}
	ll qry(int nd,int l,int r,int s,int e){
		if(r<s||e<l) return 1e9;
		if(s<=l&&r<=e) return T[nd];
		int m=(l+r)>>1,ln=nd+1,rn=nd+2*(m-l+1);
		return min(qry(ln,l,m,s,e),qry(rn,m+1,r,s,e))+D[nd];
	}
}T;
ll Do(ll s){
	if(s==2*k) return 1e18;
	ll ret=s;
	for(int i=1;i<=n;i++){
		w[i]=(s-k+in[i])/2;
	}
	T.init(1,1,n);
	for(int r=1;r<n;r++){
		for(auto [l,d]: v[r]){
			ll val=T.qry(1,1,n,l,r);
			if(val==0) break;
			val=min(val,(ll)d);
			T.upd(1,1,n,l,r,-val);
			ret-=val;
		}
	}
	return ret;
}
int main(){
	ios::sync_with_stdio(false); cin.tie(0);
	cin>>n>>m;
	for(int i=1;i<=m;i++){
		cin>>a[i][0]>>a[i][1]>>a[i][2];
		if(a[i][0]>a[i][1]) swap(a[i][0],a[i][1]);
		in[a[i][0]]+=a[i][2];
		in[a[i][1]]-=a[i][2];
		v[a[i][1]-1].push_back({a[i][0],a[i][2]});
		k+=a[i][2];
	}
	for(int i=1;i<=n;i++) in[i]+=in[i-1];
	for(int i=1;i<=n;i++) sort(v[i].begin(),v[i].end(),greater<>());
	ans=k;
	ll L=k,R=2*k-1;
	while(L<=R){
		ll M=(L+R)>>1;
		ll v1=Do(M),v2=Do(M+1);
		if(v1<=v2){
			ans=min(ans,v1);
			R=M-1;
		} else{
			ans=min(ans,v2);
			L=M+1;
		}
	}
	//for(ll i=k;i<=k+100;i++) ans=min(ans,Do(i));
	cout<<ans;
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 5044 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 5044 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 4 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 5076 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 3 ms 4948 KB Output is correct
24 Correct 3 ms 5072 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 3 ms 4948 KB Output is correct
27 Correct 4 ms 4948 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 5044 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 4 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 5076 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 3 ms 4948 KB Output is correct
24 Correct 3 ms 5072 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 3 ms 4948 KB Output is correct
27 Correct 4 ms 4948 KB Output is correct
28 Correct 19 ms 5204 KB Output is correct
29 Correct 17 ms 5204 KB Output is correct
30 Correct 24 ms 5204 KB Output is correct
31 Correct 17 ms 5284 KB Output is correct
32 Correct 15 ms 5204 KB Output is correct
33 Correct 22 ms 5292 KB Output is correct
34 Correct 16 ms 5204 KB Output is correct
35 Correct 22 ms 5204 KB Output is correct
36 Correct 16 ms 5288 KB Output is correct
37 Correct 17 ms 5284 KB Output is correct
38 Correct 17 ms 5324 KB Output is correct
39 Correct 18 ms 5308 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 5044 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 4 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 5076 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 3 ms 4948 KB Output is correct
24 Correct 3 ms 5072 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 3 ms 4948 KB Output is correct
27 Correct 4 ms 4948 KB Output is correct
28 Correct 19 ms 5204 KB Output is correct
29 Correct 17 ms 5204 KB Output is correct
30 Correct 24 ms 5204 KB Output is correct
31 Correct 17 ms 5284 KB Output is correct
32 Correct 15 ms 5204 KB Output is correct
33 Correct 22 ms 5292 KB Output is correct
34 Correct 16 ms 5204 KB Output is correct
35 Correct 22 ms 5204 KB Output is correct
36 Correct 16 ms 5288 KB Output is correct
37 Correct 17 ms 5284 KB Output is correct
38 Correct 17 ms 5324 KB Output is correct
39 Correct 18 ms 5308 KB Output is correct
40 Correct 1353 ms 17872 KB Output is correct
41 Correct 1451 ms 17724 KB Output is correct
42 Correct 1661 ms 17940 KB Output is correct
43 Correct 1507 ms 17680 KB Output is correct
44 Correct 1589 ms 17560 KB Output is correct
45 Correct 1517 ms 17720 KB Output is correct
46 Correct 1356 ms 17544 KB Output is correct
47 Correct 1298 ms 17344 KB Output is correct
48 Correct 1385 ms 17652 KB Output is correct
49 Correct 1163 ms 12952 KB Output is correct
50 Correct 1303 ms 13852 KB Output is correct
51 Correct 1127 ms 13140 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 5044 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 4 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 5076 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 3 ms 4948 KB Output is correct
24 Correct 3 ms 5072 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 3 ms 4948 KB Output is correct
27 Correct 4 ms 4948 KB Output is correct
28 Correct 19 ms 5204 KB Output is correct
29 Correct 17 ms 5204 KB Output is correct
30 Correct 24 ms 5204 KB Output is correct
31 Correct 17 ms 5284 KB Output is correct
32 Correct 15 ms 5204 KB Output is correct
33 Correct 22 ms 5292 KB Output is correct
34 Correct 16 ms 5204 KB Output is correct
35 Correct 22 ms 5204 KB Output is correct
36 Correct 16 ms 5288 KB Output is correct
37 Correct 17 ms 5284 KB Output is correct
38 Correct 17 ms 5324 KB Output is correct
39 Correct 18 ms 5308 KB Output is correct
40 Correct 1353 ms 17872 KB Output is correct
41 Correct 1451 ms 17724 KB Output is correct
42 Correct 1661 ms 17940 KB Output is correct
43 Correct 1507 ms 17680 KB Output is correct
44 Correct 1589 ms 17560 KB Output is correct
45 Correct 1517 ms 17720 KB Output is correct
46 Correct 1356 ms 17544 KB Output is correct
47 Correct 1298 ms 17344 KB Output is correct
48 Correct 1385 ms 17652 KB Output is correct
49 Correct 1163 ms 12952 KB Output is correct
50 Correct 1303 ms 13852 KB Output is correct
51 Correct 1127 ms 13140 KB Output is correct
52 Incorrect 5163 ms 17656 KB Output isn't correct
53 Halted 0 ms 0 KB -