#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;
#define FOR(i,start,end) for(int i=start;i<(int)(end);i++)
#define FORE(i,start,end) for(int i=start;i<=(int)end;i++)
#define RFOR(i,start,end) for(int i = start; i>end; i--)
#define RFORE(i,start,end) for(int i = start; i>=end; i--)
#define all(a) a.begin(), a.end()
#define mt make_tuple
#define v vector
#define sf scanf
#define pf printf
#define dvar(x) cout << #x << " := " << x << "\n"
#define darr(x,n) FOR(i,0,n) cout << #x << "[" << i << "]" << " := " << x[i] << "\n"
typedef long long ll;
typedef long double ld;
typedef pair<int, int > pii;
typedef pair<ll, ll> pll;
//template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> void minn(T &a, T b) { a = min(a, b); }
template<class T> void maxx(T &a, T b) { a = max(a, b); }
inline void io() {
#ifdef LOCAL_PROJECT
freopen("input.in", "r", stdin); freopen("output.out", "w", stdout);
#else
/* online submission */
#endif
ios_base::sync_with_stdio(false); cin.tie(NULL);
}
/**********************COCI 16-17 R2 P5*****************************/
const int MAXN = 1e6 + 10;
int N, A[MAXN], P;
v<pii> ordered;
ll ans = 0;
int bit[MAXN];
void update(int k, int val) {
for (k++; k <= N + 1; k += (k&-k))
bit[k] += val;
}
int query(int k) {
int temp = 0;
for (k++; k > 0; k -= (k&-k))
temp += bit[k];
return temp;
}
int query(int l, int r) {
return query(r) - query(l - 1);
}
int main() {
io();
cin >> N;
FORE(i, 1, N) cin >> A[i];
cin >> P;
FORE(i, 1, N) A[i] -= P;
FORE(i, 1, N) A[i] += A[i - 1];
FORE(i, 0, N) ordered.push_back({ A[i], i });
sort(all(ordered));
reverse(all(ordered));
for (pii &op : ordered) {
ans += query(op.second, N);
update(op.second, 1);
}
cout << ans << "\n";
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
5 ms |
760 KB |
Output is correct |
| 2 |
Correct |
4 ms |
824 KB |
Output is correct |
| 3 |
Correct |
3 ms |
824 KB |
Output is correct |
| 4 |
Incorrect |
340 ms |
25332 KB |
Output isn't correct |
| 5 |
Incorrect |
193 ms |
25936 KB |
Output isn't correct |
| 6 |
Incorrect |
309 ms |
37344 KB |
Output isn't correct |
| 7 |
Incorrect |
327 ms |
46516 KB |
Output isn't correct |
| 8 |
Incorrect |
275 ms |
52236 KB |
Output isn't correct |
| 9 |
Incorrect |
353 ms |
65292 KB |
Output isn't correct |
| 10 |
Runtime error |
313 ms |
66560 KB |
Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience. |
