//{ <defines>
#include <bits/stdc++.h>
using namespace std;
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,-O3")
#define fr(i, n) for(int i = 0; i < n; ++i)
#define fo(n) fr(i, n)
#define re return
#define ef else if
#define ifn(x) if(!(x))
#define _ << ' ' <<
#define ft first
#define sd second
#define ve vector
#define pb push_back
#define eb emplace_back
#define sz(x) int((x).size())
#define bnd(x) x.begin(), x.end()
#define clr(x, y) memset((x), (y), sizeof (x))
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef ve<int> vi;
inline ll time() {re chrono :: system_clock().now().time_since_epoch().count();}
mt19937 rnd(time());
mt19937_64 RND(time());
template<typename t> inline void umin(t &a, t b) {a = min(a, b);}
template<typename t> inline void umax(t &a, t b) {a = max(a, b);}
int md = 998244353;
inline int m_add(int&a, int b) {a += b; if(a < 0) a += md; if(a >= md) a -= md; re a;}
inline int m_sum(int a, int b) {a += b; if(a < 0) a += md; if(a >= md) a -= md; re a;}
inline int m_mul(int&a, int b) {re a = 1ll * a * b % md;}
inline int m_prod(int a, int b) {re 1ll * a * b % md;}
int m_bpow(ll A, ll b) {
int a = A % md;
ll ans = 1;
for(ll p = 1ll << 63 - __builtin_clzll(b); p; p >>= 1) {
(ans *= ans) %= md;
if(p & b)
(ans *= a) %= md;
}
re ans;
}
//const ld pi = arg(complex<ld>(-1, 0));
//const ld pi2 = pi + pi;
const int oo = 2e9;
const ll OO = 4e18;
//} </defines>
const int N = 1e6 + 5;
ll a[N];
int f[N], c[N];
void solve() {
int n; cin >> n; fo(n) cin >> a[i + 1]; int p; cin >> p; ++n; int m = 0; *a = 0;
for(int i = 1; i < n; ++i) a[i] += a[i - 1] - p;
iota(c, c + n, 0); sort(c, c + n, [&] (const int &fi, const int &se) {re a[fi] < a[se];});
int pr = a[*c]; fo(n) if(a[c[i]] > pr) pr = a[c[i]], a[c[i]] = ++m; else a[c[i]] = m; ++m;
clr(f, 0);
ll ans = 0;
fo(n) {
for(int j = a[i] + 1; j; j -= j & -j) ans += f[j];
for(int j = a[i] + 1; j <= m; j += j & -j) f[j]++;
}
cout << ans << endl;
}
int main() {
#ifdef _LOCAL
freopen("in.txt", "r", stdin);
int tests; cin >> tests;
for(int test = 1; test <= tests; ++test) {
cerr << "case #" << test << endl;
solve();
cerr << endl;
}
#else
// freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
solve();
#endif
return 0;
}
Compilation message
vudu.cpp: In function 'int m_bpow(ll, ll)':
vudu.cpp:50:26: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
for(ll p = 1ll << 63 - __builtin_clzll(b); p; p >>= 1) {
~~~^~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
4 ms |
4352 KB |
Output is correct |
| 2 |
Correct |
4 ms |
4352 KB |
Output is correct |
| 3 |
Correct |
5 ms |
4352 KB |
Output is correct |
| 4 |
Incorrect |
303 ms |
15676 KB |
Output isn't correct |
| 5 |
Incorrect |
172 ms |
10616 KB |
Output isn't correct |
| 6 |
Incorrect |
233 ms |
14328 KB |
Output isn't correct |
| 7 |
Incorrect |
262 ms |
14840 KB |
Output isn't correct |
| 8 |
Incorrect |
200 ms |
13312 KB |
Output isn't correct |
| 9 |
Incorrect |
292 ms |
16120 KB |
Output isn't correct |
| 10 |
Incorrect |
250 ms |
14428 KB |
Output isn't correct |
