oj.uz

Submission #950652

# Submission time Handle Problem Language Result Execution time Memory
950652 2024-03-20T14:24:02 Z vjudge1 Izbori (COCI22_izbori) C++17
110 / 110
 571 ms 5732 KB 
#pragma GCC optimize("Ofast")
#pragma GCC target("sse4")
 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define int128 __int128_t
#define double long double
#define gcd __gcd
#define lcm(a, b) ((a)/gcd(a, b)*(b))
#define sqrt sqrtl
#define log2 log2l
#define log10 log10l
#define floor floorl
#define to_string str
#define yes cout << "YES"
#define no cout << "NO"
#define trav(i, a) for (auto &i: (a))
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define sz(a) (int)a.size()
#define Max(a) *max_element(all(a))
#define Min(a) *min_element(all(a))
#define Find(a, n) (find(all(a), n) - a.begin())
#define Count(a, n) count(all(a), n)
#define Upper(a, n) (upper_bound(all(a), n) - a.begin())
#define Lower(a, n) (lower_bound(all(a), n) - a.begin())
#define next_perm(a) next_permutation(all(a))
#define prev_perm(a) prev_permutation(all(a))
#define sorted(a) is_sorted(all(a))
#define sum(a) accumulate(all(a), 0)
#define sumll(a) accumulate(all(a), 0ll)
#define Sort(a) sort(all(a))
#define Reverse(a) reverse(all(a))
#define Unique(a) Sort(a), (a).resize(unique(all(a)) - a.begin())
#define pb push_back
#define eb emplace_back
#define open(s) freopen(s, "r", stdin)
#define write(s) freopen(s, "w", stdout)
#define fileopen(s) open((string(s) + ".inp").c_str()), write((string(s) + ".out").c_str());
#define For(i, a, b) for (auto i = (a); i < (b); i++)
#define Fore(i, a, b) for (auto i = (a); i >= (b); i--)
#define FOR(i, a, b) for (auto i = (a); i <= (b); i++)
#define ret(s) return void(cout << s);

const int mod = 1e9 + 7, mod2 = 998244353;
const double PI = acos(-1);
const ull npos = string::npos;
const int dx[] = {0, 0, -1, 1}, dy[] = {-1, 1, 0, 0};
using pii = pair<int, int>;
using pll = pair<ll, ll>;
mt19937 mt(chrono::system_clock::now().time_since_epoch().count());
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<double> vdo;
typedef vector<vdo> vvdo;
typedef vector<string> vs;
typedef vector<pii> vpair;
typedef vector<vpair> vvpair;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef priority_queue<int> pq;
typedef priority_queue<int, vi, greater<int>> pqg;
typedef priority_queue<ll> pqll;
typedef priority_queue<ll, vll, greater<ll>> pqgll;
 
ll power(ll a, ll b, int m){ll x = 1;a%=m;while (b) {if (b & 1) x = x*a % m;a = a*a % m;b>>=1;}return x;}
ll power(ll a, ll b){ll x = 1;while (b) {if (b & 1) x = x*a;a = a*a;b>>=1;}return x;}
ll ceil(ll a, ll b){return (a + b - 1)/b;}
ll to_int(const string &s){ll x = 0; for (int i = (s[0] == '-'); i < sz(s); i++) x = x*10 + s[i] - '0';return x*(s[0] == '-' ? -1: 1);}
bool is_prime(ll n) {if (n < 2) return 0;if (n < 4) return 1;if (n % 2 == 0 || n % 3 == 0) return 0;for (ll i = 5; i*i <= n; i+=6) {if(n % i == 0 || n % (i + 2) == 0) return 0;}return 1;}
bool is_square(ll n) {ll k = sqrt(n); return k*k == n;}
ll factorial(int n) {ll x = 1;for (int i = 2; i <= n; i++) x*=i;return x;}
ll factorial(int n, int m) {ll x = 1;for (ll i = 2; i <= n; i++) x = x*i % m;return x;}
bool is_power(ll n, ll k) {while (n % k == 0) n/=k;return n == 1ll;}
string str(ll n) {if (n == 0) return "0"; string s = ""; bool c = 0; if (n < 0) c = 1, n = -n; while (n) {s+=n % 10 + '0'; n/=10;} if (c) s+='-'; Reverse(s); return s;}
string repeat(const string &s, int n) {if (n < 0) return ""; string x = ""; while (n--) x+=s; return x;}
string bin(ll n) {string s = ""; while (n) {s+=(n & 1) + '0'; n>>=1;} Reverse(s); return s;}
void sieve(vector<bool> &a) {int n = a.size(); a[0] = a[1] = 0; for (int i = 4; i < n; i+=2) a[i] = 0; for (int i = 3; i*i < n; i+=2) {if (a[i]) {for (int j = i*i; j < n; j+=(i << 1)) a[j] = 0;}}}
void sieve(vector<int> &a) {int n = a.size(); for (int i = 2; i < n; i+=2) a[i] = 2; for (int i = 3; i*i < n; i+=2) {if (!a[i]) {for (int j = i; j < n; j+=(i << 1)) a[j] = i;}} for (int i = 3; i < n; i+=2) {if (!a[i]) a[i] = i;}}
void sieve(int a[], int n) {for (int i = 2; i < n; i+=2) a[i] = 2; for (int i = 3; i*i < n; i+=2) {if (!a[i]) {for (int j = i; j < n; j+=(i << 1)) a[j] = i;}} for (int i = 3; i < n; i+=2) {if (!a[i]) a[i] = i;}}
vector<pii> factorize(int n) {vector<pii> a; for (int i = 2; i*i <= n; i++) {if (n % i == 0) {int k = 0; while (n % i == 0) k++, n/=i; a.emplace_back(i, k);}} if (n > 1) a.emplace_back(n, 1); return a;}
int rand(int l, int r) {return uniform_int_distribution<int>(l, r)(mt);}
int Log2(int n) {return 31 - __builtin_clz(n);}
template<class T> void compress(vector<T> &a) {vector<T> b; for (T &i: a) b.push_back(i); sort(all(b)); b.resize(unique(all(b)) - b.begin()); for (T &i: a) i = lower_bound(all(b), i) - b.begin() + 1;}

template<class A, class B> istream& operator>>(istream& in, pair<A, B> &p) {in >> p.first >> p.second; return in;}
template<class A, class B> ostream& operator<<(ostream& out, const pair<A, B> &p) {out << p.first << ' ' << p.second; return out;}
template<class T> istream& operator>>(istream& in, vector<T> &a) {for (auto &i: a) in >> i; return in;}
template<class T> ostream& operator<<(ostream& out, const vector<T> &a) {for (auto &i: a) out << i << ' '; return out;}
template<class T> istream& operator>>(istream& in, vector<vector<T>> &a) {for (auto &i: a) in >> i; return in;}
template<class T> ostream& operator<<(ostream& out, const vector<vector<T>> &a) {for (auto &i: a) out << i << '\n'; return out;}
template<class T> istream& operator>>(istream& in, deque<T> &a) {for (auto &i: a) in >> i; return in;}
template<class T> ostream& operator<<(ostream& out, const deque<T> &a) {for (auto &i: a) out << i << ' '; return out;}
// istream& operator>>(istream& in, __int128_t &a) {string s; in >> s; a = 0; for (auto &i: s) a = a*10 + (i - '0'); return in;}
// ostream& operator<<(ostream& out, __int128_t a) {string s = ""; while (a > 0) {s+=(int)a % 10 + '0'; a/=10;} Reverse(s); out << s; return out;}

const int N = 2e5 + 3;
int c[N], f[N], v[2*N], p[2*N];
int main() {
    ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    cout << fixed << setprecision(10);
    int n; cin >> n;
    vi a(n); cin >> a;
    compress(a);
    trav(i,a) c[i]++;
    int sz = sqrt(n);
    ll x = 0;
    For(i,0,n){
        int k = min(i + 2*sz - 1, n - 1);
        int t = 0;
        FOR(j,i,k){
            if (c[a[j]] <= sz) {
                f[a[j]]++;
                t = max(t, f[a[j]]);
            }
            if (t*2 > j - i + 1) x++;
        }
        FOR(j,i,k){
            if (c[a[j]] <= sz) f[a[j]] = 0;
        }
    }
    FOR(i,1,n){
        if (c[i] > sz) {
            memset(v, 0, sizeof(v)); memset(p, 0, sizeof(p));
            int l = n + 2; v[l]++;
            For(j,0,n){
                if (a[j] == i) l++;
                else l--;
                v[l]++;
                p[l] = p[l - 1] + v[l - 1];
                x+=p[l];
            }
        }
    }
    cout << x;
    cerr << "\nProcess returned 0 (0x0)   execution time :  " << 0.001*clock() << " s";
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 1 ms 2648 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 2 ms 4768 KB Output is correct
10 Correct 2 ms 4700 KB Output is correct
11 Correct 2 ms 4696 KB Output is correct
12 Correct 2 ms 4700 KB Output is correct
13 Correct 2 ms 4588 KB Output is correct
14 Correct 2 ms 4700 KB Output is correct
15 Correct 2 ms 4700 KB Output is correct
16 Correct 2 ms 4696 KB Output is correct
17 Correct 1 ms 4700 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 234 ms 5208 KB Output is correct
2 Correct 300 ms 5392 KB Output is correct
3 Correct 140 ms 5100 KB Output is correct
4 Correct 308 ms 5404 KB Output is correct
5 Correct 361 ms 5444 KB Output is correct
6 Correct 407 ms 5472 KB Output is correct
7 Correct 357 ms 5476 KB Output is correct
8 Correct 364 ms 5564 KB Output is correct
9 Correct 364 ms 5496 KB Output is correct
10 Correct 375 ms 5468 KB Output is correct
11 Correct 350 ms 5560 KB Output is correct

Subtask #4
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 1 ms 2648 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 2 ms 4768 KB Output is correct
10 Correct 2 ms 4700 KB Output is correct
11 Correct 2 ms 4696 KB Output is correct
12 Correct 2 ms 4700 KB Output is correct
13 Correct 2 ms 4588 KB Output is correct
14 Correct 2 ms 4700 KB Output is correct
15 Correct 2 ms 4700 KB Output is correct
16 Correct 2 ms 4696 KB Output is correct
17 Correct 1 ms 4700 KB Output is correct
18 Correct 234 ms 5208 KB Output is correct
19 Correct 300 ms 5392 KB Output is correct
20 Correct 140 ms 5100 KB Output is correct
21 Correct 308 ms 5404 KB Output is correct
22 Correct 361 ms 5444 KB Output is correct
23 Correct 407 ms 5472 KB Output is correct
24 Correct 357 ms 5476 KB Output is correct
25 Correct 364 ms 5564 KB Output is correct
26 Correct 364 ms 5496 KB Output is correct
27 Correct 375 ms 5468 KB Output is correct
28 Correct 350 ms 5560 KB Output is correct
29 Correct 360 ms 5476 KB Output is correct
30 Correct 57 ms 2632 KB Output is correct
31 Correct 151 ms 2944 KB Output is correct
32 Correct 571 ms 3556 KB Output is correct
33 Correct 166 ms 2972 KB Output is correct
34 Correct 177 ms 2952 KB Output is correct
35 Correct 91 ms 2820 KB Output is correct
36 Correct 42 ms 2648 KB Output is correct
37 Correct 54 ms 2804 KB Output is correct
38 Correct 356 ms 5724 KB Output is correct
39 Correct 364 ms 5468 KB Output is correct
40 Correct 355 ms 5484 KB Output is correct
41 Correct 362 ms 5560 KB Output is correct
42 Correct 369 ms 5568 KB Output is correct
43 Correct 409 ms 5472 KB Output is correct
44 Correct 372 ms 5492 KB Output is correct
45 Correct 375 ms 5468 KB Output is correct
46 Correct 368 ms 5468 KB Output is correct
47 Correct 390 ms 5564 KB Output is correct
48 Correct 441 ms 5732 KB Output is correct
49 Correct 441 ms 5476 KB Output is correct
50 Correct 390 ms 5560 KB Output is correct
51 Correct 392 ms 5476 KB Output is correct
52 Correct 525 ms 5472 KB Output is correct
53 Correct 489 ms 5644 KB Output is correct
54 Correct 441 ms 5568 KB Output is correct