| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1292575 | lukaye_19 | Arranging Shoes (IOI19_shoes) | C++20 | 1095 ms | 2716 KiB |
#include "shoes.h"
using namespace std;
long long count_swaps(vector<int> s) {
vector<int> q = s;
int ans = 0 ;
while (!q.empty()) {
int s = -(*q.begin());
int dist = 0;
auto ptr = ++q.begin();
while (*ptr != s) {
++ptr;
dist++;
}
q.erase(ptr);
q.erase(q.begin());
ans += dist;
if (s < 0) {
ans++;
}
}
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... | ||||
