oj.uz

Submission #815822

# Submission time Handle Problem Language Result Execution time Memory
815822 2023-08-09T00:36:16 Z exodus_ Ekoeko (COCI21_ekoeko) C++14
110 / 110
 75 ms 4700 KB 
#include<bits/stdc++.h>
#define eb emplace_back
using namespace std;
const int N = 2e5+5;
int frek[30]={0};
vector<char>kmpl;
deque<int>indeks[30];
vector<int>ssn;
int segtree[4*N]={0};
void barui(int idx, int low, int high, int value) {
    if(low==high && low==value) {
        segtree[idx]=1;
        return;
    }
    if(value<low || value>high) return;
    int mid = (low+high)/2;
    barui(2*idx,low,mid,value);
    barui(2*idx+1,mid+1,high,value);
    segtree[idx] = segtree[2*idx]+segtree[2*idx+1];
}
int carinya(int idx, int low, int high, int l, int r) {
    if(low>=l && high<=r) {
        return segtree[idx];
    }
    if(low>r || high<l) return 0;
    int mid = (low+high)/2;
    int left = carinya(2*idx,low,mid,l,r);
    int right = carinya(2*idx+1,mid+1,high,l,r);
    return left+right;
}
int main() {
    //ios_base::sync_with_stdio(false);
    //cin.tie(0);
    int n;
    cin >> n;
    n*=2;
    string umum;
    cin >> umum;
    for(int i=0; i<n; i++) frek[umum[i]-97]++;
    for(int i=0; i<n; i++) {
        if(frek[umum[i]-97]>0) {
            kmpl.eb(umum[i]);
            frek[umum[i]-97]-=2;
        }
    }
    int sk=kmpl.size();
    for(int i=0; i<sk; i++) kmpl.eb(kmpl[i]);
    for(int i=0; i<n; i++) indeks[kmpl[i]-97].eb(i);
    for(int i=0; i<n; i++) {
        ssn.eb(indeks[umum[i]-97].front());
        indeks[umum[i]-97].pop_front();
    }
    long long jwb=0;
    for(int i=0; i<n; i++) {
        jwb+=carinya(1,0,n-1,ssn[i]+1,n-1);
        barui(1,0,n-1,ssn[i]);
    }
    cout << jwb << endl;
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 16 ms 2132 KB Output is correct
3 Correct 33 ms 3968 KB Output is correct
4 Correct 52 ms 4700 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 16 ms 2132 KB Output is correct
3 Correct 33 ms 3968 KB Output is correct
4 Correct 52 ms 4700 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 212 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 16 ms 2132 KB Output is correct
3 Correct 33 ms 3968 KB Output is correct
4 Correct 52 ms 4700 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 53 ms 4548 KB Output is correct
7 Correct 75 ms 4568 KB Output is correct
8 Correct 56 ms 4616 KB Output is correct
9 Correct 51 ms 4564 KB Output is correct
10 Correct 53 ms 4512 KB Output is correct
11 Correct 52 ms 4472 KB Output is correct
12 Correct 51 ms 4448 KB Output is correct
13 Correct 50 ms 4316 KB Output is correct
14 Correct 49 ms 4372 KB Output is correct
15 Correct 48 ms 4252 KB Output is correct

Subtask #4
20.0 / 20.0

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

Subtask #5
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 16 ms 2132 KB Output is correct
3 Correct 33 ms 3968 KB Output is correct
4 Correct 52 ms 4700 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 53 ms 4548 KB Output is correct
11 Correct 75 ms 4568 KB Output is correct
12 Correct 56 ms 4616 KB Output is correct
13 Correct 51 ms 4564 KB Output is correct
14 Correct 53 ms 4512 KB Output is correct
15 Correct 52 ms 4472 KB Output is correct
16 Correct 51 ms 4448 KB Output is correct
17 Correct 50 ms 4316 KB Output is correct
18 Correct 49 ms 4372 KB Output is correct
19 Correct 48 ms 4252 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 54 ms 4648 KB Output is correct
33 Correct 53 ms 4576 KB Output is correct
34 Correct 53 ms 4624 KB Output is correct
35 Correct 52 ms 4536 KB Output is correct
36 Correct 51 ms 4476 KB Output is correct
37 Correct 54 ms 4484 KB Output is correct
38 Correct 50 ms 4464 KB Output is correct
39 Correct 50 ms 4296 KB Output is correct
40 Correct 51 ms 4372 KB Output is correct
41 Correct 49 ms 4296 KB Output is correct