| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1237086 | Ghulam_Junaid | Arranging Shoes (IOI19_shoes) | C++20 | 0 ms | 324 KiB |
#include <bits/stdc++.h>
#include "shoes.h"
using namespace std;
typedef long long ll;
long long count_swaps(vector<int> s) {
int ans = 0;
for (int cur = 0; cur < s.size(); cur ++){
int f = cur;
while (f < s.size() and s[f] > 0)
f++;
for (int i = f; i > cur; i --)
swap(s[i], s[i - 1]);
ans += f - cur;
f = cur + 1;
while (f < s.size() and -s[f] != s[cur])
f++;
for (int i = f; i > cur + 1; i --)
swap(s[i], s[i - 1]);
ans += f - cur - 1;
}
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... | ||||
