oj.uz

답안 #893669

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
893669 2023-12-27T08:57:23 Z vjudge1 Izbori (COCI22_izbori) C++17
40 / 110
 2898 ms 10960 KB 
#include <iostream>
#include <fstream>
#include <iomanip>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <ctime>
#include <algorithm>
#include <sstream>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <cstdlib>
#include <cstdio>
#include <iterator>
#include <functional>
#include <unordered_set>
#include <unordered_map>
#include <stdio.h>
#include <bitset>
#include <cstdint>
#include <cassert>
#include <functional>
#include <complex>
#include <climits>
#include <random>
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")

using namespace std;

#define pb push_back
#define F first
#define S second
#define ll long long
#define ull unsigned long long
#define all(x) x.begin(), x.end() 
#define speed ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
const int mod = (int) 1e9 + 7;
const int N = (int) 2e5 + 1, bruh = 450;
 
ll a[N], n, k;
map<int, int> cnt;
int cnt1[N];
 
signed main(){
   	speed;
   	cin >> n;
    vector<pair<int, int>> v;
   	for(int i = 1; i <= n; i++){
   		cin >> a[i];
        v.pb({a[i], i});
   	} 
    sort(all(v));
    int prev = -1, cur = 0;
    for(auto [x, y] : v){
        if(x != prev){
            ++cur;
            prev = x;
            a[y] = cur;
        }
        else a[y] = cur;
    }
    for(int i = 1; i <= n; i++){
        cnt[a[i]]++;
    }
   	ll ans = 0;
   	for(auto [x, sz] : cnt){
   		if(sz > bruh){
	   		ll mp[n * 2 + 1];
            for(int i = 0; i <= 2 * n + 1; i++) mp[i] = 0;
	        ll cur = 0, act = 0;
	        ans = (1LL * (n * (n + 1))) / 2LL;
	        for(ll i = 1; i <= n; i++){
		        if(a[i] == x) cur--;
		        else cur++;
		        mp[cur + n]++;
	        }
	        cur = 0;
	        for(ll i = 1; i <= n; i++){
		        ans -= mp[act + n];
		        if(a[i] == x){
			        cur--;
			        act--;
		        }
		        else{
			        cur++;
			        act++;
		        }
		        mp[cur + n]--;
	        }	
        }
   	}
   	for(int i = 1; i <= n; i++){
        memset(cnt1, 0, sizeof(cnt1));
   		int lst = -1, lstA = -1;
   		for(int j = i; j <= n; j++){
   			if((j - i + 1) > 2 * bruh) break;
   			if(a[j] == lstA) lst++;
   			++cnt1[a[j]];
   			int sz = (j - i) + 1;
   			if(lst > (sz / 2) && cnt[lstA] <= bruh) ans++;
   			else if(cnt1[a[j]] > (sz / 2) && cnt[a[j]] <= bruh){
   				ans++;
   				lst = cnt1[a[j]];
   				lstA = a[j];
   			}
   		}
   	}
   	cout << ans;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2680 KB Output is correct
3 Correct 4 ms 2652 KB Output is correct
4 Correct 4 ms 2652 KB Output is correct
5 Correct 5 ms 2652 KB Output is correct
6 Correct 4 ms 2652 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2680 KB Output is correct
3 Correct 4 ms 2652 KB Output is correct
4 Correct 4 ms 2652 KB Output is correct
5 Correct 5 ms 2652 KB Output is correct
6 Correct 4 ms 2652 KB Output is correct
7 Correct 12 ms 2652 KB Output is correct
8 Correct 2 ms 2652 KB Output is correct
9 Correct 26 ms 2652 KB Output is correct
10 Correct 26 ms 2648 KB Output is correct
11 Correct 26 ms 2652 KB Output is correct
12 Correct 29 ms 2900 KB Output is correct
13 Correct 26 ms 2652 KB Output is correct
14 Correct 26 ms 2648 KB Output is correct
15 Correct 27 ms 2648 KB Output is correct
16 Correct 26 ms 2652 KB Output is correct
17 Correct 27 ms 2652 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1857 ms 5844 KB Output is correct
2 Correct 2366 ms 6852 KB Output is correct
3 Correct 1384 ms 5080 KB Output is correct
4 Correct 2631 ms 6904 KB Output is correct
5 Correct 2678 ms 7116 KB Output is correct
6 Correct 2898 ms 7372 KB Output is correct
7 Correct 2855 ms 7372 KB Output is correct
8 Correct 2852 ms 7632 KB Output is correct
9 Correct 2733 ms 7636 KB Output is correct
10 Correct 2829 ms 7888 KB Output is correct
11 Correct 2758 ms 7636 KB Output is correct

Subtask #4
0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2680 KB Output is correct
3 Correct 4 ms 2652 KB Output is correct
4 Correct 4 ms 2652 KB Output is correct
5 Correct 5 ms 2652 KB Output is correct
6 Correct 4 ms 2652 KB Output is correct
7 Correct 12 ms 2652 KB Output is correct
8 Correct 2 ms 2652 KB Output is correct
9 Correct 26 ms 2652 KB Output is correct
10 Correct 26 ms 2648 KB Output is correct
11 Correct 26 ms 2652 KB Output is correct
12 Correct 29 ms 2900 KB Output is correct
13 Correct 26 ms 2652 KB Output is correct
14 Correct 26 ms 2648 KB Output is correct
15 Correct 27 ms 2648 KB Output is correct
16 Correct 26 ms 2652 KB Output is correct
17 Correct 27 ms 2652 KB Output is correct
18 Correct 1857 ms 5844 KB Output is correct
19 Correct 2366 ms 6852 KB Output is correct
20 Correct 1384 ms 5080 KB Output is correct
21 Correct 2631 ms 6904 KB Output is correct
22 Correct 2678 ms 7116 KB Output is correct
23 Correct 2898 ms 7372 KB Output is correct
24 Correct 2855 ms 7372 KB Output is correct
25 Correct 2852 ms 7632 KB Output is correct
26 Correct 2733 ms 7636 KB Output is correct
27 Correct 2829 ms 7888 KB Output is correct
28 Correct 2758 ms 7636 KB Output is correct
29 Correct 2781 ms 7628 KB Output is correct
30 Correct 573 ms 4452 KB Output is correct
31 Correct 1085 ms 6604 KB Output is correct
32 Correct 2799 ms 10960 KB Output is correct
33 Correct 1212 ms 6872 KB Output is correct
34 Correct 1259 ms 7108 KB Output is correct
35 Correct 774 ms 5592 KB Output is correct
36 Correct 482 ms 4572 KB Output is correct
37 Correct 564 ms 4816 KB Output is correct
38 Incorrect 2673 ms 7816 KB Output isn't correct
39 Halted 0 ms 0 KB -