# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
252717 | NONAME | Vudu (COCI15_vudu) | C++14 | 1094 ms | 18424 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define dbg(x) cerr << #x << " = " << x << "\n"
#define fast_io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie()
using namespace std;
using ll = long long;
const int N = int(1e6) + 10;
int n;
ll a[N], pf[N], p;
int main() {
fast_io;
cin >> n;
for (int i = 0; i < n; ++i)
cin >> a[i];
cin >> p;
for (int i = 0; i < n; ++i)
pf[i] = (i - 1 < 0 ? 0 : pf[i - 1]) + a[i];
int ans = 0;
for (int i = 0; i < n; ++i)
for (int j = 0; j <= i; ++j)
if (pf[i] - p * i >= (j - 1 < 0 ? 0 : pf[j - 1]) - p * j + p)
++ans;
cout << ans << "\n";
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |