oj.uz

Submission #1055735

# Submission time Handle Problem Language Result Execution time Memory
1055735 2024-08-13T04:38:17 Z manhlinh1501 Parkovi (COCI22_parkovi) C++17
0 / 110
 518 ms 21080 KB 
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
const int MAXN = 5e5 + 5;
const int BLOCK_SIZE = 475;
#define ALL(a) (a).begin(), (a).end()
#define LB(a, x) (lower_bound(ALL(a), x) - (a).begin() + 1)

int N;
int a[MAXN];
vector<int> pos[MAXN];
int prefix[MAXN];
int cnt[MAXN];

struct fenwick {
    int N;
    int tree[MAXN];

    void update(int x, int v) {
        for(; x < MAXN; x += (x & -x)) tree[x] += v;
    }

    int calc(int x) {
        int res = 0;
        for(; x; x -= (x & -x)) res += tree[x];
        return res;
    }
} BIT;

void compress() {
    vector<int> temp;
    for(int i = 1; i <= N; i++) temp.emplace_back(a[i]);
    sort(ALL(temp));
    temp.resize(unique(ALL(temp)) - temp.begin());
    for(int i = 1; i <= N; i++) a[i] = LB(temp, a[i]);
}

signed main() {
#define TASK "baucu"

    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(int i = 1; i <= N; i++) cin >> a[i];
    compress();
    for(int i = 1; i <= N; i++) pos[a[i]].emplace_back(i);
    i64 ans = 0;
    for(int i = 1; i <= N; i++) {
        int maxx = 0;
        for(int j = i; j <= min(N, i + 2 * BLOCK_SIZE - 1); j++) {
            if(pos[a[j]].size() <= BLOCK_SIZE) {
                cnt[a[j]]++;
                maxx = max(maxx, cnt[a[j]]);
            }
            if(maxx * 2 > (j - i + 1))
                ans++;
        }
        for(int j = i; j <= min(N, i + 2 * BLOCK_SIZE - 1); j++) {
            if(pos[a[j]].size() <= BLOCK_SIZE)
                cnt[a[j]]--;
        }
    }
    BIT.update(N + 1, 1);
    for(int i = 1; i <= N; i++) {
        if(pos[i].size() > BLOCK_SIZE) {
            for(int j = 1; j <= N; j++) prefix[j] = -1;
            for(int p : pos[i]) prefix[p] = 1;
            for(int j = 1; j <= N; j++) prefix[j] += prefix[j - 1];
            for(int j = 1; j <= N; j++) prefix[j] += (N + 1);
            for(int j = 1; j <= N; j++) {
                ans += BIT.calc(prefix[j] - 1);
                BIT.update(prefix[j], 1);
            }
            for(int j = 1; j <= N; j++) BIT.update(prefix[j], -1);
        }
    }
    cout << ans;
    return (0 ^ 0);
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:42:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |         freopen(TASK ".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:43:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |         freopen(TASK ".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 14684 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 518 ms 21080 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 503 ms 20928 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #4
0 / 60.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 14684 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -