oj.uz

Submission #531676

# Submission time Handle Problem Language Result Execution time Memory
531676 2022-03-01T08:57:47 Z zaneyu Izbori (COCI22_izbori) C++14
110 / 110
 156 ms 15400 KB 
/*input
2
1 1
*/ 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
 
//#pragma GCC optimize("unroll-loops,no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
using ll = long long;
using ld = long double;
using pii = pair<ll,ll>;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define MP make_pair
const ll INF64=4e17;
const int INF=0x3f3f3f3f;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<P.f<<' '<<P.s;
    return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
    REP(i,sz(V)) out<<V[i]+1<<((i!=sz(V)-1)?" ":"");
    return out;
}
ll mult(ll a,ll b){
    return ((a%MOD)*(b%MOD))%MOD;
}
ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=mult(res,a);
        a=mult(a,a);
        b>>=1;
    }
    return res;
}
const int maxn=2e5+5;
int arr[maxn];
vector<pii> v[maxn];
struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

int main(){
    int n;
    cin>>n;
    gp_hash_table<int,int,custom_hash> mp;
    REP(i,n) cin>>arr[i],mp[arr[i]]=0;
    int cntt=0;
   	for(auto &x:mp) x.s=cntt++;
   	REP(i,n) arr[i]=mp[arr[i]];
   	for(int i=0;i<n;){
   		int p=i;
   		while(i<n and arr[i]==arr[p]) ++i;
   		v[arr[p]].pb({p,i});
   	}
    ll ans=0;
    REP(i,cntt){
    	int pv=0;
    	int cur=n,mn=n,tot=0,up=n;
    	v[i].pb({n,n});
    	mp.clear();
    	mp[cur]++;
	    for(auto x:v[i]){
	        int z=x.f-pv;
	        if(z){
	            while(cur-1>mn and z){
	                cur--;
	                tot-=mp[cur];
	                ans+=tot;
	                --z;
	            }
	            if(z){
	                tot=0,cur-=z,mn=cur;
	            }
	            mp[cur]++;
	        }
	        for(int j=x.f;j<x.s;j++){
		        ++cur;
		        tot+=mp[cur-1];
		        ans+=tot;
		        if(j!=x.s-1) mp[cur]++;
		        else if(cur>=up) mp[cur]++;
		        if(cur<up) mp[cur]++;
		        MXTO(up,cur);
	    	}
	    	pv=x.s;
	    }
	}
    cout<<ans;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 4 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 2 ms 4940 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 4 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 2 ms 4940 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 4 ms 5068 KB Output is correct
10 Correct 4 ms 5068 KB Output is correct
11 Correct 5 ms 5068 KB Output is correct
12 Correct 4 ms 5068 KB Output is correct
13 Correct 4 ms 5068 KB Output is correct
14 Correct 4 ms 5068 KB Output is correct
15 Correct 4 ms 5068 KB Output is correct
16 Correct 4 ms 5068 KB Output is correct
17 Correct 3 ms 5068 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 7244 KB Output is correct
2 Correct 37 ms 7348 KB Output is correct
3 Correct 22 ms 6344 KB Output is correct
4 Correct 39 ms 7380 KB Output is correct
5 Correct 43 ms 7432 KB Output is correct
6 Correct 42 ms 7420 KB Output is correct
7 Correct 41 ms 7536 KB Output is correct
8 Correct 44 ms 7600 KB Output is correct
9 Correct 42 ms 7452 KB Output is correct
10 Correct 41 ms 7532 KB Output is correct
11 Correct 50 ms 15108 KB Output is correct

Subtask #4
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 4 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 2 ms 4940 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 4 ms 5068 KB Output is correct
10 Correct 4 ms 5068 KB Output is correct
11 Correct 5 ms 5068 KB Output is correct
12 Correct 4 ms 5068 KB Output is correct
13 Correct 4 ms 5068 KB Output is correct
14 Correct 4 ms 5068 KB Output is correct
15 Correct 4 ms 5068 KB Output is correct
16 Correct 4 ms 5068 KB Output is correct
17 Correct 3 ms 5068 KB Output is correct
18 Correct 29 ms 7244 KB Output is correct
19 Correct 37 ms 7348 KB Output is correct
20 Correct 22 ms 6344 KB Output is correct
21 Correct 39 ms 7380 KB Output is correct
22 Correct 43 ms 7432 KB Output is correct
23 Correct 42 ms 7420 KB Output is correct
24 Correct 41 ms 7536 KB Output is correct
25 Correct 44 ms 7600 KB Output is correct
26 Correct 42 ms 7452 KB Output is correct
27 Correct 41 ms 7532 KB Output is correct
28 Correct 50 ms 15108 KB Output is correct
29 Correct 97 ms 15040 KB Output is correct
30 Correct 40 ms 8588 KB Output is correct
31 Correct 66 ms 9784 KB Output is correct
32 Correct 156 ms 15400 KB Output is correct
33 Correct 79 ms 12784 KB Output is correct
34 Correct 75 ms 12908 KB Output is correct
35 Correct 50 ms 9420 KB Output is correct
36 Correct 31 ms 7492 KB Output is correct
37 Correct 38 ms 8872 KB Output is correct
38 Correct 56 ms 11640 KB Output is correct
39 Correct 59 ms 11636 KB Output is correct
40 Correct 58 ms 11748 KB Output is correct
41 Correct 58 ms 11708 KB Output is correct
42 Correct 57 ms 11632 KB Output is correct
43 Correct 107 ms 12440 KB Output is correct
44 Correct 108 ms 12080 KB Output is correct
45 Correct 107 ms 12084 KB Output is correct
46 Correct 112 ms 12420 KB Output is correct
47 Correct 110 ms 12060 KB Output is correct
48 Correct 70 ms 10564 KB Output is correct
49 Correct 75 ms 10632 KB Output is correct
50 Correct 76 ms 11844 KB Output is correct
51 Correct 76 ms 11680 KB Output is correct
52 Correct 70 ms 10052 KB Output is correct
53 Correct 68 ms 9724 KB Output is correct
54 Correct 72 ms 10076 KB Output is correct