| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1358379 | alexiah | Arranging Shoes (IOI19_shoes) | C++20 | 1097 ms | 1960 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 , tn = s.size() , n = tn/2;
for(int i = 0; i < tn; i+=2){
ll act = -1;
for(int j = i+1; j < tn; j++){
if(abs(s[i]) == abs(s[j])){
act = j; break;
}
}
while(act > i+1){
swap(s[act] , s[act-1]); ans++; act--;
}
if(s[i] > 0){
swap(s[i] , s[i+1]); ans++;
}
}
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... | ||||
