Submission #548975

# Submission time Handle Problem Language Result Execution time Memory
548975 2022-04-14T21:14:55 Z LucaDantas Arranging Tickets (JOI17_arranging_tickets) C++17
85 / 100
277 ms 13752 KB
#include <bits/stdc++.h>
using namespace std;

constexpr int maxn = 2e5+10;

struct Itv {
	int l, r, qtd; // subtasks 1-4 qtd == 1 so I can ignore it for what I'm going to code
} itv[maxn];

int a[maxn]; // quantos caras precisam passar por cada pos

vector<int> opa[maxn];

bool check(int qtd_mov, int M, int sz) {
	vector<int> mov(sz+1);
	for(int i = 1; i <= sz; i++)
		mov[i] = (a[i] + qtd_mov - M + 1) / 2;

	priority_queue<int> q;
	vector<int> add_lazy(sz+1);

	int usados = 0, lazy = 0;
	for(int i = 1; i <= sz; i++) {
		for(int x : opa[i])
			q.push(x);
		
		lazy += add_lazy[i];
		mov[i] += lazy;

		while(mov[i] > 0) {
			if(!q.size() || q.top() <= i) return 0; // não da pra fazer
			--mov[i];
			--lazy;
			add_lazy[q.top()]++;
			q.pop();
			usados++;
		}
	}
	// printf("%d %d\n", usados, qtd_mov);
	return usados == qtd_mov;
}

int main() {
	int sz, n; scanf("%d %d", &sz, &n);
	for(int i = 0; i < n; i++) {
		scanf("%d %d %d", &itv[i].l, &itv[i].r, &itv[i].qtd);
		if(itv[i].l > itv[i].r) swap(itv[i].l, itv[i].r);
		a[itv[i].l]++, a[itv[i].r]--;
		opa[itv[i].l].push_back(itv[i].r);
	}

	int mx = 0;
	for(int i = 1; i <= sz; i++)
		a[i] += a[i-1], mx = max(mx, a[i]);
	
	int L = 0, R = mx, ans = -1;
	while(L <= R) {
		int M = (L+R) >> 1;
		int qtd_mov = mx - M;
		// a[i] + qtd_mov - 2*mov[i] <= M
		// 2*mov[i] >= a[i] + qtd_mov - M
		// mov[i] >= ceiling( (a[i] + qtd_mov - M) / 2 )
		// mov[i] >= (a[i] + qtd_mov - M + 1) / 2
		if(check(qtd_mov, M, sz) || check(qtd_mov+1, M, sz))
			ans = M, R = M-1;
		else
			L = M+1;

		// printf("%d\n", M);
	}
	printf("%d\n", ans);
}

Compilation message

arranging_tickets.cpp: In function 'int main()':
arranging_tickets.cpp:44:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 |  int sz, n; scanf("%d %d", &sz, &n);
      |             ~~~~~^~~~~~~~~~~~~~~~~~
arranging_tickets.cpp:46:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   46 |   scanf("%d %d %d", &itv[i].l, &itv[i].r, &itv[i].qtd);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# 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 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 4 ms 5008 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 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 2 ms 4948 KB Output is correct
15 Correct 2 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 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 4 ms 5008 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 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 2 ms 4948 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 2 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 5 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 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 4948 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 3 ms 5004 KB Output is correct
27 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 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 4 ms 5008 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 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 2 ms 4948 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 2 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 5 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 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 4948 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 3 ms 5004 KB Output is correct
27 Correct 3 ms 4948 KB Output is correct
28 Correct 6 ms 5076 KB Output is correct
29 Correct 6 ms 5144 KB Output is correct
30 Correct 6 ms 5076 KB Output is correct
31 Correct 6 ms 5076 KB Output is correct
32 Correct 6 ms 5084 KB Output is correct
33 Correct 5 ms 5148 KB Output is correct
34 Correct 4 ms 5076 KB Output is correct
35 Correct 6 ms 5088 KB Output is correct
36 Correct 6 ms 5152 KB Output is correct
37 Correct 4 ms 5076 KB Output is correct
38 Correct 4 ms 5204 KB Output is correct
39 Correct 4 ms 5152 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 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 4 ms 5008 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 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 2 ms 4948 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 2 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 5 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 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 4948 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 3 ms 5004 KB Output is correct
27 Correct 3 ms 4948 KB Output is correct
28 Correct 6 ms 5076 KB Output is correct
29 Correct 6 ms 5144 KB Output is correct
30 Correct 6 ms 5076 KB Output is correct
31 Correct 6 ms 5076 KB Output is correct
32 Correct 6 ms 5084 KB Output is correct
33 Correct 5 ms 5148 KB Output is correct
34 Correct 4 ms 5076 KB Output is correct
35 Correct 6 ms 5088 KB Output is correct
36 Correct 6 ms 5152 KB Output is correct
37 Correct 4 ms 5076 KB Output is correct
38 Correct 4 ms 5204 KB Output is correct
39 Correct 4 ms 5152 KB Output is correct
40 Correct 259 ms 12868 KB Output is correct
41 Correct 200 ms 12924 KB Output is correct
42 Correct 169 ms 12472 KB Output is correct
43 Correct 241 ms 12584 KB Output is correct
44 Correct 227 ms 12784 KB Output is correct
45 Correct 277 ms 12276 KB Output is correct
46 Correct 202 ms 12408 KB Output is correct
47 Correct 74 ms 12108 KB Output is correct
48 Correct 74 ms 11936 KB Output is correct
49 Correct 77 ms 11168 KB Output is correct
50 Correct 62 ms 12488 KB Output is correct
51 Correct 56 ms 11684 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 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 4 ms 5008 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 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 2 ms 4948 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 2 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 5 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 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 4948 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 3 ms 5004 KB Output is correct
27 Correct 3 ms 4948 KB Output is correct
28 Correct 6 ms 5076 KB Output is correct
29 Correct 6 ms 5144 KB Output is correct
30 Correct 6 ms 5076 KB Output is correct
31 Correct 6 ms 5076 KB Output is correct
32 Correct 6 ms 5084 KB Output is correct
33 Correct 5 ms 5148 KB Output is correct
34 Correct 4 ms 5076 KB Output is correct
35 Correct 6 ms 5088 KB Output is correct
36 Correct 6 ms 5152 KB Output is correct
37 Correct 4 ms 5076 KB Output is correct
38 Correct 4 ms 5204 KB Output is correct
39 Correct 4 ms 5152 KB Output is correct
40 Correct 259 ms 12868 KB Output is correct
41 Correct 200 ms 12924 KB Output is correct
42 Correct 169 ms 12472 KB Output is correct
43 Correct 241 ms 12584 KB Output is correct
44 Correct 227 ms 12784 KB Output is correct
45 Correct 277 ms 12276 KB Output is correct
46 Correct 202 ms 12408 KB Output is correct
47 Correct 74 ms 12108 KB Output is correct
48 Correct 74 ms 11936 KB Output is correct
49 Correct 77 ms 11168 KB Output is correct
50 Correct 62 ms 12488 KB Output is correct
51 Correct 56 ms 11684 KB Output is correct
52 Incorrect 195 ms 13752 KB Output isn't correct
53 Halted 0 ms 0 KB -