| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1321322 | jahinahnaf | Arranging Shoes (IOI19_shoes) | C++20 | 12 ms | 1936 KiB |
#include "shoes.h"
long long count_swaps(std::vector<int> s) {
int n = s.size();
if (n == 2){
if (s[0] == -1) return 0;
}
else{
int count = 0;
for (int i = 0; i < n; i++){
if (i % 2 == 0 && s[i] != -1) count++;
else if (i % 2 == 1 && s[i] != 1) count++;
}
return count/2;
}
return 1;
}
| # | 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... | ||||
