| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 1003424 |
2024-06-20T10:10:25 Z |
Whisper |
Izbori (COCI22_izbori) |
C++17 |
|
298 ms |
7128 KB |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
//#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (b); i >= (a); i --)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPD(i, n) for (int i = (n) - 1; i >= 0; --i)
#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
/*
Phu Trong from Nguyen Tat Thanh High School for gifted student
*/
template <class X, class Y>
bool minimize(X &x, const Y &y){
X eps = 1e-9;
if (x > y + eps) {x = y; return 1;}
return 0;
}
template <class X, class Y>
bool maximize(X &x, const Y &y){
X eps = 1e-9;
if (x + eps < y) {x = y; return 1;}
return 0;
}
#define MAX 200005
#define BLOCK_SIZE 450
#define off_set 200000
int nArr;
int A[MAX];
vector<int> pos[MAX];
template<class T = vector<int>>
T unique (T v){
sort(v.begin(), v.end());
v.resize(unique(v.begin(), v.end()) - v.begin());
return v;
}
template<class T = int>
T find(T x, const vector<int>& v){
return (int)(lower_bound(v.begin(), v.end(), x) - v.begin() + 1);
}
bool hvy[MAX];
int cnt[MAX];
struct custom_hash{
size_t operator ()(uint64_t x) const{
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
x ^= FIXED_RANDOM;
return x ^ (x >> 16);
}
};
template<class T = int> struct FenwickTree{
T *F = nullptr;
int n;
FenwickTree(int _n = 0){
resize(_n);
}
void reset(void){
memset(F, 0, sizeof F);
}
void resize(int _n){
if(F != nullptr) delete[] F;
this -> n = _n;
F = new T [n + 5];
reset();
}
void Modify(int p, int val, int c){
for (; p <= n; p += p & (-p)) F[p] += val;
}
T Query(int p){
int res = 0;
for (; p > 0; p -= p & (-p)) res += F[p];
return res;
}
};
int g[MAX];
void process(void){
cin >> nArr;
vector<int> comp;
for (int i = 1; i <= nArr; ++i) cin >> A[i], comp.push_back(A[i]);
comp = unique(comp);
for (int i = 1; i <= nArr; ++i) A[i] = find(A[i], comp), cnt[A[i]]++;
for (int i = 1; i <= nArr; ++i) {
hvy[i] = (cnt[i] >= BLOCK_SIZE);
}
long long ans = 0;
for (int l = 1; l <= nArr; ++l){
int max_occurence = 0;
for (int r = l; r <= nArr && (r - l + 1 < 2 * BLOCK_SIZE); ++r){
if(hvy[A[r]]) continue;
g[A[r]]++;
maximize(max_occurence, g[A[r]]);
if (2 * max_occurence > (r - l + 1)) ++ans;
}
for (int r = l; r <= nArr && (r - l + 1 < 2 * BLOCK_SIZE); ++r){
if(!hvy[A[r]]) --g[A[r]];
}
}
FenwickTree<long long> fen(2 * MAX);
for (int i = 1; i <= nArr; ++i){
if (!hvy[i]) continue;
vector<int> sm(nArr + 1);
fen.Modify(off_set, 1, 1);
for (int j = 1; j <= nArr; ++j){
sm[j] = sm[j - 1] + (A[j] == i ? 1 : -1);
ans += fen.Query(sm[j] + off_set - 1);
fen.Modify(sm[j] + off_set, 1, 1);
}
fen.reset();
}
cout << ans;
}
signed main(){
#define name "Whisper"
cin.tie(nullptr) -> sync_with_stdio(false);
//freopen(name".inp", "r", stdin);
//freopen(name".out", "w", stdout);
process();
}
Compilation message
Main.cpp: In instantiation of 'void FenwickTree<T>::reset() [with T = long long int]':
Main.cpp:131:19: required from here
Main.cpp:78:22: warning: argument to 'sizeof' in 'void* memset(void*, int, size_t)' call is the same expression as the destination; did you mean to dereference it? [-Wsizeof-pointer-memaccess]
78 | memset(F, 0, sizeof F);
| ^~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
4956 KB |
Output is correct |
| 2 |
Correct |
3 ms |
4956 KB |
Output is correct |
| 3 |
Correct |
3 ms |
4956 KB |
Output is correct |
| 4 |
Correct |
2 ms |
5172 KB |
Output is correct |
| 5 |
Correct |
2 ms |
4956 KB |
Output is correct |
| 6 |
Correct |
2 ms |
4956 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
4956 KB |
Output is correct |
| 2 |
Correct |
3 ms |
4956 KB |
Output is correct |
| 3 |
Correct |
3 ms |
4956 KB |
Output is correct |
| 4 |
Correct |
2 ms |
5172 KB |
Output is correct |
| 5 |
Correct |
2 ms |
4956 KB |
Output is correct |
| 6 |
Correct |
2 ms |
4956 KB |
Output is correct |
| 7 |
Correct |
2 ms |
5212 KB |
Output is correct |
| 8 |
Correct |
3 ms |
4956 KB |
Output is correct |
| 9 |
Correct |
5 ms |
5212 KB |
Output is correct |
| 10 |
Correct |
5 ms |
5212 KB |
Output is correct |
| 11 |
Correct |
6 ms |
5212 KB |
Output is correct |
| 12 |
Correct |
7 ms |
5212 KB |
Output is correct |
| 13 |
Correct |
6 ms |
5212 KB |
Output is correct |
| 14 |
Correct |
7 ms |
5236 KB |
Output is correct |
| 15 |
Correct |
6 ms |
5212 KB |
Output is correct |
| 16 |
Correct |
6 ms |
5180 KB |
Output is correct |
| 17 |
Correct |
4 ms |
5184 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
298 ms |
7128 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
4956 KB |
Output is correct |
| 2 |
Correct |
3 ms |
4956 KB |
Output is correct |
| 3 |
Correct |
3 ms |
4956 KB |
Output is correct |
| 4 |
Correct |
2 ms |
5172 KB |
Output is correct |
| 5 |
Correct |
2 ms |
4956 KB |
Output is correct |
| 6 |
Correct |
2 ms |
4956 KB |
Output is correct |
| 7 |
Correct |
2 ms |
5212 KB |
Output is correct |
| 8 |
Correct |
3 ms |
4956 KB |
Output is correct |
| 9 |
Correct |
5 ms |
5212 KB |
Output is correct |
| 10 |
Correct |
5 ms |
5212 KB |
Output is correct |
| 11 |
Correct |
6 ms |
5212 KB |
Output is correct |
| 12 |
Correct |
7 ms |
5212 KB |
Output is correct |
| 13 |
Correct |
6 ms |
5212 KB |
Output is correct |
| 14 |
Correct |
7 ms |
5236 KB |
Output is correct |
| 15 |
Correct |
6 ms |
5212 KB |
Output is correct |
| 16 |
Correct |
6 ms |
5180 KB |
Output is correct |
| 17 |
Correct |
4 ms |
5184 KB |
Output is correct |
| 18 |
Incorrect |
298 ms |
7128 KB |
Output isn't correct |
| 19 |
Halted |
0 ms |
0 KB |
- |
