| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1334493 | zhehan | Arranging Shoes (IOI19_shoes) | C++20 | 1 ms | 344 KiB |
#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
long long count_swaps(std::vector<int> s) {
map<int, queue<int>> key;
for (int i = 0; i < s.size(); ++i) {
if (s[i] > 0) {
key[s[i]];
key[s[i]].push(i);
}
}
int swaps = 0;
for (int i = 0; i < s.size(); ++i) {
if (s[i] < 0) {
if (key[-s[i]].front() < i) {
swaps += i - key[-s[i]].front();
} else {
swaps += key[-s[i]].front() - 1 - i;
}
key[-s[i]].pop();
}
}
return swaps;
}
| # | 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... | ||||
