oj.uz

Submission #1003771

# Submission time Handle Problem Language Result Execution time Memory
1003771 2024-06-20T17:23:44 Z vjudge1 Ekoeko (COCI21_ekoeko) C++17
110 / 110
 30 ms 3516 KB 
#include<bits/stdc++.h>
using namespace std;

#define int long long

int cnt=0;

void Merge(int l, int r, vector<int> &a){
	vector<int> s;
	int mid=(l+r)/2;
	int aux=0;

	int p1=l, p2=mid+1;
	while(p1<=mid && p2<=r){
		if(a[p1]<a[p2]){
			cnt+=aux;
			s.push_back(a[p1]);
			p1++;
		}
		else{
			aux++;
			s.push_back(a[p2]);
			p2++;
		}
	}

	while(p1<=mid){
		s.push_back(a[p1]);
		cnt+=aux;
		p1++;
	}
	while(p2<=r){
		s.push_back(a[p2]);
		p2++;
	}

	for(int i=0; i<s.size(); i++){
		a[l+i]=s[i];
	}
}

void Mergesort(int l, int r, vector<int> &a){
	if(l<r){
		int mid=(l+r)/2;
		Mergesort(l, mid, a);
		Mergesort(mid+1, r, a);
		Merge(l, r, a);
	}
}

int32_t main(){
	ios_base::sync_with_stdio(0); cin.tie(0);
	int n;
	cin >> n;
	string a;
	cin >> a;

	int c1[26]={}, c2[26]={};

	for(int i=0; i<(n<<1); i++){
		if(i<n)c1[a[i]-'a']++;
		c2[a[i]-'a']++;
	}

	int esq[26]={}, dir[26]={};

	for(int i=0; i<26; i++){
		c2[i]>>=1;
		if(c1[i]>c2[i]){
			esq[i]=c1[i]-c2[i];
		}
		else if(c1[i]<c2[i]){
			dir[i]=c2[i]-c1[i];
		}
	}

	int aaa=0, resp=0;

	string le="", ae="", ld="", ad="";

	for(int i=n-1; i>=0; i--){
		if(esq[a[i]-'a']>0){
			esq[a[i]-'a']--;
			resp+=n-1-aaa-i;
			aaa++;
			ad.push_back(a[i]);
		}
		else le.push_back(a[i]);
	}
	reverse(ad.begin(), ad.end());
	reverse(le.begin(), le.end());
	aaa=0;

	for(int i=n; i<2*n; i++){
		if(dir[a[i]-'a']>0){
			dir[a[i]-'a']--;
			resp+=i-n-aaa;
			aaa++;
			ae.push_back(a[i]);
		}
		else ld.push_back(a[i]);
	}

	resp+=aaa*aaa;

	le+=ae;
	ld=ad+ld;

	vector<int> fim(n);


	for(int i=0; i<26; i++){
		int ptr1=0, ptr2=0;
		char ch='a'+i;
		while(ptr2<n){
			if(ld[ptr2]==ch){
				while(le[ptr1]!=ch )ptr1++;
				fim[ptr1]=ptr2;
				ptr1++;
			}
			ptr2++;
		}
	}

	// cout << le << endl << ld << endl << resp << endl;
	// for(auto &x:fim)
	// 	cout << x << ' ';
	// cout << endl;

	Mergesort(0, n-1, fim);

	cout << resp+cnt << '\n';
}

Compilation message

Main.cpp: In function 'void Merge(long long int, long long int, std::vector<long long int>&)':
Main.cpp:37:16: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |  for(int i=0; i<s.size(); i++){
      |               ~^~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 6 ms 1576 KB Output is correct
3 Correct 10 ms 2864 KB Output is correct
4 Correct 17 ms 3516 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 6 ms 1576 KB Output is correct
3 Correct 10 ms 2864 KB Output is correct
4 Correct 17 ms 3516 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 6 ms 1576 KB Output is correct
3 Correct 10 ms 2864 KB Output is correct
4 Correct 17 ms 3516 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 27 ms 3220 KB Output is correct
7 Correct 21 ms 3288 KB Output is correct
8 Correct 20 ms 3324 KB Output is correct
9 Correct 24 ms 3248 KB Output is correct
10 Correct 21 ms 3332 KB Output is correct
11 Correct 30 ms 3056 KB Output is correct
12 Correct 20 ms 3104 KB Output is correct
13 Correct 20 ms 3236 KB Output is correct
14 Correct 22 ms 3280 KB Output is correct
15 Correct 19 ms 3084 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 352 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct

Subtask #5
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 6 ms 1576 KB Output is correct
3 Correct 10 ms 2864 KB Output is correct
4 Correct 17 ms 3516 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 27 ms 3220 KB Output is correct
11 Correct 21 ms 3288 KB Output is correct
12 Correct 20 ms 3324 KB Output is correct
13 Correct 24 ms 3248 KB Output is correct
14 Correct 21 ms 3332 KB Output is correct
15 Correct 30 ms 3056 KB Output is correct
16 Correct 20 ms 3104 KB Output is correct
17 Correct 20 ms 3236 KB Output is correct
18 Correct 22 ms 3280 KB Output is correct
19 Correct 19 ms 3084 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 352 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 21 ms 3236 KB Output is correct
33 Correct 21 ms 3240 KB Output is correct
34 Correct 21 ms 3308 KB Output is correct
35 Correct 20 ms 3284 KB Output is correct
36 Correct 20 ms 3292 KB Output is correct
37 Correct 20 ms 3308 KB Output is correct
38 Correct 26 ms 3260 KB Output is correct
39 Correct 20 ms 3088 KB Output is correct
40 Correct 20 ms 3232 KB Output is correct
41 Correct 20 ms 3112 KB Output is correct