| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1219431 | moondarkside | Arranging Shoes (IOI19_shoes) | C++20 | 0 ms | 324 KiB |
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
int pushDown(int x, int y,vector<int>& S) {
int vo=S[y];
for(int i=y; i>x; i--) {
S[i]=S[i-1];
}
S[x]=vo;
return y-x;
}
int count_swaps(std::vector<int>S) {
int swaps=0;
int pos=0;
for(int i=0; i<S.size(); i++) {
int val=S[i];
if(S[i]<0) {
swaps+=pushDown(pos,i,S);
for(int i=pos+1; S[i]!=-val; i++) {}
swaps+=pushDown(pos+1,i,S);
pos+=2;
}
}
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... | ||||
