oj.uz

Submission #342241

# Submission time Handle Problem Language Result Execution time Memory
342241 2021-01-01T16:35:46 Z VodkaInTheJar Fortune Telling 2 (JOI14_fortune_telling2) C++14
4 / 100
 3000 ms 11276 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define endl '\n'

using namespace std;

const int maxn = 2e5 + 3; 

int n, k; 
pair <int, int> a[maxn];
int t[maxn];
void read()
{
	cin >> n >> k;
	for (int i = 1; i <= n; i++)
	cin >> a[i].first >> a[i].second;
	
	for (int i = 1; i <= k; i++)
	cin >> t[i];
}

int tr[maxn * 8];
void merge(int v)
{
	tr[v] = max(tr[v * 2], tr[v * 2 + 1]);
}

void update(int v, int l, int r, int pos, int val)
{
	if (l == r)
	{
		tr[v] = max(tr[v], val);
		return;
	}
	
	int mid = (l + r) / 2;
	if (pos <= mid)
	update(v * 2, l, mid, pos, val);
	
	else 
	update(v * 2 + 1, mid + 1, r, pos, val);
	
	merge(v);
}

int get(int v, int l, int r, int ll, int rr)
{
	if (l > rr || r < ll || ll > rr)
	return 0;
	
	if (l >= ll && r <= rr)
	return tr[v];
	
	int mid = (l + r) / 2;
	return max(get(v * 2, l, mid, ll, rr), get(v * 2 + 1, mid + 1, r, ll, rr));
}

int fenw[maxn * 2];
void update_fenw(int pos)
{
	for (; pos <= 2 * n + 1; pos += pos & -pos)
	fenw[pos]++; 
}

int get_pr(int pos)
{
	int ans = 0;
	for (; pos >= 1; pos -= pos & -pos)
	ans += fenw[pos];
	
	return ans;
}

vector <int> v;
vector <int> queries[maxn * 2];
int id[maxn];
void solve()
{
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= k; j++)
		if (t[j] >= min(a[i].first, a[i].second) && t[j] < max(a[i].first, a[i].second))
		id[i] = j;
		
		v.push_back(a[i].first);
		v.push_back(a[i].second);
	}
	
	sort (v.begin(), v.end());
	
	for (int i = 1; i <= k; i++)
	{
		int pos = lower_bound(v.begin(), v.end(), t[i]) - v.begin();
		if (pos != 2 * n && v[pos] == t[i])
		t[i] = pos + 1;
	
		else 
		t[i] = pos;  
		
	    update(1, 1, 2 * n, t[i], i);
	}
	
	for (int i = 1; i <= n; i++)
	{
		int f = lower_bound(v.begin(), v.end(), a[i].first) - v.begin() + 1, s = lower_bound(v.begin(), v.end(), a[i].second) - v.begin() + 1;
		queries[get(1, 1, 2 * n, min(f, s), max(f, s) - 1)].push_back(i);
	}
	
	long long ans = 0;
	for (int i = k; i >= 0; i--)
	{
		for (auto j: queries[i])
		{
			int curr_pos = lower_bound(v.begin(), v.end(), max(a[j].first, a[j].second)) - v.begin() + 2; 
			int cnt = k - i - get_pr(curr_pos - 1);
			
			if (i == 0)
			ans += (cnt & 1) ? (long long)a[j].second : (long long)a[j].first;
			
			else 
			ans += (cnt & 1) ? (long long)min(a[j].first, a[j].second) : (long long)max(a[j].first, a[j].second);
		}
		
		if (i != 0)
		update_fenw(t[i] + 1);
	}
	
	cout << ans << endl; 
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);

	read();
	solve();
}

Subtask #1
4.0 / 4.0

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

Subtask #2
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9708 KB Output is correct
2 Correct 10 ms 9836 KB Output is correct
3 Correct 13 ms 9836 KB Output is correct
4 Correct 13 ms 9836 KB Output is correct
5 Correct 13 ms 9836 KB Output is correct
6 Correct 13 ms 9836 KB Output is correct
7 Correct 11 ms 9836 KB Output is correct
8 Correct 10 ms 9836 KB Output is correct
9 Correct 9 ms 9836 KB Output is correct
10 Correct 10 ms 9836 KB Output is correct
11 Correct 11 ms 9836 KB Output is correct
12 Correct 12 ms 9836 KB Output is correct
13 Correct 11 ms 9836 KB Output is correct
14 Correct 582 ms 10628 KB Output is correct
15 Correct 2231 ms 11276 KB Output is correct
16 Execution timed out 3075 ms 10908 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #3
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9708 KB Output is correct
2 Correct 10 ms 9836 KB Output is correct
3 Correct 13 ms 9836 KB Output is correct
4 Correct 13 ms 9836 KB Output is correct
5 Correct 13 ms 9836 KB Output is correct
6 Correct 13 ms 9836 KB Output is correct
7 Correct 11 ms 9836 KB Output is correct
8 Correct 10 ms 9836 KB Output is correct
9 Correct 9 ms 9836 KB Output is correct
10 Correct 10 ms 9836 KB Output is correct
11 Correct 11 ms 9836 KB Output is correct
12 Correct 12 ms 9836 KB Output is correct
13 Correct 11 ms 9836 KB Output is correct
14 Correct 582 ms 10628 KB Output is correct
15 Correct 2231 ms 11276 KB Output is correct
16 Execution timed out 3075 ms 10908 KB Time limit exceeded
17 Halted 0 ms 0 KB -