# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1276088 | chanhchuong123 | Vudu (COCI15_vudu) | C++20 | 237 ms | 16140 KiB |
#include<bits/stdc++.h>
using namespace std;
const bool multiTest = false;
#define task "C"
#define fi first
#define se second
#define MASK(i) (1LL << (i))
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define BIT(mask, i) ((mask) >> (i) & 1)
template<typename T1, typename T2> bool minimize(T1 &a, T2 b) {
if (a > b) a = b; else return 0; return 1;
}
template<typename T1, typename T2> bool maximize(T1 &a, T2 b) {
if (a < b) a = b; else return 0; return 1;
}
const int MAX = 1000100;
int N, P;
int a[MAX];
int bit[MAX];
long long sum;
vector<long long> values;
void update(int id, int delta) {
for (; id <= N + 5; id += id & -id)
bit[id] += delta;
}
int get(int id) {
int res = 0;
for (; id > 0; id -= id & -id)
res += bit[id];
return res;
}
void process(void) {
cin >> N;
for (int i = 1; i <= N; ++i) {
cin >> a[i];
}
cin >> P;
sum = 0;
values.push_back(0);
for (int i = 1; i <= N; ++i) {
sum += a[i];
values.push_back(sum - 1LL * P * i);
}
sort(all(values));
values.resize(unique(all(values)) - values.begin());
long long res = 0;
sum = 0;
for (int i = 0; i <= N; ++i) {
sum += a[i];
a[i] = lower_bound(all(values), sum - 1LL * P * i) - values.begin() + 1;
res += get(a[i]);
update(a[i], +1);
}
cout << res;
}
int main(void) {
ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
if (fopen(task".inp", "r")) {
freopen(task".inp", "r", stdin);
freopen(task".out", "w", stdout);
}
int nTest = 1; if (multiTest) cin >> nTest;
while (nTest--) {
process();
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |