# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
252749 |
2020-07-26T08:16:15 Z |
kartel |
Vudu (COCI15_vudu) |
C++14 |
|
652 ms |
65540 KB |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,nso-stack-protector,unroll-loops,fast-math,-O3")
//#define F first
//#define S second
#define pb push_back
#define N +1000500
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e9)
#define el '\n'
#define Max_A int(1e9)
//#define el endl
#define pii pair <int, int>
#define err ld(1e-9)
#define Max_S int(3e6)
#define last(x) x.back()
#define all(x) (x).begin(), (x).end()
#define arr_all(x, n) (x + 1), (x + 1 + n)
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef tree <ll, null_type, less_equal <ll> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long double ld;
ll pr[N], i, n, j, ans, a[N], p,t[N];
ordered_set os;
int main()
{
cout.precision(2);
srand(time(0));
ios_base::sync_with_stdio(0);
iostream::sync_with_stdio(0);
ios::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
// in("input.txt");
// out("output.txt");
cin >> n;
for (i = 1; i <= n; i++) cin >> a[i], pr[i] = pr[i - 1] + a[i];
cin >> p;
for (i = 1; i <= n; i++)
{
os.insert(pr[i - 1] - i * p + p);
ans += os.order_of_key(pr[i] - i * p + 1);
}
cout << ans;
}
//
//00000
//00110
//00111
//00011
//00000
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
1024 KB |
Output is correct |
2 |
Correct |
3 ms |
896 KB |
Output is correct |
3 |
Correct |
3 ms |
768 KB |
Output is correct |
4 |
Runtime error |
652 ms |
65540 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
5 |
Correct |
356 ms |
43384 KB |
Output is correct |
6 |
Runtime error |
572 ms |
65540 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
7 |
Runtime error |
493 ms |
65540 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
8 |
Correct |
606 ms |
61080 KB |
Output is correct |
9 |
Runtime error |
516 ms |
65540 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
10 |
Runtime error |
572 ms |
65540 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |