Submission #590876

#TimeUsernameProblemLanguageResultExecution timeMemory
590876someoneArranging Shoes (IOI19_shoes)C++14
0 / 100
0 ms212 KiB
#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;

long long count_swaps(std::vector<int> s) {
    int n = (int)s.size();
	long long sum = 0;
    for(int i = 0; i < n; i+=2) {
        int search = -s[i];
        for(int j = i+1; j < n; j++) {
            if(s[j] == search) {
                if(search < 0)
                    sum += j-i;
                else
                    sum += j-i+1;
                for(int k = j; k > i; k--)
                    swap(s[k], s[k-1]);
                j = n;
            }
        }
    }
    return sum;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...