oj.uz

Submission #880593

# Submission time Handle Problem Language Result Execution time Memory
880593 2023-11-29T17:14:28 Z tsumondai Izbori (COCI22_izbori) C++14
10 / 110
 243 ms 19932 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define fi first
#define se second
#define pb push_back
#define foru(i, l, r) for(int i = l; i <= r; i++)
#define ford(i, r, l) for(int i = r; i >= l; i--)
#define __TIME  (1.0 * clock() / CLOCKS_PER_SEC)

typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;
 
const int N = 1e6 + 5, BLOCK_SIZE=450;
 
const int oo = 1e9, mod = 1e9 + 7;
 
int n, m, k, a[N], cnt[N], mp[N], s[N], t[N];
vector<int> arr;

void update(int pos, int val){
    for (int i=pos; i<BLOCK_SIZE; i+=i&(-i)) t[i]+=val;
}
 
int get(int pos){
    if (pos<0) return 0;
    int sum=0;
    for (int i=pos; i; i-=i&(-i)) sum+=t[i];
    return sum;
}

void process() {
	cin >> n;
    long long ans=0;
    for (int i=1; i<=n; ++i) cin >> a[i];
    vector<int> sus(a+1, a+n+1);
    sort(sus.begin(),sus.end()); sus.resize(unique(sus.begin(),sus.end())-sus.begin());
    for (int i=1; i<=n; ++i) a[i]=lower_bound(sus.begin(),sus.end(), a[i])-sus.begin()+1;
    for (int i=1; i<=n; ++i) ++mp[a[i]];
    for (int l=1; l<=n; ++l){
        int mx=0;
        for (int r=l; r<=n && r-l+1<=2*BLOCK_SIZE; ++r){
            if (mp[a[r]]<=BLOCK_SIZE){
                ++cnt[a[r]];
                mx=max(mx, cnt[a[r]]);
            }
            if (mx*2>r-l+1) ++ans;
        }
        for (int r=l; r<=n && r-l+1<=2*BLOCK_SIZE; ++r){
            if (mp[a[r]]<=BLOCK_SIZE) --cnt[a[r]];
        }
    }
    for (int i=1; i<=n; ++i){
        if (mp[i]<=BLOCK_SIZE) continue;
        memset(s, 0, sizeof s);
        memset(t, 0, sizeof t);
        for (int j=1; j<=n; ++j) if (a[j]==i) ++s[j]; else --s[j];
        partial_sum(s, s+n+1, s);
        update(0+n+1, 1);
        for (int j=1; j<=n; ++j){
            ans+=get(s[j]-1+n+1);
            update(s[j]+n+1, 1);
        }
    }
    cout << ans;
    return;
}

signed main() {
    cin.tie(0)->sync_with_stdio(false);
    //freopen(".inp", "r", stdin);
    //freopen(".out", "w", stdout);
    process();
    cerr << "Time elapsed: " << __TIME << " s.\n";
    return 0;
}

/*
Xét các trường hợp đặc biệt
Kiểm tra lại input/output
Cố gắng trâu
Lật ngược bài toán
Keep calm and get VOI 
Flow:

*/

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 2 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 4 ms 4444 KB Output is correct
10 Correct 4 ms 4444 KB Output is correct
11 Correct 4 ms 4444 KB Output is correct
12 Correct 5 ms 4444 KB Output is correct
13 Correct 6 ms 4440 KB Output is correct
14 Correct 6 ms 4444 KB Output is correct
15 Correct 4 ms 4452 KB Output is correct
16 Correct 4 ms 4444 KB Output is correct
17 Incorrect 6 ms 19036 KB Output isn't correct
18 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 243 ms 19932 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 2 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 4 ms 4444 KB Output is correct
10 Correct 4 ms 4444 KB Output is correct
11 Correct 4 ms 4444 KB Output is correct
12 Correct 5 ms 4444 KB Output is correct
13 Correct 6 ms 4440 KB Output is correct
14 Correct 6 ms 4444 KB Output is correct
15 Correct 4 ms 4452 KB Output is correct
16 Correct 4 ms 4444 KB Output is correct
17 Incorrect 6 ms 19036 KB Output isn't correct
18 Halted 0 ms 0 KB -