Submission #3231955
Source Code Expand
#include <iostream> #include <vector> using namespace std; typedef long long ll; string S; vector<vector<int>> v(26); int A[26] = {0},id[26] = {0}; ll merge_count(vector<ll> &a){ int n = a.size(); if(n<=1) return 0; ll cnt = 0; vector<ll> b(a.begin(),a.begin() + n/2); vector<ll> c(a.begin() + n/2, a.end()); cnt += merge_count(b); cnt += merge_count(c); int ai = 0,bi = 0,ci = 0; while(ai<n){ if(bi<b.size() && (ci == c.size() || b[bi] <= c[ci])){ a[ai++] = b[bi++]; }else{ cnt += n/2 - bi; a[ai++] = c[ci++]; } } return cnt; } int main(){ cin >> S; int N = S.size(); for(int i=0;i<N;i++){ int t = S[i]-'a'; A[t]++; v[t].push_back(-1); } int count = 0; for(int i=0;i<26;i++){ if(A[i]%2==1) count++; } if(count>=2){ cout << -1 << endl; return 0; } vector<ll> L,R; int l = 0; for(int i=0;i<N;i++){ int c = S[i]-'a'; if(A[c]%2==1 && 2*id[c]+1==v[c].size()){ L.push_back(N/2); id[c]++; } else{ if(id[c]*2<v[c].size()){ L.push_back(l); v[c][id[c]] = l; l++; id[c]++; }else{ int t = v[c].size()-id[c]-1; L.push_back(N-v[c][t]-1); id[c]++; } } } /* l = 0; for(int i=0;i<26;i++) id[i] = 0; for(int i=0;i<N;i++){ int c = T[i]-'a'; if(A[c]%2==1&& 2*id[c]+1==v[c].size()){ R.push_back(N/2); id[c]++; } else{ if(id[c]*2<v[c].size()){ R.push_back(l); v[c][id[c]] = l; l++; id[c]++; }else{ int t = v[c].size()-id[c]-1; R.push_back(N-v[c][t]-1); id[c]++; } } } cout << min(merge_count(L),merge_count(R)) << endl;*/ cout << merge_count(L) << endl; }
Submission Info
Submission Time | |
---|---|
Task | E - Papple Sort |
User | idsigma |
Language | C++14 (GCC 5.4.1) |
Score | 800 |
Code Size | 1690 Byte |
Status | AC |
Exec Time | 41 ms |
Memory | 6000 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 800 / 800 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, s1.txt, s2.txt, s3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 39 ms | 6000 KB |
02.txt | AC | 40 ms | 5940 KB |
03.txt | AC | 41 ms | 6000 KB |
04.txt | AC | 41 ms | 6000 KB |
05.txt | AC | 40 ms | 6000 KB |
06.txt | AC | 40 ms | 6000 KB |
07.txt | AC | 40 ms | 6000 KB |
08.txt | AC | 40 ms | 6000 KB |
09.txt | AC | 41 ms | 6000 KB |
10.txt | AC | 39 ms | 6000 KB |
11.txt | AC | 8 ms | 1408 KB |
12.txt | AC | 8 ms | 1408 KB |
13.txt | AC | 8 ms | 1408 KB |
14.txt | AC | 8 ms | 1408 KB |
15.txt | AC | 35 ms | 5872 KB |
16.txt | AC | 35 ms | 5872 KB |
17.txt | AC | 37 ms | 5868 KB |
18.txt | AC | 36 ms | 5868 KB |
19.txt | AC | 38 ms | 5968 KB |
20.txt | AC | 9 ms | 1404 KB |
21.txt | AC | 38 ms | 5948 KB |
22.txt | AC | 36 ms | 5868 KB |
23.txt | AC | 35 ms | 5872 KB |
24.txt | AC | 9 ms | 1528 KB |
25.txt | AC | 36 ms | 5872 KB |
26.txt | AC | 35 ms | 5872 KB |
27.txt | AC | 35 ms | 5872 KB |
28.txt | AC | 35 ms | 5872 KB |
29.txt | AC | 37 ms | 5872 KB |
30.txt | AC | 9 ms | 1528 KB |
31.txt | AC | 36 ms | 5872 KB |
32.txt | AC | 9 ms | 1528 KB |
33.txt | AC | 36 ms | 5872 KB |
34.txt | AC | 9 ms | 1528 KB |
35.txt | AC | 36 ms | 5872 KB |
36.txt | AC | 9 ms | 1784 KB |
37.txt | AC | 8 ms | 1488 KB |
38.txt | AC | 9 ms | 1652 KB |
39.txt | AC | 39 ms | 5868 KB |
40.txt | AC | 9 ms | 1364 KB |
41.txt | AC | 1 ms | 256 KB |
42.txt | AC | 1 ms | 256 KB |
43.txt | AC | 1 ms | 256 KB |
44.txt | AC | 1 ms | 256 KB |
45.txt | AC | 1 ms | 256 KB |
46.txt | AC | 1 ms | 256 KB |
47.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |