| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1334607 | enson | Arranging Shoes (IOI19_shoes) | C++20 | 14 ms | 1960 KiB |
#include <bits/stdc++.h>
using namespace std;
long long count_swaps(vector<int>S){
if (S.size() == 2){
if (S[0] < 0) return 0;
return 1;
}
int a = 0, r = 0;
for(int i = 0; i < S.size(); i++){
if (S[i] < 0){
a++;
r += abs(i - 2*(a-1));
}
}
return r;
}| # | 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... | ||||
