Submission #143195

#	Time	Username	Problem	Language	Result	Execution time	Memory
143195		Navick	Arranging Shoes (IOI19_shoes)	C++17	50 / 100	1072 ms	2040 KiB

shoes

#include "shoes.h"

long long count_swaps(std::vector<int> s) {
	int n = s.size() / 2;
	long long answer = 0;

	for (int i=0; i<2*n; i+=2) {
        for (int j=i+1; j<2*n; j++)
            if(s[j] == -s[i]) {
                answer += j - i - 1;
                for (int k=j-1; k>=i+1; k--)
                    s[k + 1] = s[k];
                break ;
            }

        if(s[i] > 0) answer ++;
	}

	return answer;

}

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 15
• Subtask 5: 20 / 20
• Subtask 6: 0 / 15