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