oj.uz

Submission #756892

# Submission time Handle Problem Language Result Execution time Memory
756892 2023-06-12T11:07:04 Z SanguineChameleon Fish (IOI08_fish) C++17
80 / 100
 3000 ms 26716 KB 
#include <bits/stdc++.h>
using namespace std;

void just_do_it();

int main() {
	#ifdef KAMIRULEZ
		freopen("kamirulez.inp", "r", stdin);
		freopen("kamirulez.out", "w", stdout);
	#endif
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	just_do_it();
	return 0;
}

const int maxn = 5e5 + 20;
pair<int, int> a[maxn];
vector<int> pos[maxn];
int cnt[maxn];
int tree[maxn];
int id[maxn];
int max_id[maxn];
int mod;

void build(int id, int lt, int rt) {
	for (int i = lt; i <= rt; i++) {
		tree[i] = cnt[i] % mod;
	}
}

void update(int id, int lt, int rt, int pos, int val) {
	tree[pos] = val % mod;
}

int get(int id, int lt, int rt, int ql, int qr) {
	if (ql > qr) {
		return 1;
	}
	int res = 1;
	for (int i = ql; i <= qr; i++) {
		res = res * tree[i] % mod;
	}
	return res;
}

void just_do_it() {
	int n, k;
	cin >> n >> k >> mod;
	for (int i = 1; i <= n; i++) {
		cin >> a[i].first >> a[i].second;
	}
	sort(a + 1, a + n + 1);
	k = 0;
	for (int i = n; i >= 1; i--) {
		if (!id[a[i].second]) {
			id[a[i].second] = ++k;
		}
		a[i].second = id[a[i].second];
	}
	for (int i = 1; i <= n; i++) {
		cnt[a[i].second]++;
		pos[a[i].second].push_back(i);
	}
	for (int i = 1; i <= k; i++) {
		cnt[i]++;
	}
	for (int i = n; i >= 1; i--) {
		max_id[i] = max(max_id[i + 1], a[i].second);
	}
	build(1, 1, k);
	int lt = n;
	int res = 0;
	for (int i = n; i >= 1; i--) {
		while (lt > 0 && a[lt].first * 2 > a[i].first) {
			cnt[a[lt].second]--;
			update(1, 1, k, a[lt].second, cnt[a[lt].second]);
			lt--;
		}
		if (max_id[i] != max_id[i + 1]) {
			int x = max_id[i];
			res += (cnt[x] - 1) % mod * get(1, 1, k, x + 1, k) % mod;
			res %= mod;
			int low = max_id[lower_bound(a + 1, a + n + 1, make_pair(a[pos[x][cnt[x] - 1]].first * 2, -1)) - a] + 1;
			res += get(1, 1, k, low, x - 1) * get(1, 1, k, x + 1, k) % mod;
			res %= mod;
		}
	}
	cout << res;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 11988 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 11988 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 12100 KB Output is correct

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 11988 KB Output is correct

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 12116 KB Output is correct
2 Correct 8 ms 12116 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 12124 KB Output is correct
2 Correct 132 ms 20428 KB Output is correct

Subtask #7
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 12116 KB Output is correct

Subtask #8
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 12116 KB Output is correct

Subtask #9
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 15680 KB Output is correct
2 Correct 80 ms 16404 KB Output is correct

Subtask #10
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 12236 KB Output is correct
2 Correct 18 ms 12244 KB Output is correct
3 Correct 26 ms 12116 KB Output is correct

Subtask #11
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 17748 KB Output is correct
2 Correct 207 ms 20428 KB Output is correct
3 Correct 195 ms 22028 KB Output is correct

Subtask #12
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 158 ms 20712 KB Output is correct
2 Correct 200 ms 21164 KB Output is correct

Subtask #13
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 195 ms 17728 KB Output is correct
2 Correct 508 ms 20668 KB Output is correct

Subtask #14
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1111 ms 20412 KB Output is correct

Subtask #15
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2678 ms 21604 KB Output is correct

Subtask #16
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3053 ms 19672 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #17
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3042 ms 24288 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3056 ms 25108 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3048 ms 26716 KB Time limit exceeded
2 Halted 0 ms 0 KB -