oj.uz

Submission #97035

# Submission time Handle Problem Language Result Execution time Memory
97035 2019-02-13T12:45:43 Z diamond_duke Arranging Tickets (JOI17_arranging_tickets) C++11
100 / 100
 3807 ms 14584 KB 
#include <algorithm>
#include <cstdio>
#include <vector>
#include <queue>
using ll = long long;
int lp[200005], rp[200005], w[200005], rem[200005], n, m;
ll val[200005], lazy[200005];
std::vector<int> vec[200005];
struct comp { bool operator ()(int x, int y) { return rp[x] < rp[y]; } };
inline bool check(int pos, ll cnt, ll lim)
{
	if (cnt > lim)
		return false;
	for (int i = 0; i < n; i++)
	{
		vec[i].clear();
		lazy[i] = 0;
	}
	for (int i = 0; i < m; i++)
	{
		if (lp[i] <= pos && pos < rp[i])
		{
			vec[lp[i]].push_back(i);
			rem[i] = w[i];
		}
	}
	std::priority_queue<int, std::vector<int>, comp> que;
	for (int i = 0; i <= pos; i++)
	{
		for (int x : vec[i])
			que.push(x);
		ll cur = std::max(0ll, val[i] + cnt - lim) + 1 >> 1;
		while (cur && !que.empty())
		{
			int x = que.top();
			que.pop();
			int sub = std::min<ll>(cur, rem[x]);
			cur -= sub;
			rem[x] -= sub;
			cnt -= sub << 1;
			lazy[lp[x]] -= sub;
			lazy[rp[x]] += sub << 1;
			if (rem[x])
				que.push(x);
		}
		if (cur)
			return false;
	}
	for (int i = 0; i < n; i++)
	{
		if (i)
			lazy[i] += lazy[i - 1];
		if (lazy[i] + val[i] > lim)
			return false;
	}
	return true;
}
int main()
{
	// freopen("JOISC2017-D2T1.in", "r", stdin);
	scanf("%d%d", &n, &m);
	for (int i = 0; i < m; i++)
	{
		scanf("%d%d%d", lp + i, rp + i, w + i);
		if (lp[i] > rp[i])
			std::swap(lp[i], rp[i]);
		val[lp[i]] += w[i];
		val[rp[i]] -= w[i];
	}
	int fir = 0, lst = 0;
	for (int i = 1; i < n; i++)
	{
		val[i] += val[i - 1];
		if (val[i] > val[fir])
			fir = i;
		if (val[i] == val[fir])
			lst = i;
	}
	ll l = 0, r = val[lst], res = -1;
	while (l <= r)
	{
		ll mid = l + r >> 1;
		if (check(fir, val[fir] - mid, mid) || check(fir, val[fir] - mid + 1, mid) ||
				check(lst, val[fir] - mid, mid) || check(lst, val[fir] - mid + 1, mid))
		{
			res = mid;
			r = mid - 1;
		}
		else
			l = mid + 1;
	}
	printf("%lld\n", res);
	return 0;
}

Compilation message

arranging_tickets.cpp: In function 'int main()':
arranging_tickets.cpp:61: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:64:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", lp + i, rp + i, w + i);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
35.0 / 35.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5120 KB Output is correct
2 Correct 8 ms 4992 KB Output is correct
3 Correct 7 ms 4992 KB Output is correct
4 Correct 8 ms 5120 KB Output is correct
5 Correct 6 ms 5068 KB Output is correct
6 Correct 7 ms 5168 KB Output is correct
7 Correct 7 ms 5120 KB Output is correct
8 Correct 8 ms 5120 KB Output is correct
9 Correct 9 ms 5120 KB Output is correct
10 Correct 7 ms 5092 KB Output is correct
11 Correct 6 ms 4992 KB Output is correct
12 Correct 7 ms 4992 KB Output is correct
13 Correct 8 ms 5120 KB Output is correct
14 Correct 7 ms 4992 KB Output is correct
15 Correct 7 ms 5120 KB Output is correct
16 Correct 7 ms 5120 KB Output is correct
17 Correct 7 ms 5120 KB Output is correct
18 Correct 7 ms 4992 KB Output is correct
19 Correct 7 ms 5120 KB Output is correct
20 Correct 7 ms 5120 KB Output is correct
21 Correct 7 ms 5120 KB Output is correct
22 Correct 8 ms 5120 KB Output is correct
23 Correct 6 ms 4992 KB Output is correct
24 Correct 8 ms 5120 KB Output is correct
25 Correct 8 ms 5120 KB Output is correct
26 Correct 8 ms 4992 KB Output is correct
27 Correct 7 ms 4992 KB Output is correct
28 Correct 9 ms 5248 KB Output is correct
29 Correct 10 ms 5120 KB Output is correct
30 Correct 9 ms 5120 KB Output is correct
31 Correct 9 ms 5120 KB Output is correct
32 Correct 12 ms 5248 KB Output is correct
33 Correct 9 ms 5248 KB Output is correct
34 Correct 8 ms 5248 KB Output is correct
35 Correct 9 ms 5120 KB Output is correct
36 Correct 10 ms 5228 KB Output is correct
37 Correct 7 ms 5120 KB Output is correct
38 Correct 8 ms 5120 KB Output is correct
39 Correct 9 ms 5120 KB Output is correct
40 Correct 480 ms 11864 KB Output is correct
41 Correct 523 ms 12196 KB Output is correct
42 Correct 445 ms 11740 KB Output is correct
43 Correct 662 ms 11664 KB Output is correct
44 Correct 441 ms 11744 KB Output is correct
45 Correct 771 ms 11488 KB Output is correct
46 Correct 476 ms 11904 KB Output is correct
47 Correct 83 ms 11896 KB Output is correct
48 Correct 63 ms 11256 KB Output is correct
49 Correct 66 ms 9592 KB Output is correct
50 Correct 56 ms 8440 KB Output is correct
51 Correct 59 ms 9464 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5120 KB Output is correct
2 Correct 8 ms 4992 KB Output is correct
3 Correct 7 ms 4992 KB Output is correct
4 Correct 8 ms 5120 KB Output is correct
5 Correct 6 ms 5068 KB Output is correct
6 Correct 7 ms 5168 KB Output is correct
7 Correct 7 ms 5120 KB Output is correct
8 Correct 8 ms 5120 KB Output is correct
9 Correct 9 ms 5120 KB Output is correct
10 Correct 7 ms 5092 KB Output is correct
11 Correct 6 ms 4992 KB Output is correct
12 Correct 7 ms 4992 KB Output is correct
13 Correct 8 ms 5120 KB Output is correct
14 Correct 7 ms 4992 KB Output is correct
15 Correct 7 ms 5120 KB Output is correct
16 Correct 7 ms 5120 KB Output is correct
17 Correct 7 ms 5120 KB Output is correct
18 Correct 7 ms 4992 KB Output is correct
19 Correct 7 ms 5120 KB Output is correct
20 Correct 7 ms 5120 KB Output is correct
21 Correct 7 ms 5120 KB Output is correct
22 Correct 8 ms 5120 KB Output is correct
23 Correct 6 ms 4992 KB Output is correct
24 Correct 8 ms 5120 KB Output is correct
25 Correct 8 ms 5120 KB Output is correct
26 Correct 8 ms 4992 KB Output is correct
27 Correct 7 ms 4992 KB Output is correct
28 Correct 9 ms 5248 KB Output is correct
29 Correct 10 ms 5120 KB Output is correct
30 Correct 9 ms 5120 KB Output is correct
31 Correct 9 ms 5120 KB Output is correct
32 Correct 12 ms 5248 KB Output is correct
33 Correct 9 ms 5248 KB Output is correct
34 Correct 8 ms 5248 KB Output is correct
35 Correct 9 ms 5120 KB Output is correct
36 Correct 10 ms 5228 KB Output is correct
37 Correct 7 ms 5120 KB Output is correct
38 Correct 8 ms 5120 KB Output is correct
39 Correct 9 ms 5120 KB Output is correct
40 Correct 480 ms 11864 KB Output is correct
41 Correct 523 ms 12196 KB Output is correct
42 Correct 445 ms 11740 KB Output is correct
43 Correct 662 ms 11664 KB Output is correct
44 Correct 441 ms 11744 KB Output is correct
45 Correct 771 ms 11488 KB Output is correct
46 Correct 476 ms 11904 KB Output is correct
47 Correct 83 ms 11896 KB Output is correct
48 Correct 63 ms 11256 KB Output is correct
49 Correct 66 ms 9592 KB Output is correct
50 Correct 56 ms 8440 KB Output is correct
51 Correct 59 ms 9464 KB Output is correct
52 Correct 1904 ms 12280 KB Output is correct
53 Correct 1702 ms 11896 KB Output is correct
54 Correct 3807 ms 14584 KB Output is correct
55 Correct 1776 ms 14276 KB Output is correct
56 Correct 2850 ms 13856 KB Output is correct
57 Correct 3403 ms 13928 KB Output is correct
58 Correct 1704 ms 14124 KB Output is correct
59 Correct 70 ms 12152 KB Output is correct