/////////////////////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], pref[200005], sq = 448, sq2 = 2 * sq;
map<int, vi> ma;
map<int, int> cnt;
int main() {
fastio;
int n; cin >> n; fra(n)
fri(n) ma[a[i]].pb(i);
ll ans = 0;
for(auto it : ma) {
if((int)((it.ss).size()) > sq) continue;
//max hajordakan sq hat => mijakayqy 2sq erkarutyan lini => amen mijakayq nayenq dra keterov sksox =>n armat logn
ans += (it.ss).size();
fri(n) {
cnt.clear();
cnt[a[i]]++;
frrj(i + 1, min(n, i+sq2+1)) {
cnt[a[j]]++;
if(cnt[it.ff] > (j-i+1)/2) ans++;
}
}
}
for(auto it : ma) {
if((int)((it.ss).size()) < sq) continue;
// (it.ss).size() > sq => max sq hat ka senc
int x = it.ff;
cnt.clear();
fri(n) {
pref[i+1] = pref[i];
if(a[i] == x) pref[i+1]++;
else pref[i+1]--;
}
int cur = 0;
frr(1, 1 + n) { //iranic < tveri qanaky gumarenq
cnt[pref[i-1]]++;
if(pref[i] > pref[i-1])
cur += cnt[pref[i-1]];
else cur -= cnt[pref[i]];
ans += cur;
}
}
cout << ans;
return 0;
}
// ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥
// ♥ ♥ ♥ ♥ ♥ ♥ ♥
// ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥
// ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥
// ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥
//
// God loves Fil, Fil accepts God's will
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
9 ms |
336 KB |
Output is correct |
| 3 |
Correct |
4 ms |
212 KB |
Output is correct |
| 4 |
Correct |
4 ms |
212 KB |
Output is correct |
| 5 |
Correct |
4 ms |
212 KB |
Output is correct |
| 6 |
Correct |
1 ms |
328 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
9 ms |
336 KB |
Output is correct |
| 3 |
Correct |
4 ms |
212 KB |
Output is correct |
| 4 |
Correct |
4 ms |
212 KB |
Output is correct |
| 5 |
Correct |
4 ms |
212 KB |
Output is correct |
| 6 |
Correct |
1 ms |
328 KB |
Output is correct |
| 7 |
Execution timed out |
3045 ms |
468 KB |
Time limit exceeded |
| 8 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
19 ms |
2376 KB |
Output is correct |
| 2 |
Correct |
28 ms |
3076 KB |
Output is correct |
| 3 |
Correct |
15 ms |
1888 KB |
Output is correct |
| 4 |
Correct |
35 ms |
2848 KB |
Output is correct |
| 5 |
Correct |
33 ms |
3196 KB |
Output is correct |
| 6 |
Correct |
29 ms |
3076 KB |
Output is correct |
| 7 |
Correct |
28 ms |
3008 KB |
Output is correct |
| 8 |
Correct |
30 ms |
3448 KB |
Output is correct |
| 9 |
Correct |
27 ms |
3032 KB |
Output is correct |
| 10 |
Correct |
26 ms |
3008 KB |
Output is correct |
| 11 |
Correct |
67 ms |
12720 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
9 ms |
336 KB |
Output is correct |
| 3 |
Correct |
4 ms |
212 KB |
Output is correct |
| 4 |
Correct |
4 ms |
212 KB |
Output is correct |
| 5 |
Correct |
4 ms |
212 KB |
Output is correct |
| 6 |
Correct |
1 ms |
328 KB |
Output is correct |
| 7 |
Execution timed out |
3045 ms |
468 KB |
Time limit exceeded |
| 8 |
Halted |
0 ms |
0 KB |
- |
