oj.uz

Submission #95869

# Submission time Handle Problem Language Result Execution time Memory
95869 2019-02-03T09:15:52 Z diamond_duke Arranging Tickets (JOI17_arranging_tickets) C++11
100 / 100
 3123 ms 14548 KB 
#include <algorithm>
#include <cstdio>
#include <queue>
using ll = long long;
int lp[200005], rp[200005], w[200005], rem[200005], n, m;
ll lazy[200005], nxt[200005];
std::vector<int> vec[200005];
struct comp { bool operator ()(int x, int y) { return rp[x] < rp[y]; } };
inline bool check(int com, ll cnt, ll lim)
{
	if (cnt > lim)
		return false;
	for (int i = 0; i < n; i++)
	{
		vec[i].clear();
		nxt[i] = 0;
	}
	for (int i = 0; i < m; i++)
	{
		if (lp[i] <= com && com < 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 <= com; i++)
	{
		for (int x : vec[i])
			que.push(x);
		ll cur = std::max<ll>(0, lazy[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;
			nxt[lp[x]] -= sub;
			nxt[rp[x]] += sub << 1;
			if (rem[x])
				que.push(x);
		}
		if (cur)
			return false;
	}
	for (int i = 0; i < n; i++)
	{
		if (i)
			nxt[i] += nxt[i - 1];
		if (nxt[i] + lazy[i] > lim)
			return false;
	}
	return true;
}
int main()
{
	// freopen("loj-2393.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]);
		lazy[lp[i]] += w[i];
		lazy[rp[i]] -= w[i];
	}
	int fst = 0, lst = 0;
	for (int i = 1; i < n; i++)
	{
		lazy[i] += lazy[i - 1];
		if (lazy[i] > lazy[fst])
			fst = i;
		if (lazy[i] == lazy[fst])
			lst = i;
	}
	ll l = 0, r = lazy[fst], res = -1;
	while (l <= r)
	{
		ll x = l + r >> 1;
		if (check(fst, lazy[fst] - x, x) || check(fst, lazy[fst] - x + 1, x) ||
				check(lst, lazy[lst] - x, x) || check(lst, lazy[lst] - x + 1, x))
		{
			res = x;
			r = x - 1;
		}
		else
			l = x + 1;
	}
	printf("%lld\n", res);
	return 0;
}

Compilation message

arranging_tickets.cpp: In function 'int main()':
arranging_tickets.cpp:60: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:63: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 6 ms 5216 KB Output is correct
2 Correct 5 ms 4984 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 6 ms 4984 KB Output is correct
6 Correct 6 ms 5240 KB Output is correct
7 Correct 6 ms 5112 KB Output is correct
8 Correct 6 ms 4984 KB Output is correct
9 Correct 6 ms 5112 KB Output is correct
10 Correct 6 ms 5112 KB Output is correct
11 Correct 5 ms 5112 KB Output is correct
12 Correct 5 ms 5112 KB Output is correct
13 Correct 5 ms 4984 KB Output is correct
14 Correct 5 ms 5112 KB Output is correct
15 Correct 6 ms 5084 KB Output is correct

Subtask #2
35.0 / 35.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5216 KB Output is correct
2 Correct 5 ms 4984 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 6 ms 4984 KB Output is correct
6 Correct 6 ms 5240 KB Output is correct
7 Correct 6 ms 5112 KB Output is correct
8 Correct 6 ms 4984 KB Output is correct
9 Correct 6 ms 5112 KB Output is correct
10 Correct 6 ms 5112 KB Output is correct
11 Correct 5 ms 5112 KB Output is correct
12 Correct 5 ms 5112 KB Output is correct
13 Correct 5 ms 4984 KB Output is correct
14 Correct 5 ms 5112 KB Output is correct
15 Correct 6 ms 5084 KB Output is correct
16 Correct 6 ms 5112 KB Output is correct
17 Correct 6 ms 5112 KB Output is correct
18 Correct 6 ms 5088 KB Output is correct
19 Correct 5 ms 4984 KB Output is correct
20 Correct 6 ms 5112 KB Output is correct
21 Correct 6 ms 5112 KB Output is correct
22 Correct 5 ms 5240 KB Output is correct
23 Correct 5 ms 5112 KB Output is correct
24 Correct 5 ms 5116 KB Output is correct
25 Correct 5 ms 4984 KB Output is correct
26 Correct 5 ms 5112 KB Output is correct
27 Correct 5 ms 4984 KB Output is correct
28 Correct 7 ms 5240 KB Output is correct
29 Correct 8 ms 5240 KB Output is correct
30 Correct 8 ms 5240 KB Output is correct
31 Correct 7 ms 5240 KB Output is correct
32 Correct 9 ms 5240 KB Output is correct
33 Correct 9 ms 5240 KB Output is correct
34 Correct 7 ms 5240 KB Output is correct
35 Correct 8 ms 5212 KB Output is correct
36 Correct 9 ms 5240 KB Output is correct
37 Correct 7 ms 5240 KB Output is correct
38 Correct 7 ms 5140 KB Output is correct
39 Correct 7 ms 5112 KB Output is correct
40 Correct 283 ms 13292 KB Output is correct
41 Correct 425 ms 13644 KB Output is correct
42 Correct 302 ms 13056 KB Output is correct
43 Correct 504 ms 12980 KB Output is correct
44 Correct 281 ms 13192 KB Output is correct
45 Correct 646 ms 12864 KB Output is correct
46 Correct 301 ms 13092 KB Output is correct
47 Correct 67 ms 13304 KB Output is correct
48 Correct 58 ms 12664 KB Output is correct
49 Correct 53 ms 11000 KB Output is correct
50 Correct 42 ms 9848 KB Output is correct
51 Correct 52 ms 10680 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5216 KB Output is correct
2 Correct 5 ms 4984 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 6 ms 4984 KB Output is correct
6 Correct 6 ms 5240 KB Output is correct
7 Correct 6 ms 5112 KB Output is correct
8 Correct 6 ms 4984 KB Output is correct
9 Correct 6 ms 5112 KB Output is correct
10 Correct 6 ms 5112 KB Output is correct
11 Correct 5 ms 5112 KB Output is correct
12 Correct 5 ms 5112 KB Output is correct
13 Correct 5 ms 4984 KB Output is correct
14 Correct 5 ms 5112 KB Output is correct
15 Correct 6 ms 5084 KB Output is correct
16 Correct 6 ms 5112 KB Output is correct
17 Correct 6 ms 5112 KB Output is correct
18 Correct 6 ms 5088 KB Output is correct
19 Correct 5 ms 4984 KB Output is correct
20 Correct 6 ms 5112 KB Output is correct
21 Correct 6 ms 5112 KB Output is correct
22 Correct 5 ms 5240 KB Output is correct
23 Correct 5 ms 5112 KB Output is correct
24 Correct 5 ms 5116 KB Output is correct
25 Correct 5 ms 4984 KB Output is correct
26 Correct 5 ms 5112 KB Output is correct
27 Correct 5 ms 4984 KB Output is correct
28 Correct 7 ms 5240 KB Output is correct
29 Correct 8 ms 5240 KB Output is correct
30 Correct 8 ms 5240 KB Output is correct
31 Correct 7 ms 5240 KB Output is correct
32 Correct 9 ms 5240 KB Output is correct
33 Correct 9 ms 5240 KB Output is correct
34 Correct 7 ms 5240 KB Output is correct
35 Correct 8 ms 5212 KB Output is correct
36 Correct 9 ms 5240 KB Output is correct
37 Correct 7 ms 5240 KB Output is correct
38 Correct 7 ms 5140 KB Output is correct
39 Correct 7 ms 5112 KB Output is correct
40 Correct 283 ms 13292 KB Output is correct
41 Correct 425 ms 13644 KB Output is correct
42 Correct 302 ms 13056 KB Output is correct
43 Correct 504 ms 12980 KB Output is correct
44 Correct 281 ms 13192 KB Output is correct
45 Correct 646 ms 12864 KB Output is correct
46 Correct 301 ms 13092 KB Output is correct
47 Correct 67 ms 13304 KB Output is correct
48 Correct 58 ms 12664 KB Output is correct
49 Correct 53 ms 11000 KB Output is correct
50 Correct 42 ms 9848 KB Output is correct
51 Correct 52 ms 10680 KB Output is correct
52 Correct 1269 ms 14548 KB Output is correct
53 Correct 1222 ms 14072 KB Output is correct
54 Correct 2866 ms 14428 KB Output is correct
55 Correct 1000 ms 14120 KB Output is correct
56 Correct 2015 ms 13836 KB Output is correct
57 Correct 3123 ms 14000 KB Output is correct
58 Correct 1228 ms 14152 KB Output is correct
59 Correct 64 ms 12152 KB Output is correct