oj.uz

답안 #742111

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
742111 2023-05-15T15:34:53 Z Filya Izbori (COCI22_izbori) C++14
40 / 110
 71 ms 12356 KB 
/////////////////////include/////////////////////
//#include <bits/stdc++.h>
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cassert>
#include <set>
#include <map>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stdio.h>
#include <climits>
#include <numeric>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//template <typename T>
//using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
/////////////////////define/////////////////////
#define ci(x) if(x) cout << "YES" << '\n'; else cout << "NO" << '\n';
#define cii(x) if(check(x))
#define MOD 1000000007
#define MOD2 998244353
#define oo 1e9
#define ool 1e18L
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mii map<int, int>
#define vi vector<int>
#define vpi vector<pair<int, int>>
#define vll vector <ll>
#define ff first
#define ss second
#define mp make_pair
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define sz(x) (int((x).size()))
#define all(x) (x).begin(), (x).end()
#define alll(x) (x), (x) + n
#define clr(x) (x).clear();
#define fri(x) for(int i = 0; i < x; ++i)
#define frj(x) for(int j = 0; j < x; ++j)
#define frp(x) for(int p = 0; p < x; ++p)
#define frr(a, b) for(int i = a; i < b; ++i)
#define frrj(a, b) for(int j = a; j < b; ++j)
#define fra(x) for(int i = 0; i < x; ++i) cin >> a[i];
#define frb(x) for(int i = 0; i < x; ++i) cin >> b[i];
#define frs(x) for(auto it = x.begin(); it != x.end(); ++it)
#define fr(x) for(auto it : x) //el
#define fastio ios_base::sync_with_stdio(false); cin.tie(0);
#define dbg(x) cerr << #x << ": " << x << endl;
#define ce(x) cout << x << endl;
#define uniq(x) x.resize(unique(all(x)) - x.begin()); //make all one after sorting
#define blt __builtin_popcount
/////////////////////print array, vector, deque, set, multiset, pair, map /////////////////////
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]"; cout << endl;}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(stack <T> v) {cerr << "[ "; stack<T> s = v; while(s.size()) {T i = s.top(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(queue <T> v) {cerr << "[ "; queue<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(deque <T> v) {cerr << "[ "; deque<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop_front(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
/////////////////////code/////////////////////
int a[200005];
ll pref[200005];
map<int, int> cnt;
int main() {
    fastio;
    ll n; cin >> n; fra(n)
    if(n <= 2000) {
        ll ans = n; int maxi;
        fri(n) {
            cnt.clear(); 
            cnt[a[i]]++; maxi = 1;
            frrj(i + 1, n) {
                cnt[a[j]]++;
                maxi = max(maxi, cnt[a[j]]);
                if(maxi > (j-i+1)/2) ans++;
            }
        }
        cout << ans;
        return 0;
    }
    ll ans = n * (n + 1) / 2;
    cnt[0]++;
    fri(n) {
        if(a[i] == 1) pref[i]++;
        if(a[i] == 2) pref[i]--;
        pref[i + 1] = pref[i];
        ans -= cnt[pref[i]];
        cnt[pref[i]]++;
    }
    cout << ans;
    return 0;
}

//	           ♥ ♥ ♥  ♥  ♥    ♥   ♥    ♥
//	           ♥      ♥  ♥     ♥ ♥    ♥ ♥
//	           ♥ ♥ ♥  ♥  ♥      ♥    ♥   ♥
//	           ♥      ♥  ♥      ♥   ♥ ♥ ♥ ♥
//	           ♥      ♥  ♥ ♥ ♥  ♥  ♥       ♥
//
//        God loves Fil, Fil accepts God's will

Subtask #1
10.0 / 10.0

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

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 66 ms 364 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 54 ms 316 KB Output is correct
10 Correct 47 ms 212 KB Output is correct
11 Correct 46 ms 212 KB Output is correct
12 Correct 50 ms 332 KB Output is correct
13 Correct 53 ms 340 KB Output is correct
14 Correct 51 ms 340 KB Output is correct
15 Correct 46 ms 340 KB Output is correct
16 Correct 45 ms 212 KB Output is correct
17 Correct 9 ms 340 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 1940 KB Output is correct
2 Correct 15 ms 2628 KB Output is correct
3 Correct 9 ms 1732 KB Output is correct
4 Correct 17 ms 2780 KB Output is correct
5 Correct 16 ms 2900 KB Output is correct
6 Correct 18 ms 3080 KB Output is correct
7 Correct 18 ms 3048 KB Output is correct
8 Correct 18 ms 3092 KB Output is correct
9 Correct 17 ms 3060 KB Output is correct
10 Correct 16 ms 2956 KB Output is correct
11 Correct 71 ms 12356 KB Output is correct

Subtask #4
0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 66 ms 364 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 54 ms 316 KB Output is correct
10 Correct 47 ms 212 KB Output is correct
11 Correct 46 ms 212 KB Output is correct
12 Correct 50 ms 332 KB Output is correct
13 Correct 53 ms 340 KB Output is correct
14 Correct 51 ms 340 KB Output is correct
15 Correct 46 ms 340 KB Output is correct
16 Correct 45 ms 212 KB Output is correct
17 Correct 9 ms 340 KB Output is correct
18 Correct 12 ms 1940 KB Output is correct
19 Correct 15 ms 2628 KB Output is correct
20 Correct 9 ms 1732 KB Output is correct
21 Correct 17 ms 2780 KB Output is correct
22 Correct 16 ms 2900 KB Output is correct
23 Correct 18 ms 3080 KB Output is correct
24 Correct 18 ms 3048 KB Output is correct
25 Correct 18 ms 3092 KB Output is correct
26 Correct 17 ms 3060 KB Output is correct
27 Correct 16 ms 2956 KB Output is correct
28 Correct 71 ms 12356 KB Output is correct
29 Incorrect 28 ms 4524 KB Output isn't correct
30 Halted 0 ms 0 KB -