oj.uz

Submission #415835

# Submission time Handle Problem Language Result Execution time Memory
415835 2021-06-01T15:25:58 Z alishahali1382 Arranging Tickets (JOI17_arranging_tickets) C++14
85 / 100
 630 ms 15336 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

const int inf=1000000010;
const ll INF=1000000000000001000LL;
const int mod=1000000007;
const int MAXN=200010, LOG=17;

int n, m, k, u, v, x, y, t, a, b;
int A[MAXN], B[MAXN], C[MAXN];
ll ps[MAXN], ans, mx;
vector<pii> vec[MAXN];

struct Fenwick{
	ll fen[MAXN];
	void reset(){
		memset(fen, 0, sizeof(fen));
	}
	void add(int pos, ll val){
		for (; pos<MAXN; pos+=pos&-pos) fen[pos]+=val;
	}
	int get(int pos){
		int res=0;
		for (; pos; pos-=pos&-pos) res+=fen[pos];
		return res;
	}
} fen;
bool Check2(ll ted){
	if (ted>ans) return 0;
	fen.reset();
	fen.add(1, ted);
	for (int i=1; i<n; i++) fen.add(i, ps[i]-ps[i-1]);
	
	priority_queue<pii> pq;
	for (int i=1; i<n; i++){
		for (pii p:vec[i]) pq.push(p);
		ll val=fen.get(i);
//		debug2(i, val)
		while (val>ans){
			if (pq.empty()) return 0;
			pii p=pq.top();
			pq.pop();
			int j=p.first;
			ll cnt=p.second;
			if (j<=i) return 0;
			ll t=min((val-ans+1)/2, cnt);
//			debugp(p)
//			debug(t)
			fen.add(i, -2*t);
			fen.add(j, +2*t);
			val-=2*t;
			ted-=t;
			if (ted<0) return 0;
			if (cnt-=t) pq.push({j, cnt});
		}
	}
	return 1;
}
bool Check(){
	if (mx<=ans) return 1;
	if ((mx+1)/2>ans) return 0;
	if (Check2(mx-ans) || Check2(mx-ans+1)) return 1;
	return 0;
}

int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	cin>>n>>m;
	for (int i=1; i<=m; i++){
		cin>>A[i]>>B[i]>>C[i];
		if (A[i]>B[i]) swap(A[i], B[i]);
		ps[A[i]]+=C[i];
		ps[B[i]]-=C[i];
	}
	for (int i=1; i<=n; i++) ps[i]+=ps[i-1];
	mx=*max_element(ps+1, ps+n);
	int l=0, r=0;
	for (int i=1; i<n; i++) if (ps[i]==mx){
		if (!l) l=i;
		r=i;
	}
	for (int j=1; j<=m; j++) if (A[j]<=l && r<B[j]) vec[A[j]].pb({B[j], C[j]});
	
	ll dwn=0, up=mx;
	while (up-dwn>1){
		ans=(dwn+up)>>1;
		if (Check()) up=ans;
		else dwn=ans;
	}
	cout<<up<<"\n";
	
	return 0;
}
/*
3 3
1 2 1
2 3 1
3 1 1

6 3
1 4 1
2 5 1
3 6 1

5 5
1 3 1
1 3 1
5 3 1
5 2 1
2 5 1

4 4
4 2 1
1 3 1
2 4 1
2 4 1


*/

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 6476 KB Output is correct
2 Correct 6 ms 6560 KB Output is correct
3 Correct 5 ms 6476 KB Output is correct
4 Correct 5 ms 6552 KB Output is correct
5 Correct 6 ms 6476 KB Output is correct
6 Correct 6 ms 6476 KB Output is correct
7 Correct 6 ms 6552 KB Output is correct
8 Correct 5 ms 6476 KB Output is correct
9 Correct 5 ms 6476 KB Output is correct
10 Correct 5 ms 6556 KB Output is correct
11 Correct 6 ms 6476 KB Output is correct
12 Correct 5 ms 6476 KB Output is correct
13 Correct 5 ms 6552 KB Output is correct
14 Correct 6 ms 6476 KB Output is correct
15 Correct 6 ms 6536 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 6476 KB Output is correct
2 Correct 6 ms 6560 KB Output is correct
3 Correct 5 ms 6476 KB Output is correct
4 Correct 5 ms 6552 KB Output is correct
5 Correct 6 ms 6476 KB Output is correct
6 Correct 6 ms 6476 KB Output is correct
7 Correct 6 ms 6552 KB Output is correct
8 Correct 5 ms 6476 KB Output is correct
9 Correct 5 ms 6476 KB Output is correct
10 Correct 5 ms 6556 KB Output is correct
11 Correct 6 ms 6476 KB Output is correct
12 Correct 5 ms 6476 KB Output is correct
13 Correct 5 ms 6552 KB Output is correct
14 Correct 6 ms 6476 KB Output is correct
15 Correct 6 ms 6536 KB Output is correct
16 Correct 7 ms 6604 KB Output is correct
17 Correct 5 ms 6564 KB Output is correct
18 Correct 7 ms 6604 KB Output is correct
19 Correct 7 ms 6604 KB Output is correct
20 Correct 6 ms 6552 KB Output is correct
21 Correct 5 ms 6604 KB Output is correct
22 Correct 7 ms 6564 KB Output is correct
23 Correct 6 ms 6616 KB Output is correct
24 Correct 7 ms 6556 KB Output is correct
25 Correct 7 ms 6564 KB Output is correct
26 Correct 8 ms 6604 KB Output is correct
27 Correct 6 ms 6560 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 6476 KB Output is correct
2 Correct 6 ms 6560 KB Output is correct
3 Correct 5 ms 6476 KB Output is correct
4 Correct 5 ms 6552 KB Output is correct
5 Correct 6 ms 6476 KB Output is correct
6 Correct 6 ms 6476 KB Output is correct
7 Correct 6 ms 6552 KB Output is correct
8 Correct 5 ms 6476 KB Output is correct
9 Correct 5 ms 6476 KB Output is correct
10 Correct 5 ms 6556 KB Output is correct
11 Correct 6 ms 6476 KB Output is correct
12 Correct 5 ms 6476 KB Output is correct
13 Correct 5 ms 6552 KB Output is correct
14 Correct 6 ms 6476 KB Output is correct
15 Correct 6 ms 6536 KB Output is correct
16 Correct 7 ms 6604 KB Output is correct
17 Correct 5 ms 6564 KB Output is correct
18 Correct 7 ms 6604 KB Output is correct
19 Correct 7 ms 6604 KB Output is correct
20 Correct 6 ms 6552 KB Output is correct
21 Correct 5 ms 6604 KB Output is correct
22 Correct 7 ms 6564 KB Output is correct
23 Correct 6 ms 6616 KB Output is correct
24 Correct 7 ms 6556 KB Output is correct
25 Correct 7 ms 6564 KB Output is correct
26 Correct 8 ms 6604 KB Output is correct
27 Correct 6 ms 6560 KB Output is correct
28 Correct 10 ms 6768 KB Output is correct
29 Correct 10 ms 6732 KB Output is correct
30 Correct 10 ms 6652 KB Output is correct
31 Correct 12 ms 6656 KB Output is correct
32 Correct 11 ms 6700 KB Output is correct
33 Correct 11 ms 6732 KB Output is correct
34 Correct 6 ms 6732 KB Output is correct
35 Correct 11 ms 6700 KB Output is correct
36 Correct 13 ms 6704 KB Output is correct
37 Correct 7 ms 6660 KB Output is correct
38 Correct 7 ms 6604 KB Output is correct
39 Correct 7 ms 6652 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 6476 KB Output is correct
2 Correct 6 ms 6560 KB Output is correct
3 Correct 5 ms 6476 KB Output is correct
4 Correct 5 ms 6552 KB Output is correct
5 Correct 6 ms 6476 KB Output is correct
6 Correct 6 ms 6476 KB Output is correct
7 Correct 6 ms 6552 KB Output is correct
8 Correct 5 ms 6476 KB Output is correct
9 Correct 5 ms 6476 KB Output is correct
10 Correct 5 ms 6556 KB Output is correct
11 Correct 6 ms 6476 KB Output is correct
12 Correct 5 ms 6476 KB Output is correct
13 Correct 5 ms 6552 KB Output is correct
14 Correct 6 ms 6476 KB Output is correct
15 Correct 6 ms 6536 KB Output is correct
16 Correct 7 ms 6604 KB Output is correct
17 Correct 5 ms 6564 KB Output is correct
18 Correct 7 ms 6604 KB Output is correct
19 Correct 7 ms 6604 KB Output is correct
20 Correct 6 ms 6552 KB Output is correct
21 Correct 5 ms 6604 KB Output is correct
22 Correct 7 ms 6564 KB Output is correct
23 Correct 6 ms 6616 KB Output is correct
24 Correct 7 ms 6556 KB Output is correct
25 Correct 7 ms 6564 KB Output is correct
26 Correct 8 ms 6604 KB Output is correct
27 Correct 6 ms 6560 KB Output is correct
28 Correct 10 ms 6768 KB Output is correct
29 Correct 10 ms 6732 KB Output is correct
30 Correct 10 ms 6652 KB Output is correct
31 Correct 12 ms 6656 KB Output is correct
32 Correct 11 ms 6700 KB Output is correct
33 Correct 11 ms 6732 KB Output is correct
34 Correct 6 ms 6732 KB Output is correct
35 Correct 11 ms 6700 KB Output is correct
36 Correct 13 ms 6704 KB Output is correct
37 Correct 7 ms 6660 KB Output is correct
38 Correct 7 ms 6604 KB Output is correct
39 Correct 7 ms 6652 KB Output is correct
40 Correct 335 ms 13412 KB Output is correct
41 Correct 343 ms 12984 KB Output is correct
42 Correct 346 ms 12676 KB Output is correct
43 Correct 427 ms 12372 KB Output is correct
44 Correct 285 ms 12492 KB Output is correct
45 Correct 401 ms 12124 KB Output is correct
46 Correct 303 ms 12616 KB Output is correct
47 Correct 70 ms 12484 KB Output is correct
48 Correct 57 ms 11920 KB Output is correct
49 Correct 45 ms 10228 KB Output is correct
50 Correct 49 ms 9284 KB Output is correct
51 Correct 42 ms 10004 KB Output is correct

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 6476 KB Output is correct
2 Correct 6 ms 6560 KB Output is correct
3 Correct 5 ms 6476 KB Output is correct
4 Correct 5 ms 6552 KB Output is correct
5 Correct 6 ms 6476 KB Output is correct
6 Correct 6 ms 6476 KB Output is correct
7 Correct 6 ms 6552 KB Output is correct
8 Correct 5 ms 6476 KB Output is correct
9 Correct 5 ms 6476 KB Output is correct
10 Correct 5 ms 6556 KB Output is correct
11 Correct 6 ms 6476 KB Output is correct
12 Correct 5 ms 6476 KB Output is correct
13 Correct 5 ms 6552 KB Output is correct
14 Correct 6 ms 6476 KB Output is correct
15 Correct 6 ms 6536 KB Output is correct
16 Correct 7 ms 6604 KB Output is correct
17 Correct 5 ms 6564 KB Output is correct
18 Correct 7 ms 6604 KB Output is correct
19 Correct 7 ms 6604 KB Output is correct
20 Correct 6 ms 6552 KB Output is correct
21 Correct 5 ms 6604 KB Output is correct
22 Correct 7 ms 6564 KB Output is correct
23 Correct 6 ms 6616 KB Output is correct
24 Correct 7 ms 6556 KB Output is correct
25 Correct 7 ms 6564 KB Output is correct
26 Correct 8 ms 6604 KB Output is correct
27 Correct 6 ms 6560 KB Output is correct
28 Correct 10 ms 6768 KB Output is correct
29 Correct 10 ms 6732 KB Output is correct
30 Correct 10 ms 6652 KB Output is correct
31 Correct 12 ms 6656 KB Output is correct
32 Correct 11 ms 6700 KB Output is correct
33 Correct 11 ms 6732 KB Output is correct
34 Correct 6 ms 6732 KB Output is correct
35 Correct 11 ms 6700 KB Output is correct
36 Correct 13 ms 6704 KB Output is correct
37 Correct 7 ms 6660 KB Output is correct
38 Correct 7 ms 6604 KB Output is correct
39 Correct 7 ms 6652 KB Output is correct
40 Correct 335 ms 13412 KB Output is correct
41 Correct 343 ms 12984 KB Output is correct
42 Correct 346 ms 12676 KB Output is correct
43 Correct 427 ms 12372 KB Output is correct
44 Correct 285 ms 12492 KB Output is correct
45 Correct 401 ms 12124 KB Output is correct
46 Correct 303 ms 12616 KB Output is correct
47 Correct 70 ms 12484 KB Output is correct
48 Correct 57 ms 11920 KB Output is correct
49 Correct 45 ms 10228 KB Output is correct
50 Correct 49 ms 9284 KB Output is correct
51 Correct 42 ms 10004 KB Output is correct
52 Incorrect 630 ms 15336 KB Output isn't correct
53 Halted 0 ms 0 KB -