oj.uz

Submission #576881

# Submission time Handle Problem Language Result Execution time Memory
576881 2022-06-13T17:04:12 Z amunduzbaev L-triominoes (CEOI21_ltriominoes) C++17
0 / 100
 19 ms 11104 KB 
#include "bits/stdc++.h"
using namespace std;
 
#define ar array
typedef int64_t ll;

const int N = 3e5 + 5;
const int Q = 5e4 + 5;
const int B = 1400;
int a[N], l[Q], r[Q];
int cnt[N], mm[N];
ll res[Q], dp[N];
 
signed main(){
	ios::sync_with_stdio(0); cin.tie(0);
	
	int n, q; cin>>n>>q;
	vector<int> p;
	for(int i=0;i<n;i++){
		cin>>a[i];
	}
	for(int i=1;i<N;i++){
		dp[i] = dp[i-1] + (i * 1ll * (i - 1) / 2);
	}
	for(int i=0;i<q;i++){
		cin>>l[i]>>r[i];
		l[i]--;
		p.push_back(i);
	}
	sort(p.begin(), p.end(), [&](int i, int j){
		if(l[i] / B != l[j] / B){
			return l[i] < l[j];
		} 
		return r[i] < r[j];
	});
	
	set<int> ss;
	auto add = [&](int i){
		if(cnt[a[i]]){
			mm[cnt[a[i]]]--;
			if(!mm[cnt[a[i]]]) ss.erase(cnt[a[i]]);
		} 
		cnt[a[i]]++;
		if(!mm[cnt[a[i]]]) ss.insert(cnt[a[i]]);
		mm[cnt[a[i]]]++;
	};
	auto del = [&](int i){
		//~ assert(cnt[a[i]]);
		mm[cnt[a[i]]]--;
		if(!mm[cnt[a[i]]]) ss.erase(cnt[a[i]]);
		cnt[a[i]]--;
		if(cnt[a[i]]){
			if(!mm[cnt[a[i]]]) ss.insert(cnt[a[i]]);
			mm[cnt[a[i]]]++;
		}
	};
	
	int lx = 0, rx = 0;
	for(auto i : p){
		if(rx > r[i]){ 
			ss.clear();
			lx = rx = l[i];
			memset(cnt, 0, sizeof cnt);
			memset(mm, 0, sizeof mm);
		}
		while(rx < r[i]){
			add(rx++);
		}
		while(lx > l[i]){
			add(--lx);
		}
		while(lx < l[i]){
			del(lx++);
		}
		
		int ls = 0, rs = 0;
		vector<ar<ll, 2>> L, R;
		for(auto v : ss){
			int c = mm[v];
			int b = (c + 1) / 2, s = c / 2;
			if(ls > rs) swap(b, s);
			if(b) L.push_back({v, b}), ls += b;
			if(s) R.push_back({v, s}), rs += s;
		}
		reverse(R.begin(), R.end());
		L.insert(L.end(), R.begin(), R.end());
		ll sum = 0, sumj = 0, p = 0;
		for(auto [v, c] : L){
			ll C = p * c + c * (c - 1) / 2;
			res[i] = res[i] + v * C * sum - v * c * sumj;
			res[i] += dp[c] * v * v;
			sumj += v * C;
			sum += v * c;
			p += c;
		}
		
		res[i] += sum * (sum + 1) / 2;
	}
	
	for(int i=0;i<q;i++) cout<<res[i]<<"\n";
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Runtime error 19 ms 11080 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Runtime error 15 ms 11084 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Runtime error 15 ms 11104 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Runtime error 15 ms 11012 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

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