| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1225367 | toast12 | Arranging Shoes (IOI19_shoes) | C++20 | 1 ms | 328 KiB |
#include <bits/stdc++.h>
#include "shoes.h"
using namespace std;
long long count_swaps(vector<int> s) {
int n = s.size();
long long ans = 0;
for (int i = 0; i < n; i += 2) {
for (int j = i+1; j < n; j++) {
if (abs(s[j]) == abs(s[i])) {
for (int k = j-1; k > i; k--) {
swap(s[k], s[k+1]);
ans++;
}
if (s[i] > s[i+1]) {
swap(s[i], s[i+1]);
ans++;
}
break;
}
}
}
return ans;
}
| # | 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... | ||||
