oj.uz

Submission #476948

# Submission time Handle Problem Language Result Execution time Memory
476948 2021-09-29T09:41:18 Z MetalPower Diversity (CEOI21_diversity) C++14
4 / 100
 23 ms 1352 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pii pair<int, int>
#define fi first
#define se second

const int MX = 3e5 + 10;
const int SQ = 605;

struct queries{
	int l, r, id;

	bool operator < (queries& b) const{
		int _a = l / SQ, _b = b.l / SQ;
		return (_a < _b) || (_a == _b && r < b.r);
	}
};

vector<queries> q;

int N, Q, arr[MX];
int cnt[MX]; // number of values with freq i
int freq[MX];

ll ans[MX];

void upd(int p, int v){
	if(freq[p] < SQ) cnt[freq[p]]--;
	freq[p] += v;
	if(freq[p] < SQ) cnt[freq[p]]++;
}

vector<int> lg;
vector<pii> val;

void init(){

	val.clear();

	for(int j = 1; j < SQ; j++)
		val.push_back({j, cnt[j]});

	vector<int> temp;

	for(auto j : lg){
		if(freq[j] >= SQ){
			cnt[freq[j]]++;
			temp.push_back(freq[j]);
		}
	}

	sort(temp.begin(), temp.end());
	temp.resize(unique(temp.begin(), temp.end()) - temp.begin());

	for(auto j : temp){
		val.push_back({j, cnt[j]});
		cnt[j] = 0;
	}
}

ll sum(int a, int r, int n){ // a^2 + (a + r)^2 + (a + 2r)^2 + ... (a + nr)^2
	if(n < 0) return 0;
	return 1ll * a * a * (n + 1) + a * r * n * (n + 1) + r * r * (n * (n + 1) * (n + n + 1) / 6);
}

ll solve(){

	int st = 1, _N = 0, _K = 0;
	int suml = 0, sumr = 0; 

	ll curr = 0;

	for(auto p : val){
		_N += p.fi * p.se;
		_K += p.se;
	}

	for(auto p : val){

		int l = (p.se + st) >> 1;
		int r = (p.se + 1 - st) >> 1;

		curr += sum(suml, p.fi, l - 1);
		curr += sum(_N - suml - p.fi, -p.fi, l - 1);

		curr += sum(sumr, p.fi, r - 1);
		curr += sum(_N - sumr - p.fi, -p.fi, r - 1);

		suml += p.fi * l;
		sumr += p.fi * r;

		st ^= p.se & 1;
	}

	return (_K * _N * (_N + 1) - _N * (_K - 1) - curr) >> 1;
}

void answer(){

	int l = 0, r = -1;

	for(auto p : q){
		while(r < p.r) upd(arr[++r], 1);
		while(r > p.r) upd(arr[r--], -1);
		while(l < p.l) upd(arr[l++], -1);
		while(l > p.l) upd(arr[--l], 1);
		init();
		ans[p.id] = solve();
	}
}

int tfreq[MX];

int main(){
	scanf("%d %d", &N, &Q);

	vector<int> cd;

	for(int i = 0; i < N; i++){
		cin >> arr[i];
		cd.push_back(arr[i]);
	}

	sort(cd.begin(), cd.end());
	cd.resize(unique(cd.begin(), cd.end()) - cd.begin());

	for(int i = 0; i < N; i++){
		arr[i] = lower_bound(cd.begin(), cd.end(), arr[i]) - cd.begin();
		tfreq[arr[i]]++;
	}

	for(int i = 0; i < N; i++){
		if(tfreq[i] >= SQ) 
			lg.push_back(i);
	}

	for(int i = 0; i < Q; i++){
		int l, r; cin >> l >> r;
		l--; r--;
		q.push_back({l, r, i});
	}

	sort(q.begin(), q.end());

	answer();

	for(int i = 0; i < Q; i++)
		cout << ans[i] << '\n';
}

Compilation message

diversity.cpp: In function 'int main()':
diversity.cpp:117:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  117 |  scanf("%d %d", &N, &Q);
      |  ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 3 ms 460 KB Output is correct
4 Incorrect 23 ms 1352 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 3 ms 460 KB Output is correct
4 Incorrect 23 ms 1352 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 3 ms 460 KB Output is correct
4 Incorrect 23 ms 1352 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 3 ms 460 KB Output is correct
14 Incorrect 23 ms 1352 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #6
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 3 ms 460 KB Output is correct
14 Incorrect 23 ms 1352 KB Output isn't correct
15 Halted 0 ms 0 KB -