oj.uz

Submission #743340

# Submission time Handle Problem Language Result Execution time Memory
743340 2023-05-17T09:58:54 Z Filya Ekoeko (COCI21_ekoeko) C++14
110 / 110
 21 ms 8992 KB 
/////////////////////include/////////////////////
//#include <bits/stdc++.h>
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cassert>
#include <set>
#include <map>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stdio.h>
#include <climits>
#include <numeric>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//template <typename T>
//using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
/////////////////////define/////////////////////
#define ci(x) if(x) cout << "YES" << '\n'; else cout << "NO" << '\n';
#define cii(x) if(check(x))
#define MOD 1000000007
#define MOD2 998244353
#define oo 1e9
#define ool 1e18L
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mii map<int, int>
#define vi vector<int>
#define vpi vector<pair<int, int>>
#define vll vector <ll>
#define ff first
#define ss second
#define mp make_pair
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define sz(x) (int((x).size()))
#define all(x) (x).begin(), (x).end()
#define alll(x) (x), (x) + n
#define clr(x) (x).clear();
#define fri(x) for(int i = 0; i < x; ++i)
#define frj(x) for(int j = 0; j < x; ++j)
#define frp(x) for(int p = 0; p < x; ++p)
#define frr(a, b) for(int i = a; i < b; ++i)
#define frrj(a, b) for(int j = a; j < b; ++j)
#define fra(x) for(int i = 0; i < x; ++i) cin >> a[i];
#define frb(x) for(int i = 0; i < x; ++i) cin >> b[i];
#define frs(x) for(auto it = x.begin(); it != x.end(); ++it)
#define fr(x) for(auto it : x) //el
#define fastio ios_base::sync_with_stdio(false); cin.tie(0);
#define dbg(x) cerr << #x << ": " << x << endl;
#define ce(x) cout << x << endl;
#define uniq(x) x.resize(unique(all(x)) - x.begin()); //make all one after sorting
#define blt __builtin_popcount
/////////////////////print array, vector, deque, set, multiset, pair, map /////////////////////
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]"; cout << endl;}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(stack <T> v) {cerr << "[ "; stack<T> s = v; while(s.size()) {T i = s.top(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(queue <T> v) {cerr << "[ "; queue<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(deque <T> v) {cerr << "[ "; deque<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop_front(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
/////////////////////code/////////////////////
int cur[200005], cnt[200005], a[200005];
vi g[200005];
struct fenwick {
    int size;
    vector<long long> tree;
    void init(int s) {
        tree.assign(s + 2, 0);
        size = s;
    }
    void upd(int u, long long v) {
        while(u <= size) {
            tree[u] += v;
            u += u & (-u);
        }
    } 
    long long qry(int u) {
        long long sum = 0;
        while(u > 0) {
            sum += tree[u];
            u -= u & (-u); // lsb
        }
        return sum;
    }
    long long sum(int l, int r) {
        return qry(r) - qry(l - 1);
    }
} ft;

int main() {
    fastio;
    string s; ll n; cin >> n >> s;
    string t;
    fri(2*n) cnt[s[i]-'a']++;
    fri(2*n) {
        cur[s[i]-'a']++;
        if(cur[s[i]-'a'] <= cnt[s[i]-'a']/2)
            t += s[i];
    }
    t += t;
    //s ic t piti stananq
    fri(30) cnt[i]=0;
    fri(2*n) g[s[i]-'a'].pb(i+1);
    fri(2*n) {
        a[i] = g[t[i]-'a'][cnt[t[i]-'a']];
        cnt[t[i]-'a']++;
    }
    //1in masic karanq gnanq inch vor permutationi, nuyny 2rd masic, bayc dra amenakarch tivy -> d(1in, p) + d(2rd, p) >= d(1in,2rd), havasar a ete p=2rd
    //aysinqn 1inic piti gnanq 2rd
    ll ans = 0;
    ft.init(2*n+2);
    // print(a, 2*n);
    fri(2*n) {
        ans += ft.sum(a[i], 2*n);
        ft.upd(a[i], 1);
    }
    cout << ans;
    return 0;
}

//	           ♥ ♥ ♥  ♥  ♥    ♥   ♥    ♥
//	           ♥      ♥  ♥     ♥ ♥    ♥ ♥
//	           ♥ ♥ ♥  ♥  ♥      ♥    ♥   ♥
//	           ♥      ♥  ♥      ♥   ♥ ♥ ♥ ♥
//	           ♥      ♥  ♥ ♥ ♥  ♥  ♥       ♥
//
//        God loves Fil, Fil accepts God's will

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 7 ms 6508 KB Output is correct
3 Correct 12 ms 7668 KB Output is correct
4 Correct 18 ms 8880 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 7 ms 6508 KB Output is correct
3 Correct 12 ms 7668 KB Output is correct
4 Correct 18 ms 8880 KB Output is correct
5 Correct 3 ms 5028 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 5028 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 7 ms 6508 KB Output is correct
3 Correct 12 ms 7668 KB Output is correct
4 Correct 18 ms 8880 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 16 ms 8964 KB Output is correct
7 Correct 17 ms 8784 KB Output is correct
8 Correct 21 ms 8800 KB Output is correct
9 Correct 18 ms 8860 KB Output is correct
10 Correct 21 ms 8844 KB Output is correct
11 Correct 19 ms 8676 KB Output is correct
12 Correct 21 ms 8716 KB Output is correct
13 Correct 19 ms 8660 KB Output is correct
14 Correct 20 ms 8660 KB Output is correct
15 Correct 16 ms 8592 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 5028 KB Output is correct
3 Correct 3 ms 5076 KB Output is correct
4 Correct 4 ms 5076 KB Output is correct
5 Correct 3 ms 5076 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 4 ms 5076 KB Output is correct
8 Correct 3 ms 5076 KB Output is correct
9 Correct 3 ms 5028 KB Output is correct
10 Correct 4 ms 5076 KB Output is correct
11 Correct 3 ms 5036 KB Output is correct

Subtask #5
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 7 ms 6508 KB Output is correct
3 Correct 12 ms 7668 KB Output is correct
4 Correct 18 ms 8880 KB Output is correct
5 Correct 3 ms 5028 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 5028 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 16 ms 8964 KB Output is correct
11 Correct 17 ms 8784 KB Output is correct
12 Correct 21 ms 8800 KB Output is correct
13 Correct 18 ms 8860 KB Output is correct
14 Correct 21 ms 8844 KB Output is correct
15 Correct 19 ms 8676 KB Output is correct
16 Correct 21 ms 8716 KB Output is correct
17 Correct 19 ms 8660 KB Output is correct
18 Correct 20 ms 8660 KB Output is correct
19 Correct 16 ms 8592 KB Output is correct
20 Correct 2 ms 4948 KB Output is correct
21 Correct 3 ms 5028 KB Output is correct
22 Correct 3 ms 5076 KB Output is correct
23 Correct 4 ms 5076 KB Output is correct
24 Correct 3 ms 5076 KB Output is correct
25 Correct 3 ms 5076 KB Output is correct
26 Correct 4 ms 5076 KB Output is correct
27 Correct 3 ms 5076 KB Output is correct
28 Correct 3 ms 5028 KB Output is correct
29 Correct 4 ms 5076 KB Output is correct
30 Correct 3 ms 5036 KB Output is correct
31 Correct 3 ms 5032 KB Output is correct
32 Correct 16 ms 8992 KB Output is correct
33 Correct 15 ms 8800 KB Output is correct
34 Correct 19 ms 8840 KB Output is correct
35 Correct 18 ms 8712 KB Output is correct
36 Correct 20 ms 8716 KB Output is correct
37 Correct 20 ms 8844 KB Output is correct
38 Correct 19 ms 8680 KB Output is correct
39 Correct 21 ms 8672 KB Output is correct
40 Correct 17 ms 8680 KB Output is correct
41 Correct 18 ms 8592 KB Output is correct