| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1242508 | duhendorfus | Arranging Shoes (IOI19_shoes) | C++20 | 0 ms | 328 KiB |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll sub1(vector<int> S){
if (S[0] < 0 && S[1] > 0) return 0;
else return 1;
}
ll count_swaps(vector<int> S){
int si = S.size() / 2;
if (si == 1 && abs(S[0]) == abs(S[1])) return sub1(S);
else return 0;
}
| # | 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... | ||||
