oj.uz

Submission #531673

# Submission time Handle Problem Language Result Execution time Memory
531673 2022-03-01T08:51:34 Z zaneyu Izbori (COCI22_izbori) C++14
40 / 110
 3000 ms 28824 KB 
/*input
5
2 2 1 2 3
*/ 
#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=6e5+5;
int arr[maxn],tmp[maxn];
pii a[maxn];
vector<pii> v[maxn];
int mp[2*maxn];
int main(){
    int n;
    cin>>n;
    REP(i,n) cin>>arr[i],a[i].f=arr[i],a[i].s=i;
    sort(a,a+n);
    int cnt=0;
    REP(i,n){
    	if(i and arr[a[i].s]!=arr[a[i-1].s]) ++cnt;
    	tmp[a[i].s]=cnt;
    }
    ++cnt;
    REP(i,n) arr[i]=tmp[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,cnt){
    	int pv=0;
    	int cur=n,mn=n,tot=0,up=n;
    	v[i].pb({n,n});
    	REP(j,2*n+1) mp[j]=0;
    	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 8 ms 14284 KB Output is correct
2 Correct 8 ms 14412 KB Output is correct
3 Correct 10 ms 14412 KB Output is correct
4 Correct 10 ms 14412 KB Output is correct
5 Correct 10 ms 14392 KB Output is correct
6 Correct 8 ms 14396 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14284 KB Output is correct
2 Correct 8 ms 14412 KB Output is correct
3 Correct 10 ms 14412 KB Output is correct
4 Correct 10 ms 14412 KB Output is correct
5 Correct 10 ms 14392 KB Output is correct
6 Correct 8 ms 14396 KB Output is correct
7 Correct 11 ms 14412 KB Output is correct
8 Correct 8 ms 14412 KB Output is correct
9 Correct 11 ms 14512 KB Output is correct
10 Correct 12 ms 14516 KB Output is correct
11 Correct 10 ms 14592 KB Output is correct
12 Correct 9 ms 14532 KB Output is correct
13 Correct 10 ms 14512 KB Output is correct
14 Correct 10 ms 14536 KB Output is correct
15 Correct 9 ms 14556 KB Output is correct
16 Correct 9 ms 14496 KB Output is correct
17 Correct 9 ms 14412 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 20016 KB Output is correct
2 Correct 49 ms 21644 KB Output is correct
3 Correct 34 ms 18728 KB Output is correct
4 Correct 55 ms 21992 KB Output is correct
5 Correct 65 ms 22364 KB Output is correct
6 Correct 59 ms 22752 KB Output is correct
7 Correct 62 ms 22828 KB Output is correct
8 Correct 63 ms 22848 KB Output is correct
9 Correct 59 ms 22832 KB Output is correct
10 Correct 61 ms 22828 KB Output is correct
11 Correct 57 ms 20928 KB Output is correct

Subtask #4
0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14284 KB Output is correct
2 Correct 8 ms 14412 KB Output is correct
3 Correct 10 ms 14412 KB Output is correct
4 Correct 10 ms 14412 KB Output is correct
5 Correct 10 ms 14392 KB Output is correct
6 Correct 8 ms 14396 KB Output is correct
7 Correct 11 ms 14412 KB Output is correct
8 Correct 8 ms 14412 KB Output is correct
9 Correct 11 ms 14512 KB Output is correct
10 Correct 12 ms 14516 KB Output is correct
11 Correct 10 ms 14592 KB Output is correct
12 Correct 9 ms 14532 KB Output is correct
13 Correct 10 ms 14512 KB Output is correct
14 Correct 10 ms 14536 KB Output is correct
15 Correct 9 ms 14556 KB Output is correct
16 Correct 9 ms 14496 KB Output is correct
17 Correct 9 ms 14412 KB Output is correct
18 Correct 42 ms 20016 KB Output is correct
19 Correct 49 ms 21644 KB Output is correct
20 Correct 34 ms 18728 KB Output is correct
21 Correct 55 ms 21992 KB Output is correct
22 Correct 65 ms 22364 KB Output is correct
23 Correct 59 ms 22752 KB Output is correct
24 Correct 62 ms 22828 KB Output is correct
25 Correct 63 ms 22848 KB Output is correct
26 Correct 59 ms 22832 KB Output is correct
27 Correct 61 ms 22828 KB Output is correct
28 Correct 57 ms 20928 KB Output is correct
29 Correct 90 ms 22552 KB Output is correct
30 Correct 278 ms 17860 KB Output is correct
31 Correct 1212 ms 21140 KB Output is correct
32 Execution timed out 3058 ms 28824 KB Time limit exceeded
33 Halted 0 ms 0 KB -