Submission #1225367

#TimeUsernameProblemLanguageResultExecution timeMemory
1225367toast12Arranging Shoes (IOI19_shoes)C++20
10 / 100
1 ms328 KiB
#include <bits/stdc++.h>
#include "shoes.h"
using namespace std;

long long count_swaps(vector<int> s) {
	int n = s.size();
	long long ans = 0;
	for (int i = 0; i < n; i += 2) {
		for (int j = i+1; j < n; j++) {
			if (abs(s[j]) == abs(s[i])) {
				for (int k = j-1; k > i; k--) {
					swap(s[k], s[k+1]);
					ans++;
				}
				if (s[i] > s[i+1]) {
					swap(s[i], s[i+1]);
					ans++;
				}
				break;
			}
		}
	}
	return ans;
}
#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...