| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1237097 | Ghulam_Junaid | Arranging Shoes (IOI19_shoes) | C++20 | 1095 ms | 1864 KiB |
#include <bits/stdc++.h>
#include "shoes.h"
// #include "grader.cpp"
using namespace std;
typedef long long ll;
ll count_swaps(vector<int> s) {
ll ans = 0;
for (int cur = 0; cur < s.size(); cur += 2){
int f = cur + 1;
while (s[f] != -s[cur])
f ++;
for (int i = f; i > cur + 1; i --)
swap(s[i], s[i - 1]);
ans += f - cur - 1;
if (s[cur] > 0)
ans++;
}
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... | ||||
