oj.uz

Submission #531700

# Submission time Handle Problem Language Result Execution time Memory
531700 2022-03-01T10:09:35 Z errorgorn Izbori (COCI22_izbori) C++17
110 / 110
 112 ms 15704 KB 
//雪花飄飄北風嘯嘯
//天地一片蒼茫
 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << ": " << x << endl
 
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define lb lower_bound
#define ub upper_bound
 
#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
 
#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//change less to less_equal for non distinct pbds, but erase will bug
 
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

int n;
int arr[200005];
vector<int> pos[200005];
 
int delta[200005];
 
ll solve(vector<int> v){
	v.pub(n+1);
	
	vector<ii> ranges={ {0,-(v[0]-1)} };
	rep(x,0,sz(v)-1){
		ranges.pub({ranges.back().se+1,ranges.back().se-(v[x+1]-v[x])+2});
	}
	
	vector<int> imp={-(int)1e9};
	rep(x,0,sz(ranges)) imp.pub(ranges[x].fi),imp.pub(ranges[x].fi-1);
	sort(all(imp));
	imp.erase(unique(all(imp)),imp.end());
	
	rep(x,1,sz(imp)) delta[x]=0;
	
	//for (auto it:ranges) cout<<it.fi<<"_"<<it.se<<" "; cout<<endl;
	
	int pos=find(all(imp),ranges[0].fi)-imp.begin()-1;
	int curr=0;
	
	ll res=0;
	for (auto it:ranges){
		curr+=delta[pos];
		pos++;
		while (true){
			res+=curr;
			delta[pos]++;
			if (imp[pos-1]<it.se) break;
			pos--;
			curr-=delta[pos];
		}
	}
	//cout<<res<<endl;
	return res;
}

void read(int &x){
	x=0;
	char ch=getchar_unlocked();
	while (ch&16) x=x*10+(ch&15),ch=getchar_unlocked();
}

signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin.exceptions(ios::badbit | ios::failbit);
	
	read(n);
	rep(x,0,n) read(arr[x]);
	
	vector<int> uni(arr,arr+n);
	sort(all(uni));
	rep(x,0,n) arr[x]=lb(all(uni),arr[x])-uni.begin();
	
	rep(x,0,n) pos[arr[x]].pub(x+1);
	
	ll ans=0;
	rep(x,0,n) ans+=solve(pos[x]);
	
	cout<<ans<<endl;
}

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 3 ms 4940 KB Output is correct
4 Correct 3 ms 5024 KB Output is correct
5 Correct 3 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 3 ms 4940 KB Output is correct
4 Correct 3 ms 5024 KB Output is correct
5 Correct 3 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 3 ms 5068 KB Output is correct
11 Correct 5 ms 5068 KB Output is correct
12 Correct 3 ms 5068 KB Output is correct
13 Correct 3 ms 5068 KB Output is correct
14 Correct 3 ms 5068 KB Output is correct
15 Correct 4 ms 5060 KB Output is correct
16 Correct 4 ms 5068 KB Output is correct
17 Correct 3 ms 5060 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 9892 KB Output is correct
2 Correct 51 ms 10808 KB Output is correct
3 Correct 32 ms 8280 KB Output is correct
4 Correct 55 ms 11124 KB Output is correct
5 Correct 65 ms 11344 KB Output is correct
6 Correct 62 ms 11488 KB Output is correct
7 Correct 57 ms 11508 KB Output is correct
8 Correct 57 ms 11516 KB Output is correct
9 Correct 57 ms 11500 KB Output is correct
10 Correct 58 ms 11532 KB Output is correct
11 Correct 54 ms 15704 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 3 ms 4940 KB Output is correct
4 Correct 3 ms 5024 KB Output is correct
5 Correct 3 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 3 ms 5068 KB Output is correct
11 Correct 5 ms 5068 KB Output is correct
12 Correct 3 ms 5068 KB Output is correct
13 Correct 3 ms 5068 KB Output is correct
14 Correct 3 ms 5068 KB Output is correct
15 Correct 4 ms 5060 KB Output is correct
16 Correct 4 ms 5068 KB Output is correct
17 Correct 3 ms 5060 KB Output is correct
18 Correct 42 ms 9892 KB Output is correct
19 Correct 51 ms 10808 KB Output is correct
20 Correct 32 ms 8280 KB Output is correct
21 Correct 55 ms 11124 KB Output is correct
22 Correct 65 ms 11344 KB Output is correct
23 Correct 62 ms 11488 KB Output is correct
24 Correct 57 ms 11508 KB Output is correct
25 Correct 57 ms 11516 KB Output is correct
26 Correct 57 ms 11500 KB Output is correct
27 Correct 58 ms 11532 KB Output is correct
28 Correct 54 ms 15704 KB Output is correct
29 Correct 56 ms 15656 KB Output is correct
30 Correct 21 ms 6348 KB Output is correct
31 Correct 41 ms 7628 KB Output is correct
32 Correct 112 ms 10308 KB Output is correct
33 Correct 44 ms 7680 KB Output is correct
34 Correct 48 ms 7752 KB Output is correct
35 Correct 32 ms 6988 KB Output is correct
36 Correct 21 ms 6132 KB Output is correct
37 Correct 25 ms 6384 KB Output is correct
38 Correct 58 ms 9596 KB Output is correct
39 Correct 58 ms 9424 KB Output is correct
40 Correct 63 ms 9532 KB Output is correct
41 Correct 64 ms 9424 KB Output is correct
42 Correct 61 ms 9540 KB Output is correct
43 Correct 62 ms 8828 KB Output is correct
44 Correct 68 ms 8740 KB Output is correct
45 Correct 70 ms 8744 KB Output is correct
46 Correct 78 ms 8692 KB Output is correct
47 Correct 63 ms 8800 KB Output is correct
48 Correct 71 ms 7620 KB Output is correct
49 Correct 90 ms 7620 KB Output is correct
50 Correct 93 ms 8108 KB Output is correct
51 Correct 84 ms 8100 KB Output is correct
52 Correct 61 ms 7492 KB Output is correct
53 Correct 64 ms 7356 KB Output is correct
54 Correct 61 ms 7496 KB Output is correct