# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
600636 | nguyenTien | Arranging Shoes (IOI19_shoes) | C++14 | 23 ms | 3088 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 <bits/stdc++.h>
#include <shoes.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
ll res = 0;
void sub1(vector <int>& v)
{
if(v[0] < 0) res = 0;
else res = 1;
}
long long count_swaps(std::vector<int> s) {
int n = s.size() / 2;
if(n == 1)
{
sub1(s);
return res;
}
return 1;
}
# | 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... |