oj.uz

Submission #893555

# Submission time Handle Problem Language Result Execution time Memory
893555 2023-12-27T06:59:30 Z vjudge1 Izbori (COCI22_izbori) C++17
40 / 110
 54 ms 11216 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()

const int N = (int)2e5 + 5;
const ll mod = (int)1e9 + 7;
const ll inf = (int)(1e9) + 100;

map<int, int> ma;
int cnt[N], n, a[N];
bool cs3 = 1;


void sub3() {
    map<int, int> CNT;
    ll pref = 0, ans = 0;
    CNT[0]++;
    for (int i = 1; i <= n; i++) {
        if (a[i] == 2) pref += 1;
        else pref -= 1;
        ans += CNT[pref];
        CNT[pref]++;
    }
    cout << (n * 1LL * (n + 1)) / 2 - ans;
}

void solve() {
    cin >> n;
    vector<int> v;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        v.pb(a[i]);
        if (a[i] > 2) cs3 = 0;
    }
    sort(all(v));
    v.erase(unique(all(v)), v.end());
    int timer = 0;
    for (auto i : v) {
        ma[i] = ++timer;
    }
    if (cs3) {
        sub3();
        return;
    }
    for (int i = 1; i <= n; i++) a[i] = ma[a[i]];
    if (n <= 2000) {
        int ans = 0;
        for (int i = 1; i <= n; i++) {
                int mx = 0;
            for (int j = 1; j <= n; j++) {
                cnt[j] = 0;
            }
            for (int j = i; j <= n; j++) {
                cnt[a[j]]++;
                mx = max(mx, cnt[a[j]]);
                if (mx >= (j - i + 1) / 2 + 1) ans++;

            }
        }
        cout << ans;
        return;
    }
}

signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int T = 1;
    //cin >> T;
    while (T--) solve();
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 4 ms 348 KB Output is correct
11 Correct 4 ms 500 KB Output is correct
12 Correct 4 ms 348 KB Output is correct
13 Correct 4 ms 348 KB Output is correct
14 Correct 5 ms 496 KB Output is correct
15 Correct 4 ms 348 KB Output is correct
16 Correct 4 ms 496 KB Output is correct
17 Correct 6 ms 496 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 2012 KB Output is correct
2 Correct 16 ms 2008 KB Output is correct
3 Correct 9 ms 1248 KB Output is correct
4 Correct 16 ms 1920 KB Output is correct
5 Correct 17 ms 2012 KB Output is correct
6 Correct 18 ms 1932 KB Output is correct
7 Correct 17 ms 2012 KB Output is correct
8 Correct 18 ms 2012 KB Output is correct
9 Correct 17 ms 2012 KB Output is correct
10 Correct 17 ms 2012 KB Output is correct
11 Correct 54 ms 11216 KB Output is correct

Subtask #4
0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 4 ms 348 KB Output is correct
11 Correct 4 ms 500 KB Output is correct
12 Correct 4 ms 348 KB Output is correct
13 Correct 4 ms 348 KB Output is correct
14 Correct 5 ms 496 KB Output is correct
15 Correct 4 ms 348 KB Output is correct
16 Correct 4 ms 496 KB Output is correct
17 Correct 6 ms 496 KB Output is correct
18 Correct 12 ms 2012 KB Output is correct
19 Correct 16 ms 2008 KB Output is correct
20 Correct 9 ms 1248 KB Output is correct
21 Correct 16 ms 1920 KB Output is correct
22 Correct 17 ms 2012 KB Output is correct
23 Correct 18 ms 1932 KB Output is correct
24 Correct 17 ms 2012 KB Output is correct
25 Correct 18 ms 2012 KB Output is correct
26 Correct 17 ms 2012 KB Output is correct
27 Correct 17 ms 2012 KB Output is correct
28 Correct 54 ms 11216 KB Output is correct
29 Incorrect 18 ms 2008 KB Output isn't correct
30 Halted 0 ms 0 KB -