Submission #1248120

#	Time	Username	Problem	Language	Result	Execution time	Memory
1248120		huydayy	Izbori (COCI22_izbori)	C++20	110 / 110	580 ms	6848 KiB

Main

#include <bits/stdc++.h>
#define TASK "VBAUCU"
#define int long long
#define double long double
#define fi first
#define se second
#define pb push_back
#define ii pair<int, int>
#define vi vector<int>
#define vvi vector<vi>
#define vii vector<ii>
#define reset(f, x) memset(f, x, sizeof(f))
#define all(x) x.begin(), x.end()
#define sz(x) (long long)x.size()
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORD(i, b, a) for (int i = (b), _a = (a); i >= _a; --i)
#define FORV(v, H) for (auto &v: H)
#define __builtin_popcount __builtin_popcountll
#define BIT(mask, i) ((mask >> i) & 1ll)
#define MASK(i) (1ll << (i))
#define ONBIT(mask, i) (mask  (1ll << (i)))
#define OFFBIT(mask, i) (mask &~ (1ll << (i)))
#define mid(l, r) ((l + r) >> 1)
#define left(id) (id << 1)
#define right(id) ((id << 1)  1)
#define TIME (1.0 * clock() / CLOCKS_PER_SEC)
#define UNIQUE(x) sort(all(x)); x.resize(distance(x.begin(), unique(all(x))))
#define BUG1(a) cout << a << '\n'
#define BUG2(a, b) cout << a << " " << b << '\n'
#define BUG3(a, b, c) cout << a << " " << b << " " << c << '\n'
#define BUG4(a, b, c, d) cout << a << " " << b << " " << c << " " << d << '\n'
#define BUG5(a, b, c, d, e) cout << a << " " << b << " " << c << " " << d << " " << e << '\n'
#define BUG6(a, b, c, d, e, f) cout << a << " " << b << " " << c << " " << d << " " << e << " " << f << '\n'

using namespace std;

template <class X, class Y> bool maximize(X &A, const Y &B){
    if (A < B) return A = B, true;
    return false;
}

template <class X, class Y> bool minimize(X &A, const Y &B){
    if (A > B) return A = B, true;
    return false;
}

const int oo  = 1e18;
const int MOD = 1e9 + 7;
const int MAXN = 2e5 + 100;
const int LOG = 16;
const int base = 311;
const int BLOCK = 447;
const int dx[] = {0, 0, 1, 0, -1};
const int dy[] = {0, 1, 0, -1, 0};

int N;
int a[MAXN];

void COMPRESS(){
    vi v;
    FOR(i, 1, N) v.push_back(a[i]);
    UNIQUE(v);
    FOR(i, 1, N) a[i] = lower_bound(all(v), a[i]) - v.begin() + 1;
}

namespace Sub1{

    static const int MAXN = 2000 + 5;

    int cnt[MAXN];

    void SOLVE(){
        int ans = 0;
        FOR(l, 1, N){
            int mx = 0;
            FOR(r, l, N){
                maximize(mx, ++cnt[a[r]]);
                if (mx * 2 > (r - l + 1)) ans++;
            }
            FOR(r, l, N) cnt[a[r]]--;
        }
        cout << ans << '\n';
    }

}

namespace Sub2{

    int cnt[MAXN], dem[MAXN], b[MAXN], num[2 * MAXN];

    void SOLVE(){
        FOR(i, 1, N) cnt[a[i]]++;
        int ans = 0;

        // cnt[x] <= sqrt(N)
        FOR(l, 1, N){
            int mx = 0;
            FOR(r, l, min(l + 2 * BLOCK  - 1, N)){
                if (cnt[a[r]] <= BLOCK) maximize(mx, ++dem[a[r]]);
                if (2 * mx > r - l + 1) ans++;
            }
            FOR(r, l, min(l + 2 * BLOCK  - 1, N)) if (cnt[a[r]] <= BLOCK) dem[a[r]]--;
        }

        //cnt[x] > sqrt(N)
        vi heavy = {};
        FOR(i, 1, N){
            if (cnt[a[i]] > BLOCK){
                heavy.push_back(a[i]);
                cnt[a[i]] = 0;
            }
        }
        for(int x : heavy){
            FOR(i, 1, N) b[i] = (a[i] == x ? 1 : -1);
            reset(num, 0);
            int pref = N, sum = 0;
            //tranh cho pref am
            num[pref]++;
            FOR(i, 1, N){
                pref += b[i];
                if (b[i] == 1) sum += num[pref - 1];
                else sum -= num[pref];
                ans += sum;
                num[pref]++;
            }
        }
        cout << ans << '\n';
    }

}

void PROCESS(){
    if (N <= 2000)
        Sub1::SOLVE();
    else
        Sub2::SOLVE();
}

main(){
    if (fopen(TASK".inp", "r")){
        freopen(TASK".inp", "r", stdin);
        freopen(TASK".out", "w", stdout);
    }
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin >> N;
    FOR(i, 1, N) cin >> a[i];
    COMPRESS();
    PROCESS();
    return 0;
}


















































/*
     ___  __    ___  _______   ___  ___          ________  ___  ________          ___  ___  ___  ___      ___    ___
    \  \\  \ |\  \|\  ___ \ |\  \|\  \        |\   ____\|\  \|\   __  \        |\  \|\  \|\  \|\  \    |\  \  / / |
    \ \  \/  /|\ \  \ \   __/|\ \  \\\  \       \ \  \___|\ \  \ \  \|\  \       \ \  \\\  \ \  \\\  \   \ \  \/ / /
     \ \   ___  \ \  \ \  \_|/_\ \  \\\  \       \ \  \  __\ \  \ \   __  \       \ \   __  \ \  \\\  \   \ \   / /
      \ \  \\ \  \ \  \ \  \_|\ \ \  \\\  \       \ \  \|\  \ \  \ \  \ \  \       \ \  \ \  \ \  \\\  \   \/  / /
       \ \__\\ \__\ \__\ \_______\ \_______\       \ \_______\ \__\ \__\ \__\       \ \__\ \__\ \_______\__/  / /
        \|__| \|__|\|__|\|_______|\|_______|        \|_______|\|__|\|__|\|__|        \|__|\|__|\|_______|\___/ /
                                                                                                        \|___|/
    Author: Kieu Gia Huy a.k.a kiwi
    From: C.H.V with luv <3
    ...

*/

Compilation message (stderr)

Main.cpp:139:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  139 | main(){
      | ^~~~
Main.cpp: In function 'int main()':
Main.cpp:141:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  141 |         freopen(TASK".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:142:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  142 |         freopen(TASK".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

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