# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
419089 | 2021-06-06T12:11:25 Z | acm | Vudu (COCI15_vudu) | C++14 | 436 ms | 41380 KB |
#include <bits/stdc++.h> #define speed \ ios_base::sync_with_stdio(0); \ cin.tie(0); \ cout.tie(0); #define precision \ cout.precision(30); \ cerr.precision(10); #define ll long long #define ld long double #define pll pair<ll, ll> #define pii pair<int, int> #define forn(n) for (int i = 1; i <= n; i++) #define forlr(l, r) for (int i = l; i != r; (l > r ? i-- : i++)) #define pb(x) push_back(x) #define sz(x) (int)x.size() #define mp(x, y) make_pair(x, y) #define all(x) x.begin(), x.end() #define pc(x) __builtin_popcount(x) #define pcll(x) __builtin_popcountll(x) #define F first #define S second using namespace std; mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); void ioi(string name) { freopen((name + ".in").c_str(), "r", stdin); freopen((name + ".out").c_str(), "w", stdout); } ll n, k, t, a[1000005], p[1000005], f[1000005]; vector<ll> b; void upd(ll x) { for (; x <= n + 1; x += (x & -x)) f[x]++; } ll get(ll x) { ll y = 0; for (; x > 0; x -= (x & -x)) y += f[x]; return y; } int main() { speed; precision; // code cin >> n; for (int i = 1; i <= n; i++) cin >> a[i], p[i] = p[i - 1] + a[i]; cin >> k; b.pb(0); for (int i = 1; i <= n; i++) p[i] -= k * i, b.pb(p[i]); sort(all(b)); b.erase(unique(all(b)), b.end()); upd(lower_bound(all(b), 0) - b.begin() + 1); for (int i = 1; i <= n; i++) { p[i] = lower_bound(all(b), p[i]) - b.begin() + 1; t += get(p[i]); upd(p[i]); } cout << t; // endl #ifndef ONLINE_JUDGE cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n"; #endif return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 588 KB | Output is correct |
2 | Correct | 3 ms | 588 KB | Output is correct |
3 | Correct | 3 ms | 588 KB | Output is correct |
4 | Correct | 390 ms | 39972 KB | Output is correct |
5 | Correct | 220 ms | 22896 KB | Output is correct |
6 | Correct | 329 ms | 35492 KB | Output is correct |
7 | Correct | 318 ms | 36852 KB | Output is correct |
8 | Correct | 318 ms | 32180 KB | Output is correct |
9 | Correct | 436 ms | 41380 KB | Output is correct |
10 | Correct | 332 ms | 36012 KB | Output is correct |