oj.uz

Submission #756878

# Submission time Handle Problem Language Result Execution time Memory
756878 2023-06-12T10:58:50 Z SanguineChameleon Fish (IOI08_fish) C++17
73 / 100
 3000 ms 33904 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 id[maxn];
int max_id[maxn];
int mod;

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 = n; i >= 1; i--) {
		max_id[i] = max(max_id[i + 1], a[i].second);
	}
	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]--;
			lt--;
		}
		if (max_id[i] != max_id[i + 1]) {
			int x = max_id[i];
			int prod = cnt[x];
			for (int j = x; j <= k; j++) {
				if (j != x) {
					prod = prod * (cnt[j] + 1) % mod;
				}
			}
			res += prod;
			res %= mod;
			int low = max_id[lower_bound(a + 1, a + n + 1, make_pair(a[pos[x][cnt[x]]].first * 2, -1)) - a] + 1;
			prod = 1;
			for (int j = low; j <= k; j++) {
				if (j != x) {
					prod = prod * (cnt[j] + 1) % mod;
				}
			}
			res += prod;
			res %= mod;
		}
	}
	cout << res;
}

Subtask #1
4.0 / 4.0

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

Subtask #2
4.0 / 4.0

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

Subtask #3
4.0 / 4.0

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

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 6 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 7 ms 12092 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12092 KB Output is correct
2 Correct 151 ms 26500 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 8 ms 12136 KB Output is correct

Subtask #9
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 18100 KB Output is correct
2 Correct 75 ms 19600 KB Output is correct

Subtask #10
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 12220 KB Output is correct
2 Correct 16 ms 12228 KB Output is correct
3 Correct 26 ms 12264 KB Output is correct

Subtask #11
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 21588 KB Output is correct
2 Incorrect 196 ms 27176 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #12
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 145 ms 26824 KB Output is correct
2 Correct 232 ms 28028 KB Output is correct

Subtask #13
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 192 ms 21908 KB Output is correct
2 Correct 496 ms 27644 KB Output is correct

Subtask #14
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1046 ms 26764 KB Output is correct

Subtask #15
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2440 ms 28904 KB Output is correct

Subtask #16
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3036 ms 25616 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 3021 ms 30856 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 3016 ms 29768 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 3051 ms 33904 KB Time limit exceeded
2 Halted 0 ms 0 KB -