| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1303736 | JahonaliX | Arranging Shoes (IOI19_shoes) | C++20 | 1134 ms | 1052528 KiB |
#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
long long count_swaps(vector<int> s) {
int n = s.size();
vector<int> dp(1 << n, 100000000000000000ll);
dp[0] = 0;
for (int mask = 0; mask < (1 << n); ++mask) {
int l = -1;
for (int i = 0; i < n; ++i) {
l += mask >> i & 1;
int r = -1;
for (int j = 0; j < n; ++j) {
r += mask >> j & 1;
if (mask >> i & 1 && mask >> j & 1 && s[i] == -s[j] && s[i] > 0) {
dp[mask] = min(dp[mask], dp[mask ^ (1 << i) ^ (1 << j)] + l + r + (r > l) - 1);
}
}
}
};
return dp.back();
}
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... | ||||
