Submission #1217756

#TimeUsernameProblemLanguageResultExecution timeMemory
121775612baaterArranging Shoes (IOI19_shoes)C++20
10 / 100
0 ms328 KiB
#include "shoes.h"
#include <iostream>
#include <algorithm>
using namespace std;

long long total = 0;
bool comp(const int a, const int b) {
	bool ans = abs(a) < abs(b) || (abs(a) == abs(b) && a < b);
	total += ans;
	return ans;
}


long long count_swaps(std::vector<int> s) {
	sort(s.begin(),s.end(),comp);
	return total;
}
#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...