| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1358376 | alexiah | Arranging Shoes (IOI19_shoes) | C++20 | 1093 ms | 3792 KiB |
#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
long long count_swaps(vector<int> s) {
ll ans = 0;
while(!s.empty()){
ll act = -1 , tn = s.size();
for(ll i = 1; i < tn; i++){
if(abs(s[0]) == abs(s[i])){
act = i; break;
}
}
ans += act-1;
if(s[0] > 0) ans++;
vi ns;
for(ll i = 1; i < tn; i++){
if(i != act) ns.push_back(s[i]);
}
s = ns;
}
return ans;
}
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
