Submission #144783

#	Time	Username	Problem	Language	Result	Execution time	Memory
144783		monus1042	Arranging Shoes (IOI19_shoes)	C++17	65 / 100	30 ms	1948 KiB

shoes

#include "shoes.h"
 
long long count_swaps(std::vector<int> s) {
    if (s.size()<=2000){
		long long counterTOT=0;
		for (unsigned int i=0; i<s.size(); i+=2){
			unsigned int j;
			j=i+1;
			while(s[j]!=s[i]*-1){
				++j;
			}
			while(i+1!=j){
				std::swap(s[j],s[j-1]);
				++counterTOT;
				--j;
			}
			if (s[j]<0) {std::swap(s[j],s[j-1]); ++counterTOT;}
		}
		return counterTOT;
	}else{
		long long x=s.size()/2;
		return x*(x-1)/2;
	}
}

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