#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";
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
36 ms |
512 KB |
Output is correct |
2 |
Correct |
20 ms |
512 KB |
Output is correct |
3 |
Correct |
19 ms |
512 KB |
Output is correct |
4 |
Execution timed out |
1094 ms |
17912 KB |
Time limit exceeded |
5 |
Execution timed out |
1094 ms |
11512 KB |
Time limit exceeded |
6 |
Execution timed out |
1094 ms |
16376 KB |
Time limit exceeded |
7 |
Execution timed out |
1092 ms |
16888 KB |
Time limit exceeded |
8 |
Execution timed out |
1092 ms |
15096 KB |
Time limit exceeded |
9 |
Execution timed out |
1081 ms |
18424 KB |
Time limit exceeded |
10 |
Execution timed out |
1094 ms |
16508 KB |
Time limit exceeded |