| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1334438 | yc11 | Arranging Shoes (IOI19_shoes) | C++20 | 14 ms | 1960 KiB |
#include<bits/stdc++.h>
using namespace std;
int64_t count_swaps(vector<int> S){
int64_t l = 0;
int64_t r = 0;
int64_t ans = 0;
for (int i = 0;i<S.size();i++){
if (S[i]>0) { r++;ans = ans+max((int64_t)0,l-r);}
else {l++;ans = ans+max((int64_t)0,r-l+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... | ||||
