Submission #200384

#TimeUsernameProblemLanguageResultExecution timeMemory
200384thiago4532Arranging Shoes (IOI19_shoes)C++17
50 / 100
1096 ms1952 KiB
#include "shoes.h"
#include <iostream>

using namespace std;

long long count_swaps(std::vector<int> s) {
	long long sum = 0;

	for (int i = 0; i < (int)s.size(); i+=2) {
		int j;
		for (j = i + 1; j < (int)s.size(); j++) {
			if(s[j] + s[i] == 0) break;
		}

		sum += (j - i);
		if (s[i] < 0) sum--;

		for (;j > i; j--)
			swap(s[j], s[j-1]);

		if(s[i] > s[i+1])
			swap(s[i], s[i+1]);

		// for(auto& e : s)
		// 	cout << e << ' ';
		// cout << "\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...