Submission #1195396

#	Time	Username	Problem	Language	Result	Execution time	Memory
1195396		shadow_sami	Diversity (CEOI21_diversity)	C++20	0 / 100	6 ms	12104 KiB

diversity

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"

// ==========================(debug)============================================================================================== //

#ifdef SAMI
	#define debug(x) cerr<<#x;cerr<<" ";_printn(x);cerr<<nli;
	#define debg() cerr<<nli;
#else
	#define debug(x)
	#define debg() 
#endif


void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };

// ==========================(debug)============================================================================================== //

ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 5e5+5;
const ll mxn = 1e3+5;
const ll mod = 1e9+7;

// ==========================(MOD)=============================================================================================== //

ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }

// ==========================(MOD)=============================================================================================== //

bool f = false;
ll a[mx];
set<ll>stt;
ll nas[mx];
ll to[mx];
ll sr,de;
ll st[mx];
vi v;
map<ll,ll> mp;
ll tnc[mx];
ll tnc2[mx];
ll l;
ll r;
const ll blk = 400;
vi qur[mx];

ll get(ll k){
	return ((k*(k+1))/2);
}

ll get2(ll k){
	return ((k*(k+1)*(2*k+1))/6);
}

void add(ll k){
	tnc2[tnc[a[k]]]--;
	if(tnc2[tnc[a[k]]]==0)
		stt.erase(stt.find(tnc[a[k]]));
	tnc[a[k]]++;
	if(tnc[a[k]]==1)
		cnt++;
	tnc2[tnc[a[k]]]++;
	if(tnc2[tnc[a[k]]]==1)
		stt.insert(tnc[a[k]]);
}

void remove(ll k){
	tnc2[tnc[a[k]]]--;
	if(tnc2[tnc[a[k]]]==0)
		stt.erase(stt.find(tnc[a[k]]));
	tnc[a[k]]--;
	if(tnc[a[k]]==0)
		cnt--;
	tnc2[tnc[a[k]]]++;	
	if(tnc2[tnc[a[k]]]==1)
		stt.insert(tnc[a[k]]);
}

vector<pi> lis;

ll calc(){
	res = 0;
	sum = 0;
	fx(lis){
		sum += (res*res) * x.ss;
		sum += (x.ff*x.ff) * get2(x.ss-1);
		sum += 2 * (res*x.ff) * get(x.ss-1);
		res += (x.ff*x.ss);
	}
	res = 0;
	reverse(lis.begin(),lis.end());
	fx(lis){
		sum += (res*res) * x.ss;
		sum += (x.ff*x.ff) * get2(x.ss-1);
		sum += 2 * (res*x.ff) * get(x.ss-1);
		res += (x.ff*x.ss);
	}
	return sum;
}

int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());	
    #ifdef SAMI
        freopen("input1.txt", "r", stdin);
        freopen("output1.txt", "w", stdout);
        freopen("error1.txt", "w", stderr);
    #endif // ONLINE_JUDGE

        cin>>n>>m;
        v.clear();
        stt.clear();
        fip(0,n){
        	cin>>a[i];        	
        	stt.insert(a[i]);
        }           
        fx(stt)             	
        	v.push_back(x);
        fip(0,n)
        	a[i] = lower_bound(v.begin(),v.end(),a[i]) - v.begin();                
        fip(0,m){
        	cin>>tp>>tp2;
        	st[i] = tp;
        	to[i] = tp2;
        	tp  /= blk;
        	qur[tp].push_back(i);
	    }
	    fip(0,n)
	    	sort(qur[i].begin(),qur[i].end(),[](const ll aa,const ll bb){
	    		return to[aa] < to[bb];
	    	});	    
	    fip(0,n+2){
        	tnc[i] = 0;
        	tnc2[i] = 0;
        }
        tnc2[0] = n+2;
	    l = 0;
	    r = 0;
	    cnt = 0;	    
	    stt.clear();
	    add(r);
	    fip(0,n){
	    	fx(qur[i]){	    		
	    		while(to[x] > r){
	    			r++;
	    			add(r);
	    		}
	    		while(to[x] < r){
	    			remove(r);
	    			r--;	    			
	    		}
	    		while(st[x] < l){
	    			l--;
	    			add(l);
	    		}
	    		while(st[x] > l){	    			
	    			remove(l);
	    			l++;
	    		}
	    		lis.clear();
	    		tptp = r-l+1;

	    		debug(tptp);
	    		debug(cnt);
	    		fx(stt)
	    			lis.push_back({x,tnc2[x]});
	    		debug(lis);
	    		nas[x] += cnt * (get(tptp) * 2);
	    		debug(nas[x]);
	    		nas[x] -= tptp * (cnt - 1);
	    		debug(nas[x]);
	    		nas[x] -= calc();
	    		debug(calc())
	    		nas[x] /= 2;
	    	}
	    }
	    fip(0,m)
	    	cout<<nas[i]<<nli;
        
    cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
    return 0;
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 10
• Subtask 3: 0 / 8
• Subtask 4: 0 / 16
• Subtask 5: 0 / 26
• Subtask 6: 0 / 36