#include <vector>
#include <algorithm>
#include <iostream>
#include <set>
#include <cmath>
#include <map>
#include <random>
#include <cassert>
#include <ctime>
#include <cstdlib>
#include <queue>
#include <limits.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
using namespace __gnu_pbds;
using namespace std;
typedef
tree<
pair<int,int>,
null_type,
less<pair<int,int>>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int N; cin >> N;
vector<int64_t> pref = {0}; for (int i = 0; i < N; i++) {int64_t x; cin >> x; pref.push_back(pref.back() + x);}
int64_t P; cin >> P;
int64_t c = 0;
ordered_set s;
for (int r = 0; r < N; r++) {
s.insert({pref[r] - P * r, r});
c += (int64_t)s.order_of_key(make_pair(pref[r + 1] - P * (r + 1) + 1, -1));
}
cout << c;
}
Compilation message
vudu.cpp:17: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
17 | #pragma GCC optimization ("O3")
|
vudu.cpp:18: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
18 | #pragma GCC optimization ("unroll-loops")
|
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
852 KB |
Output is correct |
2 |
Correct |
3 ms |
724 KB |
Output is correct |
3 |
Correct |
2 ms |
724 KB |
Output is correct |
4 |
Runtime error |
987 ms |
65536 KB |
Execution killed with signal 9 |
5 |
Incorrect |
583 ms |
38844 KB |
Output isn't correct |
6 |
Incorrect |
953 ms |
60480 KB |
Output isn't correct |
7 |
Incorrect |
992 ms |
62984 KB |
Output isn't correct |
8 |
Incorrect |
844 ms |
54676 KB |
Output isn't correct |
9 |
Runtime error |
942 ms |
65536 KB |
Execution killed with signal 9 |
10 |
Incorrect |
973 ms |
61472 KB |
Output isn't correct |