# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
580277 | Sharky | Arranging Shoes (IOI19_shoes) | C++17 | 1087 ms | 3148 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>
using namespace std;
#ifndef EVAL
#include "grader.cpp"
#endif
#define ll long long
ll count_swaps(std::vector<int> s) {
int n = (int) s.size();
ll ans = 0;
for (int i = 0; i < n; i += 2) {
int idx;
for (int j = i + 1; j < n; j++) {
if (s[i] + s[j] == 0) { idx = j; break; }
}
for (int j = idx; j >= i + 2; j--) {
swap(s[j], s[j - 1]);
ans++;
}
if (s[i] > s[i + 1]) ans++;
}
return ans;
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |