# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
748182 | MinaRagy06 | Swap Swap Sort (CCO21_day1problem1) | C++17 | 5016 ms | 176272 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef int64_t ll;
tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag, tree_order_statistics_node_update> invs;
set<pair<int, int>> s;
vector<pair<int, int>> pairs;
vector<pair<int, int>> check[100'005];
int val[2'000'005], q[1'000'005], a[100'005], p[100'005];
vector<int> frq[100'005];
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
int n, k, m;
cin >> n >> k >> m;
for (int i = 0; i < k; i++) {
p[i] = i + 1;
}
ll ans = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
frq[a[i]].push_back(i);
ans += invs.size() - invs.order_of_key({a[i] + 1, 0});
invs.insert({a[i], i});
}
for (int i = 0; i < m; i++) {
cin >> q[i];
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |