Submission #533493

#	Time	Username	Problem	Language	Result	Execution time	Memory
533493		Slavita	Izbori (COCI22_izbori)	C++14	25 / 110	89 ms	1612 KiB

Main

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define ve vector<int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pi pair<int,int>
#define all(v) v.begin(),v.end()
#define si(v) (int)v.size()
#define en '\n'
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ordered_muiltiset tree<int, null_type,less_equal<>, rb_tree_tag,tree_order_statistics_node_update>
//#define int long long
using namespace std;
//using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned long long ull;

const int N = 2e5 + 228;
const int big = 1e9 + 228;
const ll llbig = 1e18 + 228;
//ordered_set os; // os.order_of_key(4), (*os.find_by_order(5))
int n, m, ans, a[N], pr[N];
map<int, int> mem;

int get(int l, int r){
    return pr[r] - pr[l - 1];
}

//#undef int
int main(){
    //#define int long long
    iostream::sync_with_stdio(false); cin.tie(0); ios_base::sync_with_stdio(false); cout.tie(0);
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    cin >> n;
    for (int i = 1; i <= n; i++){
        cin >> a[i];
        pr[i] = pr[i - 1] + (a[i] == 1);
    }

    if (n > 2007){
        for (int i = 1; i <= n; i++){
            int l = 1, r = i;
            while(l < r){
                int md = (l + r + 1) / 2;
                if (a[i] == 1){
                    if (get(md, i) > (i - md + 1) / 2) r = md - 1; else l = md;
                }

                if (a[i] == 2){
                    if (get(md, i) < (i - md + 1) / 2) r = md - 1; else l = md;
                }
            }
            ans += i - l + 1;
        }
        cout << ans;
        return 0;
    }

    for (int i = 1; i <= n; i++){
        int cur = a[i], an = 0;
        mem.clear();
        for (int j = i; j <= n; j++){
            mem[a[j]]++;
            if (mem[a[j]] > mem[cur]) cur = a[j];
            if (mem[cur] > (j - i + 1) / 2) an++;
        }
        ans += an;
    }
    cout << ans;
    return 0;
}

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