| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1334655 | sporknives | Arranging Shoes (IOI19_shoes) | C++20 | 24 ms | 2596 KiB |
#include <bits/stdc++.h>
#include "shoes.h"
using namespace std;
typedef long long ll;
long long count_swaps(std::vector<int> s) {
vector<int> pos;
for(int i=0;i<s.size();i++) {
if(s[i]<0)pos.push_back(i);
}
ll ans=0;
for(int i=0;i<pos.size();i++) {
ans+=abs(pos[i]-2*i);
}
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... | ||||
