# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
221531 | mathking1021 | Arranging Shoes (IOI19_shoes) | C++14 | 1095 ms | 3192 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 <iostream>
long long count_swaps(std::vector<int> s)
{
typedef long long ll;
using namespace std;
ll cnt = 0;
for(ll i = 0; i < s.size(); i+=2)
{
for(ll j = i + 1; j < s.size(); j++)
{
if(s[i] + s[j] == 0)
{
for(ll k = j; k >= i + 2; k--)
{
swap(s[k], s[k - 1]);
cnt++;
}
break;
}
}
if(s[i] > 0) swap(s[i], s[i + 1]), cnt++;
}
return cnt;
}
Compilation message (stderr)
# | 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... |