제출 #939893

#제출 시각아이디문제언어결과실행 시간메모리
939893Pichon5Ekoeko (COCI21_ekoeko)C++17
0 / 110
0 ms348 KiB
#include <bits/stdc++.h> #define pb push_back #define vi vector<int> #define ll long long #define FIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); using namespace std; const int tam=200005; int T[tam]; int cant[28]; int aux[28]; int n; int query(int pos){ int res=0; while(pos>0){ res+=T[pos]; pos-=pos&-pos; } return res; } void update(int pos, int val){ while(pos<tam){ T[pos]+=val; pos+=pos&-pos; } } int inver(vi &P){ long long res=0; for(int i=0;i<n;i++){ res+=query(tam-1)-query(P[i]); update(P[i],1); } return res; } int solve(string &a, string &b){ queue<int>Q[28]; for(int i=0;i<n;i++){ Q[a[i]-'a'].push(i+1); } vi P; for(int i=0;i<n;i++){ if(Q[b[i]-'a'].empty())return 0; P.pb(Q[b[i]-'a'].front()); Q[b[i]-'a'].pop(); } return inver(P); } signed main(){ FIO; string s; cin>>n; cin>>s; string a=s.substr(0,n); string b=s.substr(n,n); cout<<solve(a,b)<<"\n"; return 0; } // Porque en realidad no sabes lo que duеle // Darlo todo por alguien que no tе quiere
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...