| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1301777 | yusifm | Arranging Shoes (IOI19_shoes) | C++20 | 1 ms | 340 KiB |
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include "shoes.h"
using namespace std;
long long count_swaps(vector<int>nums)
{
long long ans=0;
vector<int>indexes1,indexes2;
for(int i=0;i<nums.size();i++)
{
if(nums[i]<0)
{
indexes1.push_back(i);
}
else
{
indexes2.push_back(i);
}
}
for(int i=0;i<indexes1.size();i++)
{
ans+=abs(indexes1[i]-2*i);
}
for(int i=0;i<indexes2.size();i++)
{
ans+=abs(indexes2[i]-2*i-1);
}
return ans;
}| # | 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... | ||||
