| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1311369 | aleksandre | Arranging Shoes (IOI19_shoes) | C++20 | 1 ms | 336 KiB |
#include "shoes.h"
long long count_swaps(std::vector<int> s) {
long long swaps = 0;
int n = s.size();
for (int i = 0; i < n; i++) {
if (s[i] < 0) {
for (int j = i + 1; j < n; j++) {
if (s[j] > 0) {
std::swap(s[i], s[j]);
swaps++;
break;
}
}
}
}
return swaps;
}
| # | 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... | ||||
