oj.uz

Submission #531709

# Submission time Handle Problem Language Result Execution time Memory
531709 2022-03-01T10:16:18 Z errorgorn Izbori (COCI22_izbori) C++17
110 / 110
 56 ms 12032 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

//雪花飄飄北風嘯嘯
//天地一片蒼茫
 
#include <bits/stdc++.h>
using namespace std;
#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(int x=start;x!=end;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 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 4940 KB Output is correct
5 Correct 3 ms 5032 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 4940 KB Output is correct
5 Correct 3 ms 5032 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 4964 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 4 ms 4940 KB Output is correct
11 Correct 4 ms 4940 KB Output is correct
12 Correct 4 ms 5056 KB Output is correct
13 Correct 4 ms 5020 KB Output is correct
14 Correct 4 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 3 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 26 ms 8384 KB Output is correct
2 Correct 39 ms 9176 KB Output is correct
3 Correct 20 ms 7332 KB Output is correct
4 Correct 36 ms 9232 KB Output is correct
5 Correct 40 ms 9320 KB Output is correct
6 Correct 46 ms 9456 KB Output is correct
7 Correct 37 ms 9572 KB Output is correct
8 Correct 40 ms 9504 KB Output is correct
9 Correct 39 ms 9624 KB Output is correct
10 Correct 37 ms 9492 KB Output is correct
11 Correct 23 ms 12032 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 4940 KB Output is correct
5 Correct 3 ms 5032 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 4964 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 4 ms 4940 KB Output is correct
11 Correct 4 ms 4940 KB Output is correct
12 Correct 4 ms 5056 KB Output is correct
13 Correct 4 ms 5020 KB Output is correct
14 Correct 4 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 3 ms 4940 KB Output is correct
17 Correct 4 ms 5068 KB Output is correct
18 Correct 26 ms 8384 KB Output is correct
19 Correct 39 ms 9176 KB Output is correct
20 Correct 20 ms 7332 KB Output is correct
21 Correct 36 ms 9232 KB Output is correct
22 Correct 40 ms 9320 KB Output is correct
23 Correct 46 ms 9456 KB Output is correct
24 Correct 37 ms 9572 KB Output is correct
25 Correct 40 ms 9504 KB Output is correct
26 Correct 39 ms 9624 KB Output is correct
27 Correct 37 ms 9492 KB Output is correct
28 Correct 23 ms 12032 KB Output is correct
29 Correct 27 ms 11968 KB Output is correct
30 Correct 9 ms 5324 KB Output is correct
31 Correct 14 ms 5580 KB Output is correct
32 Correct 45 ms 6480 KB Output is correct
33 Correct 18 ms 5672 KB Output is correct
34 Correct 18 ms 5700 KB Output is correct
35 Correct 11 ms 5456 KB Output is correct
36 Correct 7 ms 5288 KB Output is correct
37 Correct 8 ms 5324 KB Output is correct
38 Correct 46 ms 8096 KB Output is correct
39 Correct 40 ms 8016 KB Output is correct
40 Correct 42 ms 8032 KB Output is correct
41 Correct 38 ms 8060 KB Output is correct
42 Correct 43 ms 8040 KB Output is correct
43 Correct 56 ms 7320 KB Output is correct
44 Correct 42 ms 7320 KB Output is correct
45 Correct 41 ms 7312 KB Output is correct
46 Correct 41 ms 7320 KB Output is correct
47 Correct 42 ms 7324 KB Output is correct
48 Correct 34 ms 6568 KB Output is correct
49 Correct 45 ms 6576 KB Output is correct
50 Correct 37 ms 6664 KB Output is correct
51 Correct 33 ms 6596 KB Output is correct
52 Correct 28 ms 6604 KB Output is correct
53 Correct 29 ms 6584 KB Output is correct
54 Correct 29 ms 6588 KB Output is correct