#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 ("O2")
#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<int> pref = {0}; for (int i = 0; i < N; i++) {int x; cin >> x; pref.push_back(pref.back() + x);}
int P; cin >> P;
int c = 0;
ordered_set s;
for (int r = 0; r < N; r++) {
s.insert({pref[r] - P * r, r});
c += 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 ("O2")
|
vudu.cpp:18: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
18 | #pragma GCC optimization ("unroll-loops")
|
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
852 KB |
Output is correct |
2 |
Correct |
2 ms |
724 KB |
Output is correct |
3 |
Correct |
2 ms |
596 KB |
Output is correct |
4 |
Execution timed out |
1097 ms |
64752 KB |
Time limit exceeded |
5 |
Incorrect |
534 ms |
36664 KB |
Output isn't correct |
6 |
Execution timed out |
1028 ms |
57188 KB |
Time limit exceeded |
7 |
Execution timed out |
1014 ms |
59468 KB |
Time limit exceeded |
8 |
Incorrect |
859 ms |
51600 KB |
Output isn't correct |
9 |
Execution timed out |
1047 ms |
65536 KB |
Time limit exceeded |
10 |
Incorrect |
956 ms |
58064 KB |
Output isn't correct |