| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 580742 | vladilius | Arranging Shoes (IOI19_shoes) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "shoes.h"
#include <bits/stdc++.h>
#include <vector>
#include "grader.cpp"
using namespace std;
int count_swaps(vector<int> l){
int n = (int) l.size();
if (n == 2){
if (l[0] < l[1]){
return 0;
}
else {
return 1;
}
}
return -1;
}
