Submission #1163482

#	Time	Username	Problem	Language	Result	Execution time	Memory
1163482		justin271828	Ekoeko (COCI21_ekoeko)	C++20	0 / 110	1096 ms	1352 KiB

Main

#include <bits/stdc++.h>
using namespace std;

#define l2 long long

int n;
l2 ft[123456];

void up(int x, l2 k) {
    while (x <= n) {
        ft[x] += k;
        x += (x & (-x));
    } 
}

l2 q(int x) {
    l2 ans = 0;
    while (x > 0) {
        ans += ft[x];
        x -= (x & (-x));
    }
    return ans;
}

int main() {
    cin >> n;
    string s;
    cin >> s;
    queue<int> v[26];
    for (int i = 0; i < n; i++) v[s[n+i]-97].push(i+1);
    l2 ans = 0;
    memset(ft, 0, sizeof(ft));
    for (int i = 1; i <= n; i++) up(i, 1);
    for (int i = 0; i < n; i++) {
        ans += q(v[s[i]-97].front()-1);
        up(v[s[i]-97].front(), -1);
        v[s[i]-97].pop();
    }
    cout << ans;
    return 0;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 40