# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
558125 | imalcok | Arranging Shoes (IOI19_shoes) | C++17 | 1082 ms | 3128 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>
using namespace std;
long long count_swaps(std::vector<int> S){
long long c = 0;
for (int i = 0; i < S.size(); i+=2)
{
if (S[i] < 0){
int j = i+1;
while (S[j] != (-1)*S[i]) j++;
for (int k = 0; k < j-i-1; k++)
{
int temp;
temp = S[j-k-1];
S[j-k-1] = S[j-k];
S[j-k] = temp;
}
c += (long long)(j-i-1);
}
else
{
int j = i+1;
while(S[j] != (-1)*S[i]) j++;
for (int k = 0; k < j-i; k++)
{
int temp;
temp = S[j-k-1];
S[j-k-1] = S[j-k];
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... |