# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
380244 |
2021-03-20T16:51:29 Z |
vishesh312 |
Vudu (COCI15_vudu) |
C++17 |
|
1000 ms |
57156 KB |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using ordered_set = tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>;
#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()
const int mod = 1e9+7;
void solve(int tc) {
int n;
cin >> n;
vector<pair<int, int>> v(n+1);
for (int i = 1; i <= n; ++i) {
cin >> v[i].first;
v[i].second = i;
}
vector<int> a(n+1);
sort(all(v));
ll cur = 0;
for (int i = 0; i <= n; ++i) {
if (i) if (v[i].first == v[i-1].first) --cur;
a[v[i].second] = cur;
++cur;
}
ll p;
cin >> p;
ll ans = 0;
ordered_set s;
s.insert(-1);
for (int i = 1; i <= n; ++i) {
a[i] += a[i-1]-p;
ans += s.order_of_key(a[i]);
s.insert(a[i]-1);
}
cout << ans << '\n';
}
signed main() {
ios_base::sync_with_stdio(false); cin.tie(NULL);
int tc = 1;
//cin >> tc;
for (int i = 1; i <= tc; ++i) solve(i);
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5 ms |
876 KB |
Output isn't correct |
2 |
Incorrect |
3 ms |
748 KB |
Output isn't correct |
3 |
Incorrect |
3 ms |
748 KB |
Output isn't correct |
4 |
Execution timed out |
1086 ms |
57156 KB |
Time limit exceeded |
5 |
Incorrect |
585 ms |
33132 KB |
Output isn't correct |
6 |
Execution timed out |
1043 ms |
51436 KB |
Time limit exceeded |
7 |
Execution timed out |
1101 ms |
53356 KB |
Time limit exceeded |
8 |
Incorrect |
891 ms |
46508 KB |
Output isn't correct |
9 |
Execution timed out |
1090 ms |
56244 KB |
Time limit exceeded |
10 |
Execution timed out |
1048 ms |
52076 KB |
Time limit exceeded |