oj.uz

Submission #1116093

# Submission time Handle Problem Language Result Execution time Memory
1116093 2024-11-21T09:00:12 Z ezzzay Ekoeko (COCI21_ekoeko) C++14
0 / 110
 23 ms 29776 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ff first
#define ss second
#define pb push_back
const int N=3e5+5;
vector<int>a[N],b[N];
int p[N];
int bit[N];
int find(int idx){
    int s=0;
    while(idx>0){
        s+=bit[idx];
        idx-= idx & -idx;
    }
    return s;
}
void update(int idx, int val){
    while(idx<N){
        bit[idx]+=val;
        idx+= idx & -idx;
    }
}
signed main(){
    int n;
    cin>>n;
    string s;
    cin>>s;
    for(int i=0;i<2*n;i++){
        if(i<n)a[s[i]-'0'].pb(i);
        else b[s[i]-'0'].pb(i);
    }
    for(int i=n-1;i>=0;i--){
        p[ b[s[i]-'0'].back() - n +1 ] =i+1; 
        b[s[i]-'0'].pop_back();
    }
    int ans=0;
    return 0;
    for(int i=1;i<=n;i++){
        continue;
        update(p[i],1);
        ans+=i-find(p[i]);
    }
    cout<<ans;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 23 ms 29776 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 23 ms 29776 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 23 ms 29776 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 17144 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Runtime error 23 ms 29776 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -