oj.uz

Submission #103984

# Submission time Handle Problem Language Result Execution time Memory
103984 2019-04-03T13:53:08 Z igba Fortune Telling 2 (JOI14_fortune_telling2) C++17
4 / 100
 3000 ms 40012 KB 
#include <bits/stdc++.h>

using namespace std;
const int MAXN = 2 * 100100, MAXK = 2 * 100100, MAXA = 1e9 + 1e4;
int n, k, a[MAXN], b[MAXN], t[MAXK];
long long ans = 0;

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

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

int get(no* n, int pos, int beg = 1, int end = MAXA)
{
	if(!n)
		return 0;
	int mid = (beg + end) >> 1;
	if(pos <= mid)
		return get(n->l, pos, beg, mid) + getcnt(n->r);
	return get(n->r, pos, mid + 1, end);
}

no* pseg[MAXK];

int main()
{
	pseg[0] = nullptr;
	scanf("%d %d", &n, &k);
	for(int i = 1; i <= n; ++i)
		scanf("%d %d", &a[i], &b[i]);
	for(int i = 1; i <= k; ++i)
		scanf("%d", &t[i]), pseg[i] = upd(pseg[i - 1], t[i]);
	for(int i = 1, swaps, j; i <= n; ++i)
	{
		for(j = k, swaps = 0; j >= 1; --j)
			if(min(a[i], b[i]) <= t[j] && t[j] < max(a[i], b[i]))
			{
				swaps += (a[i] < b[i]);
				break;
			}
		swaps += get(pseg[k], max(a[i], b[i]) - 1) - get(pseg[j], max(a[i], b[i]) - 1);
		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:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &t[i]), pseg[i] = upd(pseg[i - 1], t[i]);
   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

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

Subtask #2
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1280 KB Output is correct
2 Correct 4 ms 1280 KB Output is correct
3 Correct 5 ms 1280 KB Output is correct
4 Correct 4 ms 1280 KB Output is correct
5 Correct 5 ms 1280 KB Output is correct
6 Correct 4 ms 1408 KB Output is correct
7 Correct 5 ms 1408 KB Output is correct
8 Correct 4 ms 1408 KB Output is correct
9 Correct 5 ms 1280 KB Output is correct
10 Correct 4 ms 1408 KB Output is correct
11 Correct 6 ms 1408 KB Output is correct
12 Correct 5 ms 1408 KB Output is correct
13 Correct 6 ms 1280 KB Output is correct
14 Correct 30 ms 10232 KB Output is correct
15 Correct 62 ms 20148 KB Output is correct
16 Correct 91 ms 29948 KB Output is correct
17 Correct 131 ms 40012 KB Output is correct
18 Correct 153 ms 39928 KB Output is correct
19 Correct 168 ms 39828 KB Output is correct
20 Correct 165 ms 39908 KB Output is correct
21 Correct 148 ms 39928 KB Output is correct
22 Correct 141 ms 39928 KB Output is correct
23 Correct 136 ms 39800 KB Output is correct
24 Correct 116 ms 39892 KB Output is correct
25 Correct 113 ms 39928 KB Output is correct
26 Correct 2383 ms 39964 KB Output is correct
27 Correct 2891 ms 39996 KB Output is correct
28 Correct 2391 ms 39852 KB Output is correct
29 Execution timed out 3104 ms 39928 KB Time limit exceeded

Subtask #3
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1280 KB Output is correct
2 Correct 4 ms 1280 KB Output is correct
3 Correct 5 ms 1280 KB Output is correct
4 Correct 4 ms 1280 KB Output is correct
5 Correct 5 ms 1280 KB Output is correct
6 Correct 4 ms 1408 KB Output is correct
7 Correct 5 ms 1408 KB Output is correct
8 Correct 4 ms 1408 KB Output is correct
9 Correct 5 ms 1280 KB Output is correct
10 Correct 4 ms 1408 KB Output is correct
11 Correct 6 ms 1408 KB Output is correct
12 Correct 5 ms 1408 KB Output is correct
13 Correct 6 ms 1280 KB Output is correct
14 Correct 30 ms 10232 KB Output is correct
15 Correct 62 ms 20148 KB Output is correct
16 Correct 91 ms 29948 KB Output is correct
17 Correct 131 ms 40012 KB Output is correct
18 Correct 153 ms 39928 KB Output is correct
19 Correct 168 ms 39828 KB Output is correct
20 Correct 165 ms 39908 KB Output is correct
21 Correct 148 ms 39928 KB Output is correct
22 Correct 141 ms 39928 KB Output is correct
23 Correct 136 ms 39800 KB Output is correct
24 Correct 116 ms 39892 KB Output is correct
25 Correct 113 ms 39928 KB Output is correct
26 Correct 2383 ms 39964 KB Output is correct
27 Correct 2891 ms 39996 KB Output is correct
28 Correct 2391 ms 39852 KB Output is correct
29 Execution timed out 3104 ms 39928 KB Time limit exceeded