oj.uz

Submission #533581

# Submission time Handle Problem Language Result Execution time Memory
533581 2022-03-06T10:42:40 Z topovik Izbori (COCI22_izbori) C++14
40 / 110
 3000 ms 31032 KB 
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define s second

using namespace std;

typedef long long ll;
typedef long double ld;

const ll oo = 1e18 + 7;

const ll N = 5e5 + 10;
const ll N1 = 5e6;
const ll M = 2e3 + 10;

vector <ll> ps[N];
ll b[N];
map <ll, ll> mp;
ll ans = 0;

int main()
{
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    ll n;
    cin >> n;
    ll a[n];
    vector <ll> cmp;
    for (ll i = 0; i < n; i++) cin >> a[i], cmp.pb(a[i]);
    sort(cmp.begin(), cmp.end());
    cmp.resize(unique(cmp.begin(), cmp.end()) - cmp.begin());
    for (ll i = 0; i < n; i++) a[i] = lower_bound(cmp.begin(), cmp.end(), a[i]) - cmp.begin();
    for (ll i = 0; i < n; i++) ps[a[i]].pb(i);
    for (ll i = 0; i < n; i++)
        if (ps[i].size() > 0)
    {
        for (ll j = 0; j < n; j++) b[j] = 0;
        for (auto j : ps[i]) b[j] = 1;
        mp.clear();
        ll sum1 = 0;
        ll kol = 0;
        for (ll j = 0; j < n; j++)
        {
            sum1 += b[j];
            mp[sum1 * 2 - (j + 1)]++;
            if (sum1 * 2 - (j + 1) > 0) kol++;
        }
        ans += kol;
        ll c = 1;
        sum1 = 0;
        for (ll j = 0; j < n; j++)
        {
            sum1 += b[j];
            mp[sum1 * 2 - (j + 1)]--;
            if (sum1 * 2 - (j + 1) >= c) kol--;

            if (b[j] == 0)
            {
                c--;
                kol += mp[c];
            }
            else
            {
                kol -= mp[c];
                c++;
            }
            ans += kol;
        }
        cout << endl;
    }
    cout << ans;
}
/*
5 3
2 1 1 2 2 3
2 3 3 4 4 5
4 1 1 2 2 3 3 4 4 5
*/

Subtask #1
10.0 / 10.0

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

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11980 KB Output is correct
2 Correct 6 ms 11964 KB Output is correct
3 Correct 6 ms 11980 KB Output is correct
4 Correct 6 ms 11980 KB Output is correct
5 Correct 6 ms 11980 KB Output is correct
6 Correct 6 ms 11980 KB Output is correct
7 Correct 117 ms 12108 KB Output is correct
8 Correct 7 ms 11980 KB Output is correct
9 Correct 10 ms 12144 KB Output is correct
10 Correct 9 ms 12236 KB Output is correct
11 Correct 9 ms 12236 KB Output is correct
12 Correct 10 ms 12236 KB Output is correct
13 Correct 10 ms 12236 KB Output is correct
14 Correct 10 ms 12236 KB Output is correct
15 Correct 9 ms 12236 KB Output is correct
16 Correct 10 ms 12236 KB Output is correct
17 Correct 8 ms 12236 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 17348 KB Output is correct
2 Correct 43 ms 18816 KB Output is correct
3 Correct 26 ms 16040 KB Output is correct
4 Correct 48 ms 18904 KB Output is correct
5 Correct 46 ms 18876 KB Output is correct
6 Correct 53 ms 19652 KB Output is correct
7 Correct 50 ms 19828 KB Output is correct
8 Correct 57 ms 19780 KB Output is correct
9 Correct 51 ms 19516 KB Output is correct
10 Correct 48 ms 19516 KB Output is correct
11 Correct 101 ms 31032 KB Output is correct

Subtask #4
0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11980 KB Output is correct
2 Correct 6 ms 11964 KB Output is correct
3 Correct 6 ms 11980 KB Output is correct
4 Correct 6 ms 11980 KB Output is correct
5 Correct 6 ms 11980 KB Output is correct
6 Correct 6 ms 11980 KB Output is correct
7 Correct 117 ms 12108 KB Output is correct
8 Correct 7 ms 11980 KB Output is correct
9 Correct 10 ms 12144 KB Output is correct
10 Correct 9 ms 12236 KB Output is correct
11 Correct 9 ms 12236 KB Output is correct
12 Correct 10 ms 12236 KB Output is correct
13 Correct 10 ms 12236 KB Output is correct
14 Correct 10 ms 12236 KB Output is correct
15 Correct 9 ms 12236 KB Output is correct
16 Correct 10 ms 12236 KB Output is correct
17 Correct 8 ms 12236 KB Output is correct
18 Correct 35 ms 17348 KB Output is correct
19 Correct 43 ms 18816 KB Output is correct
20 Correct 26 ms 16040 KB Output is correct
21 Correct 48 ms 18904 KB Output is correct
22 Correct 46 ms 18876 KB Output is correct
23 Correct 53 ms 19652 KB Output is correct
24 Correct 50 ms 19828 KB Output is correct
25 Correct 57 ms 19780 KB Output is correct
26 Correct 51 ms 19516 KB Output is correct
27 Correct 48 ms 19516 KB Output is correct
28 Correct 101 ms 31032 KB Output is correct
29 Correct 110 ms 30744 KB Output is correct
30 Execution timed out 3071 ms 16512 KB Time limit exceeded
31 Halted 0 ms 0 KB -