結果

問題 No.956 Number of Unbalanced
コンテスト
ユーザー minato
提出日時 2020-11-19 22:10:22
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 1,217 ms / 2,000 ms
コード長 5,218 bytes
コンパイル時間 27,318 ms
コンパイル使用メモリ 359,760 KB
最終ジャッジ日時 2025-01-16 01:48:48
ジャッジサーバーID
（参考情報） 		judge5 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 6
other AC * 24
権限があれば一括ダウンロードができます

ソースコード

diff # 

#ifdef ONLINE_JUDGE
#pragma GCC target("avx2,avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using i128 = __int128_t;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define all(x) (x).begin(), (x).end()
constexpr char ln = '\n';
istream& operator>>(istream& is, __int128_t& x) {
    x = 0;
    string s;
    is >> s;
    int n = int(s.size()), it = 0;
    if (s[0] == '-') it++;
    for (; it < n; it++) x = (x * 10 + s[it] - '0');
    if (s[0] == '-') x = -x;
    return is;
}
ostream& operator<<(ostream& os, __int128_t x) {
    if (x == 0) return os << 0;
    if (x < 0) os << '-', x = -x;
    deque<int> deq;
    while (x) deq.emplace_front(x % 10), x /= 10;
    for (int e : deq) os << e;
    return os;
}
template<class T1, class T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
    return os << "(" << p.first << ", " << p.second << ")";
}
template<class T> 
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "{";
    for (int i = 0; i < int(v.size()); i++) {
        if (i) os << ", ";
        os << v[i];
    }
    return os << "}";
}
template<class Container> inline int SZ(Container& v) { return int(v.size()); }
template<class T> inline void UNIQUE(vector<T>& v) { v.erase(unique(v.begin(), v.end()), v.end()); }
template<class T1, class T2> inline bool chmax(T1& a, T2 b) { if (a < b) {a = b; return true ;} return false ;}
template<class T1, class T2> inline bool chmin(T1& a, T2 b) { if (a > b) {a = b; return true ;} return false ;}
inline int topbit(int x) { return x == 0 ? -1 : 31 - __builtin_clz(x); }
inline int topbit(long long x) { return x == 0 ? -1 : 63 - __builtin_clzll(x); }
inline int botbit(int x) { return x == 0 ? 32 : __builtin_ctz(x); }
inline int botbit(long long x) { return x == 0 ? 64 : __builtin_ctzll(x); }
inline int popcount(int x) { return __builtin_popcount(x); }
inline int popcount(long long x) { return __builtin_popcountll(x); }
inline int kthbit(long long x, int k) { return (x>>k) & 1; }
inline constexpr long long TEN(int x) { return x == 0 ? 1 : TEN(x-1) * 10; }
inline void print() { cout << "\n"; }
template<class T>
inline void print(const vector<T>& v) {
    for (int i = 0; i < int(v.size()); i++) {
        if (i) cout << " ";
        cout << v[i];
    }
    print();
}
template<class T, class... Args>
inline void print(const T& x, const Args& ... args) {
    cout << x << " ";
    print(args...);
}
#ifdef MINATO_LOCAL
inline void debug_out() { cerr << endl; }
template <class T, class... Args>
inline void debug_out(const T& x, const Args& ... args) {
    cerr << " " << x;
    debug_out(args...);
}
#define debug(...) cerr << __LINE__ << " : [" << #__VA_ARGS__ << "] =", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
struct fast_ios { fast_ios() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

#include <atcoder/all>
using namespace atcoder;
//using mint = modint998244353;
//using mint = modint1000000007;
//using mint = modint;

int main() {

    ll ans = 0;
    auto calc=[&](const vector<int>& A,const vector<int>& B) {
        int N = A.size();
        int M = B.size();
        map<int, int> mp;
        set<int> st;
        rep(i,N) {
            mp[A[i]]++;
            if (mp[A[i]] >= (i+1)/2+1) st.emplace(A[i]);
        }
        mp.clear();
        rep(i,M) {
            mp[B[i]]++;
            if (mp[B[i]] >= (i+1)/2+1) st.emplace(B[i]);
        }
        for (auto e : st) {
            vector<ll> C(N),D(M);
            rep(i,N) {
                if (A[i]==e) C[i] = 1;
                else C[i] = -1;
                if (i) C[i] += C[i-1];
            }
            rep(i,M) {
                if (B[i]==e) D[i] = 1;
                else D[i] = -1;
                if (i) D[i] += D[i-1];
            }
            int oc = -*min_element(all(C));
            int od = -*min_element(all(D));
            int maxc = *max_element(all(C)) + oc;
            int maxd = *max_element(all(D)) + od;
            vector<ll> E(maxc+1),F(maxd+1);
            rep(i,N) E[oc+C[i]]++;
            rep(i,M) F[od+D[i]]++;
            auto G = convolution_ll(E,F);
            rrep(i,maxc+maxd+1) {
                if (i == oc+od) break;
                ans += G[i];
            }
        }
    };

    int N; cin >> N;
    vector<int> A(N);
    rep(i,N) cin >> A[i];
    auto rec=[&](auto self, int l, int r) {
        if (r-l==1) {
            ans++;
            return;
        }
        int m = (l+r)/2;
        self(self,l,m);
        self(self,m,r);
        vector<int> L,R;
        for (int i = m-1; i >= l; i--) L.emplace_back(A[i]);
        for (int i = m; i < r; i++) R.emplace_back(A[i]);
        calc(L,R);
    };
    rec(rec,0,N);
    cout << ans << ln;
}
0