oj.uz

Submission #963218

# Submission time Handle Problem Language Result Execution time Memory
963218 2024-04-14T18:31:13 Z fzyzzz_z Fish (IOI08_fish) C++17
0 / 100
 210 ms 15404 KB 
#include <bits/stdc++.h>
using namespace std; 

using ll = long long; 

const int N = 500005; 

int m; 

struct seg {
	vector<int> t; 
	seg(vector<int> f) { 
		t = vector<int>(2 * f.size()); 
		for (int i = 0; i < f.size(); ++i) t[i + f.size()] = f[i] + 1; 
		for (int i = f.size() - 1; i >= 1; --i) t[i] = ((ll)t[2 * i] * t[2 * i + 1]) % m; 
	} 
	void upd(int p, int v) {
		p += t.size() / 2; 
		t[p] += v;  
		t[p] = max(t[p], 1); 
		for (; p > 1; p /= 2) {
			t[p / 2] = ((ll)t[p] * t[p ^ 1]) % m;
		}
	}
};

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

	int n, k; 
	cin >> n >> k >> m; 

	vector<int> f(k, 0); 
	vector<pair<int, int>> a(n); 
	for (auto & [x, y]: a) {
		cin >> x >> y; 
		f[--y]++; 
	}
	seg s(f); 

	sort(a.begin(), a.end(), greater<pair<int, int>>()); 

	int ans = 0; 

	f = vector<int>(k, 0);
	for (int i = 0, j = 0; i < n; ++i) {
		if (f[a[i].second]) continue; 
		f[a[i].second] = 1; 

		while (a[j].first * 2 > a[i].first && j < n) {
			s.upd(a[j].second, -1); 
			j++; 
		}
		if (i != 0) s.upd(a[j].second, -n); 
		ans += s.t[1]; 
		if (i > 0) s.upd(a[j].second, -n);
		ans %= m; 
	}

	cout << ans << '\n'; 

	return 0; 
}

Compilation message

fish.cpp: In constructor 'seg::seg(std::vector<int>)':
fish.cpp:14:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |   for (int i = 0; i < f.size(); ++i) t[i + f.size()] = f[i] + 1;
      |                   ~~^~~~~~~~~~

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 4.0

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

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 105 ms 10324 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 47 ms 4436 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Incorrect 2 ms 548 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #11
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 70 ms 6764 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #12
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 121 ms 10380 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #13
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 85 ms 6996 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #14
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 117 ms 10288 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #15
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 149 ms 11852 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #16
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 139 ms 10392 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #17
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 191 ms 13436 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 177 ms 11348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 210 ms 15404 KB Output isn't correct
2 Halted 0 ms 0 KB -