oj.uz

Submission #531698

# Submission time Handle Problem Language Result Execution time Memory
531698 2022-03-01T10:05:35 Z errorgorn Izbori (COCI22_izbori) C++17
110 / 110
 141 ms 16592 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 fen[200005];
 
void add(int i){
	while (i<200005){
		fen[i]++;
		i+=i&-i;
	}
}
 
int query(int i){
	int res=0;
	while (i){
		res+=fen[i];
		i-=i&-i;
	}
	return res;
}
 
int n;
int arr[200005];
vector<int> pos[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)) fen[x]=0;
	
	//for (auto it:ranges) cout<<it.fi<<"_"<<it.se<<" "; cout<<endl;
	
	ll res=0;
	for (auto it:ranges){
		int l=lb(all(imp),it.se)-imp.begin();
		int r=ub(all(imp),it.fi)-imp.begin();
		
		rep(x,r,l) res+=query(x-1),add(x);
	}
	//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 5068 KB Output is correct
3 Correct 3 ms 5068 KB Output is correct
4 Correct 3 ms 5068 KB Output is correct
5 Correct 3 ms 5068 KB Output is correct
6 Correct 3 ms 5068 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 5068 KB Output is correct
3 Correct 3 ms 5068 KB Output is correct
4 Correct 3 ms 5068 KB Output is correct
5 Correct 3 ms 5068 KB Output is correct
6 Correct 3 ms 5068 KB Output is correct
7 Correct 3 ms 5040 KB Output is correct
8 Correct 4 ms 5028 KB Output is correct
9 Correct 5 ms 5032 KB Output is correct
10 Correct 4 ms 5068 KB Output is correct
11 Correct 4 ms 5044 KB Output is correct
12 Correct 4 ms 5068 KB Output is correct
13 Correct 4 ms 5044 KB Output is correct
14 Correct 4 ms 5036 KB Output is correct
15 Correct 4 ms 5044 KB Output is correct
16 Correct 4 ms 5068 KB Output is correct
17 Correct 5 ms 5172 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 10172 KB Output is correct
2 Correct 77 ms 11292 KB Output is correct
3 Correct 44 ms 8500 KB Output is correct
4 Correct 77 ms 11400 KB Output is correct
5 Correct 79 ms 11584 KB Output is correct
6 Correct 84 ms 11860 KB Output is correct
7 Correct 90 ms 11928 KB Output is correct
8 Correct 83 ms 11944 KB Output is correct
9 Correct 87 ms 11972 KB Output is correct
10 Correct 82 ms 11884 KB Output is correct
11 Correct 87 ms 16044 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 5068 KB Output is correct
3 Correct 3 ms 5068 KB Output is correct
4 Correct 3 ms 5068 KB Output is correct
5 Correct 3 ms 5068 KB Output is correct
6 Correct 3 ms 5068 KB Output is correct
7 Correct 3 ms 5040 KB Output is correct
8 Correct 4 ms 5028 KB Output is correct
9 Correct 5 ms 5032 KB Output is correct
10 Correct 4 ms 5068 KB Output is correct
11 Correct 4 ms 5044 KB Output is correct
12 Correct 4 ms 5068 KB Output is correct
13 Correct 4 ms 5044 KB Output is correct
14 Correct 4 ms 5036 KB Output is correct
15 Correct 4 ms 5044 KB Output is correct
16 Correct 4 ms 5068 KB Output is correct
17 Correct 5 ms 5172 KB Output is correct
18 Correct 57 ms 10172 KB Output is correct
19 Correct 77 ms 11292 KB Output is correct
20 Correct 44 ms 8500 KB Output is correct
21 Correct 77 ms 11400 KB Output is correct
22 Correct 79 ms 11584 KB Output is correct
23 Correct 84 ms 11860 KB Output is correct
24 Correct 90 ms 11928 KB Output is correct
25 Correct 83 ms 11944 KB Output is correct
26 Correct 87 ms 11972 KB Output is correct
27 Correct 82 ms 11884 KB Output is correct
28 Correct 87 ms 16044 KB Output is correct
29 Correct 97 ms 16592 KB Output is correct
30 Correct 29 ms 6576 KB Output is correct
31 Correct 52 ms 8032 KB Output is correct
32 Correct 141 ms 11196 KB Output is correct
33 Correct 60 ms 8232 KB Output is correct
34 Correct 65 ms 8416 KB Output is correct
35 Correct 42 ms 7372 KB Output is correct
36 Correct 24 ms 6408 KB Output is correct
37 Correct 31 ms 6708 KB Output is correct
38 Correct 104 ms 10008 KB Output is correct
39 Correct 107 ms 9832 KB Output is correct
40 Correct 119 ms 9924 KB Output is correct
41 Correct 102 ms 9832 KB Output is correct
42 Correct 101 ms 9900 KB Output is correct
43 Correct 117 ms 9692 KB Output is correct
44 Correct 113 ms 9632 KB Output is correct
45 Correct 118 ms 9612 KB Output is correct
46 Correct 120 ms 9640 KB Output is correct
47 Correct 112 ms 9676 KB Output is correct
48 Correct 114 ms 8376 KB Output is correct
49 Correct 124 ms 8292 KB Output is correct
50 Correct 117 ms 8644 KB Output is correct
51 Correct 124 ms 8680 KB Output is correct
52 Correct 97 ms 8196 KB Output is correct
53 Correct 96 ms 8080 KB Output is correct
54 Correct 109 ms 8208 KB Output is correct