| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1203122 | SpyrosAliv | Arranging Shoes (IOI19_shoes) | C++20 | 13 ms | 2636 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int n;
vector<int> a;
ll count_swaps(vector<int> s) {
n = s.size();
a = s;
n /= 2;
int init = n;
ll ans = 0;
for (int i = 1; i <= n; i++) ans += (n - 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... | ||||
