oj.uz

답안 #521476

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
521476 2022-02-02T08:18:58 Z errorgorn Ekoeko (COCI21_ekoeko) C++17
110 / 110
 17 ms 3440 KB 
// Super Idol的笑容
//    都没你的甜
//  八月正午的阳光
//    都没你耀眼
//  热爱105°C的你
// 滴滴清纯的蒸馏水

#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[100005];

void upd(int i,int j){
	while (i<100005){
		fen[i]+=j;
		i+=i&-i;
	}
}

int query(int i){
	int res=0;
	while (i){
		res+=fen[i];
		i-=i&-i;
	}
	return res;
}

int n;
string s;

vector<int> v[26];
bool pos[200005];

vector<int> p1[26];
vector<int> p2[26];

int arr[100005];

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin.exceptions(ios::badbit | ios::failbit);
	
	cin>>n;
	cin>>s;
	
	rep(x,0,2*n){
		v[s[x]-'a'].pub(x);
	}
	
	rep(x,0,26){
		rep(y,0,sz(v[x])/2) pos[v[x][y]]=true;
	}
	
	ll ans=0;
	ll curr=0;
	
	//rep(x,0,2*n) cout<<pos[x]<<" "; cout<<endl;
	
	rep(x,0,2*n){
		if (!pos[x]) curr++;
		else ans+=curr;
	}
	
	int i1=0,i2=0;
	
	rep(x,0,2*n){
		if (!pos[x]) p1[s[x]-'a'].pub(i1++);
		else p2[s[x]-'a'].pub(i2++);
	}
	
	rep(x,0,26){
		rep(y,0,sz(p1[x])) arr[p1[x][y]]=p2[x][y];
	}
	
	rep(x,2,n+1) upd(x,1);
	
	rep(x,0,n){
		ans+=query(arr[x]+1)-x;
		upd(1,1);
		upd(arr[x]+1,-1);
	}
	
	cout<<ans<<endl;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 312 KB Output is correct
2 Correct 5 ms 1520 KB Output is correct
3 Correct 9 ms 2464 KB Output is correct
4 Correct 13 ms 3440 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 312 KB Output is correct
2 Correct 5 ms 1520 KB Output is correct
3 Correct 9 ms 2464 KB Output is correct
4 Correct 13 ms 3440 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 312 KB Output is correct
2 Correct 5 ms 1520 KB Output is correct
3 Correct 9 ms 2464 KB Output is correct
4 Correct 13 ms 3440 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 13 ms 3340 KB Output is correct
7 Correct 14 ms 3356 KB Output is correct
8 Correct 13 ms 3288 KB Output is correct
9 Correct 15 ms 3276 KB Output is correct
10 Correct 13 ms 3340 KB Output is correct
11 Correct 14 ms 3320 KB Output is correct
12 Correct 12 ms 3292 KB Output is correct
13 Correct 13 ms 3300 KB Output is correct
14 Correct 12 ms 3180 KB Output is correct
15 Correct 11 ms 3296 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct

Subtask #5
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 312 KB Output is correct
2 Correct 5 ms 1520 KB Output is correct
3 Correct 9 ms 2464 KB Output is correct
4 Correct 13 ms 3440 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 13 ms 3340 KB Output is correct
11 Correct 14 ms 3356 KB Output is correct
12 Correct 13 ms 3288 KB Output is correct
13 Correct 15 ms 3276 KB Output is correct
14 Correct 13 ms 3340 KB Output is correct
15 Correct 14 ms 3320 KB Output is correct
16 Correct 12 ms 3292 KB Output is correct
17 Correct 13 ms 3300 KB Output is correct
18 Correct 12 ms 3180 KB Output is correct
19 Correct 11 ms 3296 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 308 KB Output is correct
32 Correct 14 ms 3268 KB Output is correct
33 Correct 16 ms 3348 KB Output is correct
34 Correct 14 ms 3396 KB Output is correct
35 Correct 13 ms 3260 KB Output is correct
36 Correct 17 ms 3352 KB Output is correct
37 Correct 14 ms 3312 KB Output is correct
38 Correct 13 ms 3232 KB Output is correct
39 Correct 13 ms 3296 KB Output is correct
40 Correct 12 ms 3240 KB Output is correct
41 Correct 13 ms 3288 KB Output is correct