# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
726968 | viwlesxq | Arranging Shoes (IOI19_shoes) | C++17 | 418 ms | 281900 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 "shoes.h"
#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;
typedef string str;
#define ordered_set tree <int, null_type, less <int>, rb_tree_tag, tree_order_statistics_node_update>
long long count_swaps(vector <int> S) {
int n = (int)S.size();
ll ans = 0;
for (int i = 0; i < n; ++i) {
S[i] += n;
}
vector <deque <int>> pos(2 * n + 1);
vector <bool> used(n, false);
ordered_set st;
for (int i = 0; i < n; ++i) {
pos[S[i]].push_back(i);
}
for (int i = 0; i + 1 < n; ++i) {
if (used[i]) {
continue;
}
if (S[i] > n) {
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |