oj.uz

답안 #881877

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
881877 2023-12-02T07:01:05 Z TAhmed33 Diversity (CEOI21_diversity) C++
0 / 100
 2 ms 2652 KB 
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize ("Ofast")
#pragma GCC target ("popcnt")
typedef long long ll;
const int MAXN = 3e5 + 25;
const int ORIGIN = 3e5;
int a[MAXN], n, q;
int freq[MAXN];
inline ll sq (ll x) {
	return (x * (x + 1)) >> 1ll;
}
int main () {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> q;
	for (int i = 1; i <= n; i++) cin >> a[i];
	for (int g = 1; g <= q; g++) {
		int l, r;
		cin >> l >> r;
		memset(freq, 0, sizeof(freq));
		for (int i = l; i <= r; i++) {
			freq[a[i]]++;
		}
		ll cur = 0;
		for (int i = 1; i <= ORIGIN; i++) {
			if (freq[i]) cur++;
			freq[i] += freq[i - 1];
		}
		ll ans = 0;
		for (int i = 1; i <= ORIGIN; i++) {
			if (freq[i] - freq[i - 1]) ans += sq(freq[i - 1]) + sq(r - l + 1 - freq[i]);
		}
		cout << (cur * sq(r - l + 1)) - ans << '\n';
	}
}

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Incorrect 1 ms 2652 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 2652 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 2652 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 2652 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Incorrect 1 ms 2652 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Incorrect 1 ms 2652 KB Output isn't correct
4 Halted 0 ms 0 KB -