#199674 (C++14) No.559 swapAB列

• 問題: No.559 swapAB列
• ユーザー: masakt
• 提出日時: 2017-08-25 22:40:40
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 2 ms / 2,000 ms
• コード長: 2,055 bytes
• コンパイル時間: 1,731 ms
• コンパイル使用メモリ: 171,560 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-10-15 16:03:39
• 合計ジャッジ時間: 1,936 ms
• ジャッジサーバーID （参考情報）: judge2 / judge4

ファイルパターン	結果
sample	AC * 3
other	AC * 7

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
#include <bits/stdc++.h>
namespace ac {
    using namespace std;
}
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define all(r) r.begin(),r.end()
using namespace std;
using namespace ac;
typedef int64_t ll;
typedef vector<ll> vll;
namespace ac {
    // FenwickTree繝ｻBit
    struct BinaryIndexedTree {
        int n;
        vector<int64_t> b; // [1, m_n]
        BinaryIndexedTree() {}
        void init(int a_n) {
            n = a_n;
            b.resize(n + 1, 0);
        }
        int64_t sum(int i) {
            int64_t s = 0;
            while (0 < i) {
                s += b[i];
                i -= i & -i;
            }
            return s;
        }
        void add(int i, int64_t x) {
            while (i <= n) {
                b[i] += x;
                i += i & -i;
            }
        }
    };
    struct Inversion {
        int n;
        ac::BinaryIndexedTree bit;
        Inversion(int a_n) {
            init(a_n);
        }
        void init(int a_n) {
            n = a_n;
            bit.init(n);
        }
        vector<int64_t> getGreaterThan(vector<int64_t> &a_v) {
            int length = a_v.size();
            vector<int64_t> ord(length);
            for (int i = length - 1; i >= 0; i--) {
                ord[i] = bit.sum(a_v[i]);
                bit.add(a_v[i] + 1, 1);
            }
            return ord;
        }
    };
}
struct Solution {
    void solve(std::istream& in, std::ostream& out) {
        string S;
        in >> S;
        Inversion i(S.size());
        vll a(S.size());
        rep(i, S.size()) {
            a[i] = S[i] - 'A';
        }
        vll res = i.getGreaterThan(a);
        ll ans = accumulate(all(res), 0);
        out << ans << '\n';
    }
};
void solve(std::istream& in, std::ostream& out) {
    out << std::setprecision(12);
    Solution solution;
    solution.solve(in, out);
}
#include <fstream>
#include <iostream>
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    istream& in = cin;
    ostream& out = cout;
    solve(in, out);
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX