| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1334699 | yc11 | Arranging Shoes (IOI19_shoes) | C++20 | 1096 ms | 2728 KiB |
#include<bits/stdc++.h>
using namespace std;
int64_t count_swaps(vector<int> S){
vector<int> n1;
n1.assign(S.size(),0);
int ans = 0;
for (int i = 0;i<S.size();i++){
if (n1[i]==1 or n1[i]==-1) continue;
for (int j = i+1;j<S.size();j++){
if (S[j]==S[i]*-1 and n1[j]==0){
n1[j] = -1;
n1[i] = 1;
if (S[i]>0) ans++;
for (int k = j-1;k>i;k--){
if (n1[k]==0) ans++;
}
break;
}
}
}
return ans;
}| # | 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... | ||||
