Submission #153741

#TimeUsernameProblemLanguageResultExecution timeMemory
153741asifthegreatArranging Shoes (IOI19_shoes)C++14
10 / 100
31 ms3192 KiB
#include <bits/stdc++.h>
using namespace std;
// #include <queue>
#include "shoes.h"

long long count_swaps(std::vector<int> s) {
	if(s.size() == 2){
		if(s[0] < s[1])return 0;
		return 1;
	}
	int n = (int)s.size()/2;
	return n*(n-1)/2;
}

// int main() {
// 	int n;
// 	scanf("%d", &n);
// 	vector<int> S(2 * n);
// 	for(int i = 0; i < 2 * n; i++)
// 		scanf("%d", &S[i]);
// 	long long result = count_swaps(S);
// 	printf("%lld\n", result);
// 	return 0;
// }
#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...