# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
648973 |
2022-10-08T21:20:48 Z |
tvladm2009 |
Vudu (COCI15_vudu) |
C++14 |
|
508 ms |
65628 KB |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class T> using oset = tree<T, null_type, std::less<T>, rb_tree_tag,tree_order_statistics_node_update>;
int const nmax = 1000000;
long long v[5 + nmax], sp[5 + nmax];
signed main() {
std::ios_base::sync_with_stdio(0);
std::cin.tie(0);
long long n, p;
std::cin >> n;
for(int i = 1;i <= n; i++)
std::cin >> v[i];
std::cin >> p;
for(int i = 1;i <= n; i++) {
v[i] -= p;
sp[i] = sp[i - 1] + v[i];
}
oset<long long> s;
s.insert(0);
long long ans = 0;
for(int i = 1;i <= n; i++) {
ans += s.order_of_key(sp[i]);
s.insert(sp[i]);
}
std::map<long long, long long> mp;
// mp[0]++;
for(int i = 1;i <= n; i++) {
// ans += mp.count(sp[i]);
// mp[sp[i]]++;
}
std::cout << ans;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
852 KB |
Output isn't correct |
2 |
Incorrect |
3 ms |
724 KB |
Output isn't correct |
3 |
Incorrect |
2 ms |
724 KB |
Output isn't correct |
4 |
Runtime error |
508 ms |
65536 KB |
Execution killed with signal 9 |
5 |
Incorrect |
316 ms |
48248 KB |
Output isn't correct |
6 |
Runtime error |
494 ms |
65628 KB |
Execution killed with signal 9 |
7 |
Runtime error |
485 ms |
65536 KB |
Execution killed with signal 9 |
8 |
Incorrect |
472 ms |
65536 KB |
Output isn't correct |
9 |
Runtime error |
450 ms |
65536 KB |
Execution killed with signal 9 |
10 |
Runtime error |
452 ms |
65536 KB |
Execution killed with signal 9 |