oj.uz

Submission #104026

# Submission time Handle Problem Language Result Execution time Memory
104026 2019-04-03T18:42:38 Z igba Fortune Telling 2 (JOI14_fortune_telling2) C++17
35 / 100
 771 ms 263168 KB 
#include <bits/stdc++.h>
 
using namespace std;
const int MAXN = 2 * 100100, MAXK = 2 * 100100, MAXA = 1e9 + 1e2;
int n, k, a[MAXN], b[MAXN];
long long ans = 0;

struct no
{
	int v;
	no *l, *r;
	no(int v = 0) : v(v), l(nullptr), r(nullptr)
	{}
};
inline int getv(no *n) { return (n ? n->v : 0); }

no *upd(no *n, int (*joinFunc)(int, int), int pos, int val = 1, int beg = 1, int end = MAXA)
{
	if(beg == end)
		return new no(joinFunc(getv(n), val));
	no *ans = (n ? new no(*n) : new no());
	int mid = (beg + end) >> 1;
	if(pos <= mid)
		ans->l = upd(ans->l, joinFunc, pos, val, beg, mid);
	else
		ans->r = upd(ans->r, joinFunc, pos, val, mid + 1, end);
	ans->v = joinFunc(getv(ans->l), getv(ans->r));
	return ans;
}

int get(no* n, int (*joinFunc)(int, int), int a, int b, int beg = 1, int end = MAXA)
{
	if(!n || b < beg || end < a)
		return 0;
	if(a <= beg && end <= b)
		return getv(n);
	int mid = (beg + end) >> 1;
	return joinFunc(get(n->l, joinFunc, a, b, beg, mid), get(n->r, joinFunc, a, b, mid + 1, end));
}

no *pseg[MAXK], *seg;
 
int main()
{
	pseg[0] = seg = nullptr;
	scanf("%d %d", &n, &k);
	for(int i = 1; i <= n; ++i)
		scanf("%d %d", &a[i], &b[i]);
	for(int i = 1, t; i <= k; ++i)
		scanf("%d", &t), pseg[i] = upd(pseg[i - 1], [](int x, int y){ return x + y; }, t), seg = upd(seg, [](int x, int y){ return max(x, y); }, t, i);
	for(int i = 1, swaps, j; i <= n; ++i)
	{
		j = get(seg, [](int x, int y){ return max(x, y); }, min(a[i], b[i]), max(a[i], b[i]) - 1), swaps = 0;
		if(j)
			swaps += (a[i] < b[i]);
		swaps += get(pseg[k], [](int x, int y){ return x + y; }, max(a[i], b[i]) - 1, MAXA) - get(pseg[j], [](int x, int y){ return x + y; }, max(a[i], b[i]) - 1, MAXA);
		ans += (swaps % 2 ? b[i] : a[i]);
	}
	printf("%lld\n", ans);
}

Compilation message

fortune_telling2.cpp: In function 'int main()':
fortune_telling2.cpp:46:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &k);
  ~~~~~^~~~~~~~~~~~~~~~~
fortune_telling2.cpp:48:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &a[i], &b[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~
fortune_telling2.cpp:50:84: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &t), pseg[i] = upd(pseg[i - 1], [](int x, int y){ return x + y; }, t), seg = upd(seg, [](int x, int y){ return max(x, y); }, t, i);
   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 2304 KB Output is correct
2 Correct 8 ms 2304 KB Output is correct
3 Correct 7 ms 2304 KB Output is correct
4 Correct 7 ms 2176 KB Output is correct
5 Correct 7 ms 2304 KB Output is correct
6 Correct 7 ms 2304 KB Output is correct
7 Correct 9 ms 2304 KB Output is correct
8 Correct 7 ms 2304 KB Output is correct
9 Correct 8 ms 2260 KB Output is correct
10 Correct 8 ms 2432 KB Output is correct
11 Correct 8 ms 2276 KB Output is correct
12 Correct 9 ms 2304 KB Output is correct
13 Correct 8 ms 2304 KB Output is correct

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 2304 KB Output is correct
2 Correct 8 ms 2304 KB Output is correct
3 Correct 7 ms 2304 KB Output is correct
4 Correct 7 ms 2176 KB Output is correct
5 Correct 7 ms 2304 KB Output is correct
6 Correct 7 ms 2304 KB Output is correct
7 Correct 9 ms 2304 KB Output is correct
8 Correct 7 ms 2304 KB Output is correct
9 Correct 8 ms 2260 KB Output is correct
10 Correct 8 ms 2432 KB Output is correct
11 Correct 8 ms 2276 KB Output is correct
12 Correct 9 ms 2304 KB Output is correct
13 Correct 8 ms 2304 KB Output is correct
14 Correct 70 ms 19896 KB Output is correct
15 Correct 179 ms 39392 KB Output is correct
16 Correct 232 ms 58980 KB Output is correct
17 Correct 337 ms 78456 KB Output is correct
18 Correct 312 ms 78584 KB Output is correct
19 Correct 357 ms 78576 KB Output is correct
20 Correct 376 ms 78456 KB Output is correct
21 Correct 298 ms 78368 KB Output is correct
22 Correct 245 ms 78456 KB Output is correct
23 Correct 289 ms 78452 KB Output is correct
24 Correct 264 ms 78544 KB Output is correct
25 Correct 268 ms 78584 KB Output is correct
26 Correct 295 ms 78456 KB Output is correct
27 Correct 293 ms 78608 KB Output is correct
28 Correct 289 ms 78584 KB Output is correct
29 Correct 308 ms 78456 KB Output is correct

Subtask #3
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 2304 KB Output is correct
2 Correct 8 ms 2304 KB Output is correct
3 Correct 7 ms 2304 KB Output is correct
4 Correct 7 ms 2176 KB Output is correct
5 Correct 7 ms 2304 KB Output is correct
6 Correct 7 ms 2304 KB Output is correct
7 Correct 9 ms 2304 KB Output is correct
8 Correct 7 ms 2304 KB Output is correct
9 Correct 8 ms 2260 KB Output is correct
10 Correct 8 ms 2432 KB Output is correct
11 Correct 8 ms 2276 KB Output is correct
12 Correct 9 ms 2304 KB Output is correct
13 Correct 8 ms 2304 KB Output is correct
14 Correct 70 ms 19896 KB Output is correct
15 Correct 179 ms 39392 KB Output is correct
16 Correct 232 ms 58980 KB Output is correct
17 Correct 337 ms 78456 KB Output is correct
18 Correct 312 ms 78584 KB Output is correct
19 Correct 357 ms 78576 KB Output is correct
20 Correct 376 ms 78456 KB Output is correct
21 Correct 298 ms 78368 KB Output is correct
22 Correct 245 ms 78456 KB Output is correct
23 Correct 289 ms 78452 KB Output is correct
24 Correct 264 ms 78544 KB Output is correct
25 Correct 268 ms 78584 KB Output is correct
26 Correct 295 ms 78456 KB Output is correct
27 Correct 293 ms 78608 KB Output is correct
28 Correct 289 ms 78584 KB Output is correct
29 Correct 308 ms 78456 KB Output is correct
30 Runtime error 771 ms 263168 KB Execution killed with signal 9 (could be triggered by violating memory limits)
31 Halted 0 ms 0 KB -