oj.uz

Submission #531706

# Submission time Handle Problem Language Result Execution time Memory
531706 2022-03-01T10:14:51 Z errorgorn Izbori (COCI22_izbori) C++17
110 / 110
 47 ms 11988 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<int,int>
#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;
ii arr[200005];
vector<int> pos[200005];
 
int delta[200005];
 
ll solve(vector<int> &v){
	if (sz(v)==1) return 1;
	
	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].fi),arr[x].se=x+1;
	
	sort(arr,arr+n);
	
	ll ans=0;
	int curr=0;
	vector<int> pos;
	
	while (curr<n){
		int nxt=curr+1;
		while (arr[curr].fi==arr[nxt].fi) nxt++;
		pos.clear();
		rep(x,curr,nxt) pos.pub(arr[x].se);
		ans+=solve(pos);
		
		curr=nxt;
	}
	
	cout<<ans<<endl;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 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 4 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 2 ms 4940 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 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 4 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 2 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 3 ms 4940 KB Output is correct
10 Correct 5 ms 4940 KB Output is correct
11 Correct 5 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 4 ms 5004 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 4 ms 4940 KB Output is correct
17 Correct 4 ms 5068 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 8392 KB Output is correct
2 Correct 32 ms 9088 KB Output is correct
3 Correct 19 ms 7220 KB Output is correct
4 Correct 36 ms 9232 KB Output is correct
5 Correct 39 ms 9376 KB Output is correct
6 Correct 41 ms 9484 KB Output is correct
7 Correct 40 ms 9512 KB Output is correct
8 Correct 40 ms 9564 KB Output is correct
9 Correct 38 ms 9484 KB Output is correct
10 Correct 41 ms 9604 KB Output is correct
11 Correct 22 ms 11976 KB Output is correct

Subtask #4
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 4 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 4 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 2 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 3 ms 4940 KB Output is correct
10 Correct 5 ms 4940 KB Output is correct
11 Correct 5 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 4 ms 5004 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 4 ms 4940 KB Output is correct
17 Correct 4 ms 5068 KB Output is correct
18 Correct 29 ms 8392 KB Output is correct
19 Correct 32 ms 9088 KB Output is correct
20 Correct 19 ms 7220 KB Output is correct
21 Correct 36 ms 9232 KB Output is correct
22 Correct 39 ms 9376 KB Output is correct
23 Correct 41 ms 9484 KB Output is correct
24 Correct 40 ms 9512 KB Output is correct
25 Correct 40 ms 9564 KB Output is correct
26 Correct 38 ms 9484 KB Output is correct
27 Correct 41 ms 9604 KB Output is correct
28 Correct 22 ms 11976 KB Output is correct
29 Correct 32 ms 11988 KB Output is correct
30 Correct 8 ms 5324 KB Output is correct
31 Correct 16 ms 5624 KB Output is correct
32 Correct 44 ms 6476 KB Output is correct
33 Correct 14 ms 5672 KB Output is correct
34 Correct 20 ms 5700 KB Output is correct
35 Correct 12 ms 5460 KB Output is correct
36 Correct 7 ms 5284 KB Output is correct
37 Correct 8 ms 5344 KB Output is correct
38 Correct 38 ms 8032 KB Output is correct
39 Correct 44 ms 8020 KB Output is correct
40 Correct 42 ms 8028 KB Output is correct
41 Correct 41 ms 8060 KB Output is correct
42 Correct 39 ms 8024 KB Output is correct
43 Correct 42 ms 7316 KB Output is correct
44 Correct 43 ms 7316 KB Output is correct
45 Correct 47 ms 7312 KB Output is correct
46 Correct 44 ms 7316 KB Output is correct
47 Correct 42 ms 7312 KB Output is correct
48 Correct 36 ms 6584 KB Output is correct
49 Correct 36 ms 6604 KB Output is correct
50 Correct 36 ms 6604 KB Output is correct
51 Correct 34 ms 6580 KB Output is correct
52 Correct 31 ms 6588 KB Output is correct
53 Correct 38 ms 6476 KB Output is correct
54 Correct 35 ms 6604 KB Output is correct