oj.uz

Submission #205734

# Submission time Handle Problem Language Result Execution time Memory
205734 2020-02-29T15:42:12 Z songc Arranging Tickets (JOI17_arranging_tickets) C++14
100 / 100
 1751 ms 8048 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int,int> pii;
 
int N, M;
LL A[202020], B[202020], ans;
 
struct Line{
	int l, r, c;
	bool operator<(const Line &t)const{return l < t.l;}
} P[101010];
priority_queue<pii> PQ;
 
bool chk(int t, LL m, LL n){
	int k=1;
	LL x=0;
	for (int i=1; i<=N; i++) B[i] = 0;
	for (int i=1; i<=t; i++){
		LL p=(n+A[i]-m+1)/2-x;
		if (i==t) p=n-x;
		while (P[k].l == i && k <= M){
			if (P[k].r >= t) PQ.push((pii){P[k].r, P[k].c});
			k++;
		}
		if (p>0) x+=p;
		while (p>0){
			if (PQ.empty()) return false;
			pii T = PQ.top();
			PQ.pop();
			if (T.second > p){
				B[T.first] += p;
				T.second -= p, PQ.push(T);
				break;
			}
			else{
				B[T.first] += T.second;
				p -= T.second;
			}
		}
	}
	while (k<=M) {
		B[P[k].l]+=P[k].c, B[P[k].r]-=P[k].c;
		k++;
	}
	while (!PQ.empty()){
		B[t]+=PQ.top().second, B[PQ.top().first]-=PQ.top().second;
		PQ.pop();
	}
	for (int i=t; i<=N; i++){
		B[i] += B[i-1];
		if (B[i] > m) return false;
	}
	return true;
}
 
int main(){
	scanf("%d %d", &N, &M);
	for (int i=1; i<=M; i++){
		scanf("%d %d %d", &P[i].l, &P[i].r, &P[i].c);
		if (P[i].l > P[i].r) swap(P[i].l, P[i].r);
		A[P[i].l] += P[i].c, A[P[i].r] -= P[i].c;
	}
	sort(P+1, P+M+1);
	LL L=0, H=0;
	int l, r;
	for (int i=1; i<=N; i++){
		A[i] += A[i-1];
		if (H < A[i]) l=r=i, H=A[i];
		if (H == A[i]) r=i;
	}
	while (L<=H){
		LL mid=L+H>>1;
		if (chk(l, mid, A[l]-mid) || chk(l, mid, A[l]-mid+1) || chk(r, mid, A[r]-mid) || chk(r, mid, A[r]-mid+1)) H=mid-1, ans=mid;
		else L = mid+1;
	}
	printf("%lld\n", ans);
	return 0;
}

Compilation message

arranging_tickets.cpp: In function 'int main()':
arranging_tickets.cpp:58:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &N, &M);
  ~~~~~^~~~~~~~~~~~~~~~~
arranging_tickets.cpp:60:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d", &P[i].l, &P[i].r, &P[i].c);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
35.0 / 35.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 4 ms 380 KB Output is correct
12 Correct 5 ms 380 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 4 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 380 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 6 ms 380 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 5 ms 376 KB Output is correct
28 Correct 9 ms 376 KB Output is correct
29 Correct 9 ms 376 KB Output is correct
30 Correct 9 ms 376 KB Output is correct
31 Correct 9 ms 376 KB Output is correct
32 Correct 12 ms 376 KB Output is correct
33 Correct 10 ms 504 KB Output is correct
34 Correct 7 ms 376 KB Output is correct
35 Correct 10 ms 380 KB Output is correct
36 Correct 10 ms 504 KB Output is correct
37 Correct 6 ms 376 KB Output is correct
38 Correct 6 ms 376 KB Output is correct
39 Correct 6 ms 376 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 4 ms 380 KB Output is correct
12 Correct 5 ms 380 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 4 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 380 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 6 ms 380 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 5 ms 376 KB Output is correct
28 Correct 9 ms 376 KB Output is correct
29 Correct 9 ms 376 KB Output is correct
30 Correct 9 ms 376 KB Output is correct
31 Correct 9 ms 376 KB Output is correct
32 Correct 12 ms 376 KB Output is correct
33 Correct 10 ms 504 KB Output is correct
34 Correct 7 ms 376 KB Output is correct
35 Correct 10 ms 380 KB Output is correct
36 Correct 10 ms 504 KB Output is correct
37 Correct 6 ms 376 KB Output is correct
38 Correct 6 ms 376 KB Output is correct
39 Correct 6 ms 376 KB Output is correct
40 Correct 236 ms 5236 KB Output is correct
41 Correct 261 ms 5236 KB Output is correct
42 Correct 255 ms 5236 KB Output is correct
43 Correct 403 ms 5236 KB Output is correct
44 Correct 184 ms 5364 KB Output is correct
45 Correct 515 ms 5236 KB Output is correct
46 Correct 268 ms 5108 KB Output is correct
47 Correct 67 ms 5236 KB Output is correct
48 Correct 89 ms 5236 KB Output is correct
49 Correct 66 ms 3704 KB Output is correct
50 Correct 60 ms 3140 KB Output is correct
51 Correct 65 ms 3444 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 4 ms 380 KB Output is correct
12 Correct 5 ms 380 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 4 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 380 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 6 ms 380 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 5 ms 376 KB Output is correct
28 Correct 9 ms 376 KB Output is correct
29 Correct 9 ms 376 KB Output is correct
30 Correct 9 ms 376 KB Output is correct
31 Correct 9 ms 376 KB Output is correct
32 Correct 12 ms 376 KB Output is correct
33 Correct 10 ms 504 KB Output is correct
34 Correct 7 ms 376 KB Output is correct
35 Correct 10 ms 380 KB Output is correct
36 Correct 10 ms 504 KB Output is correct
37 Correct 6 ms 376 KB Output is correct
38 Correct 6 ms 376 KB Output is correct
39 Correct 6 ms 376 KB Output is correct
40 Correct 236 ms 5236 KB Output is correct
41 Correct 261 ms 5236 KB Output is correct
42 Correct 255 ms 5236 KB Output is correct
43 Correct 403 ms 5236 KB Output is correct
44 Correct 184 ms 5364 KB Output is correct
45 Correct 515 ms 5236 KB Output is correct
46 Correct 268 ms 5108 KB Output is correct
47 Correct 67 ms 5236 KB Output is correct
48 Correct 89 ms 5236 KB Output is correct
49 Correct 66 ms 3704 KB Output is correct
50 Correct 60 ms 3140 KB Output is correct
51 Correct 65 ms 3444 KB Output is correct
52 Correct 601 ms 5364 KB Output is correct
53 Correct 875 ms 8048 KB Output is correct
54 Correct 1637 ms 7540 KB Output is correct
55 Correct 538 ms 7540 KB Output is correct
56 Correct 1444 ms 7416 KB Output is correct
57 Correct 1751 ms 7284 KB Output is correct
58 Correct 704 ms 7156 KB Output is correct
59 Correct 647 ms 5876 KB Output is correct