| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1311391 | gabrielz | Arranging Shoes (IOI19_shoes) | C++20 | 1 ms | 336 KiB |
#include <bits/stdc++.h>
using namespace std;
long long count_swaps(std::vector<int> srr) {
int n = srr.size();
int ls = 0;
for (auto i = 0; i < n-1; ++i) {
if (+srr[i] == srr[i+1]) {
i += 1; continue;
}
int res = 0, j = 0;
for (j = i+1; j < n and +min(srr[i], srr[j]) != max(srr[i], srr[j]); ++j) {
res += 1;
}
ls += res;
swap(srr[i], srr[j]);
}
return ls;
}| # | 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... | ||||
