| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1251275 | mohamedboukerche55 | Arranging Shoes (IOI19_shoes) | C++20 | 14 ms | 1952 KiB |
#include "shoes.h"
using namespace std;
long long count_swaps(std::vector<int> s)
{
int n = s.size() / 2;
long long swaps = 0;
long long l = 0;
long long r = 0;
for(int i = 0 ; i < n * (1 << 1) ; i++)
{
if(s[i] < 0)
{
l += abs(i - r);
r += 2;
}
}
swaps = l;
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... | ||||
