# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
446263 | 2021-07-21T11:39:53 Z | zxcvbnm | Vudu (COCI15_vudu) | C++14 | 3 ms | 588 KB |
#include <bits/stdc++.h> using namespace std; using ll = long long; #define int ll struct Ft { vector<ll> bit; int n; void build(vector<ll> a) { n = a.size()+2; bit.assign(2*n, 0); } void update(int idx, int x) { while(idx <= n) { bit[idx] += x; idx += idx & -idx; } } ll sum(int idx) { ll sum = 0; while(idx > 0) { sum += bit[idx]; idx -= idx & -idx; } return sum; } }; signed main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); freopen("test.in", "r", stdin); int n; cin >> n; vector<int> a(n); for(int& i : a) { cin >> i; } int p; cin >> p; vector<ll> sum = {0}; for(int i : a) { sum.push_back(sum.back()+(i-p)); } vector<ll> sums = sum; sort(sums.begin(), sums.end()); unordered_map<ll, int> mp; int idx = 1; for(int i = 0; i < (int) sums.size(); i++) { if (i != 0 && sums[i-1] == sums[i]) continue; mp[sums[i]] = idx++; } Ft ft; ft.build(sums); ll ans = 0; for(ll i : sum) { ans += ft.sum(mp[i]); ft.update(mp[i], +1); } cout << ans << "\n"; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 3 ms | 588 KB | Execution killed with signal 6 |
2 | Runtime error | 2 ms | 588 KB | Execution killed with signal 6 |
3 | Runtime error | 3 ms | 588 KB | Execution killed with signal 6 |
4 | Runtime error | 3 ms | 588 KB | Execution killed with signal 6 |
5 | Runtime error | 2 ms | 588 KB | Execution killed with signal 6 |
6 | Runtime error | 3 ms | 588 KB | Execution killed with signal 6 |
7 | Runtime error | 3 ms | 588 KB | Execution killed with signal 6 |
8 | Runtime error | 3 ms | 588 KB | Execution killed with signal 6 |
9 | Runtime error | 3 ms | 588 KB | Execution killed with signal 6 |
10 | Runtime error | 3 ms | 588 KB | Execution killed with signal 6 |