제출 #893794

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
893794		vjudge1	Izbori (COCI22_izbori)	C++17	40 / 110	3043 ms	6236 KiB

Main

#include<bits/stdc++.h>

using namespace std;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef long long ll;
#define int ll
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define pb push_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define mispertion ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define F first
#define S second
#define getlast(s) (*s.rbegin())
#define debg cout << "OK\n"

const ld PI = 3.1415926535;
const int N = 5e3 + 2;
const int M = 7e6 + 1;
int mod = 1e9+7;
const int infi = INT_MAX;
const ll infl = LLONG_MAX;
const int P = 31;

int mult(int a, int b) {
    return a * 1LL * b % mod;
}

int sum(int a, int b) {
    a %= mod; 
    if (a + b < 0)
        return a + b + mod;
    if (a + b >= mod)
        return a + b - mod;
    return a + b;
}

ll binpow(ll a, ll n) {
    if (n == 0)
        return 1;
    if (n % 2 == 1) {
        return binpow(a, n - 1) * a % mod;
    } else {
        ll b = binpow(a, n / 2);
        return b * b % mod;
    }
}

struct fenwick{
    vector<int> bt;
    int sz = 0;
    fenwick(int n){
        bt.assign(n + 1, 0);
        sz = n;
    }

    int get(int r){
        int ret = 0;
        for(; r >= 0; r = (r & (r + 1)) - 1)
            ret += bt[r];
        return ret;
    }

    void add(int i, int v){
        for(; i <= sz; i = (i | (i + 1)))
            bt[i] += v;
    }
};

void solve(){
    int n;
    cin >> n;
    set<int> st;
    int a[n + 1];
    for(int i = 1; i <= n; i++)
        cin >> a[i], st.insert(a[i]);
    
    int ans = 0;
    for(auto e : st){
        fenwick f = fenwick(2 * n + 4);
        int cur = 0;
        for(int i = 1; i <= n; i++){
            f.add(cur + n, 1);
            if(a[i] != e)
                cur--;
            else
                cur++;
            ans += f.get(cur - 1 + n);
        }
    }
    cout << ans << '\n';
}   

signed main() {
    mispertion;
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 15 / 15
• Subtask 3: 15 / 15
• Subtask 4: 0 / 70