# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
508691 | 2022-01-13T14:55:06 Z | sumit_kk10 | Vudu (COCI15_vudu) | C++17 | 1000 ms | 15980 KB |
#include <bits/stdc++.h> #define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL) #define ll long long #define pb push_back #define F first #define S second using namespace std; const int N = 1e6 + 5, MOD = 1e9 + 7; long long n, k, a[N], ans, pre[N]; void solve(){ cin >> n; for(int i = 1; i <= n; ++i){ cin >> a[i]; pre[i] = pre[i - 1] + a[i]; } cin >> k; for(int i = 1; i <= n; ++i) for(int j = i; j <= n; ++j) if(pre[j] - pre[i - 1] >= k * (j - i + 1)) ++ans; cout << ans << '\n'; } int main() { fast; int t = 1; // cin >> t; while(t--) solve(); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 28 ms | 332 KB | Output is correct |
2 | Correct | 15 ms | 424 KB | Output is correct |
3 | Correct | 17 ms | 332 KB | Output is correct |
4 | Execution timed out | 1070 ms | 15480 KB | Time limit exceeded |
5 | Execution timed out | 1083 ms | 8752 KB | Time limit exceeded |
6 | Execution timed out | 1055 ms | 13692 KB | Time limit exceeded |
7 | Execution timed out | 1047 ms | 14260 KB | Time limit exceeded |
8 | Execution timed out | 1085 ms | 12368 KB | Time limit exceeded |
9 | Execution timed out | 1079 ms | 15980 KB | Time limit exceeded |
10 | Execution timed out | 1067 ms | 13868 KB | Time limit exceeded |