| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1320165 | marzuq01 | Arranging Shoes (IOI19_shoes) | C++20 | 16 ms | 4112 KiB |
#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
long long count_swaps(std::vector<int> s) {
//same size;
long long int n2 = s.size();
long long int n = n2 / 2ll;
vector<long long int> left,right;
for (long long int i = 0; i < n2;i++) {
if (s[i] < 0ll) left.push_back(i);
else right.push_back(i);
}
sort(left.begin(),left.end());
long long int count = 0ll;
for (long long int i = 0ll; i < n;i++) {
count += (long long)abs((2*i) - left[i]);
}
return count;
}
| # | 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... | ||||
