Submission #1364943

#TimeUsernameProblemLanguageResultExecution timeMemory
1364943yavor_ptvArranging Shoes (IOI19_shoes)C++20
50 / 100
1095 ms2728 KiB
#include <bits/stdc++.h>
#include "shoes.h"
#define ll long long
//#include "grader.cpp"

using namespace std;

vector <int> v;

long long count_swaps(vector<int> s)
{
    v = s;
    ll n = v.size();
    ll ptr = 0, ans = 0;
    while (ptr < n)
    {
        ll pos = -1;
        for (int i = ptr + 1; i < n; i++)
        {
            if (v[ptr] + v[i] == 0)
            {
                pos = i;
                break;
            }
        }
        while (pos != ptr + 1)
        {
            swap(v[pos], v[pos - 1]);
            ans++;
            pos--;
        }
        if (v[ptr] > 0)
        {
            swap(v[ptr], v[ptr + 1]);
            ans++;
        }
        ptr += 2;
    }
    return ans;
}

/*
2
2 1 -1 -2

4

3
-2 2 2 -2 -2 2
1


*/
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...