Submission #766675

#TimeUsernameProblemLanguageResultExecution timeMemory
766675t6twotwoArranging Shoes (IOI19_shoes)C++17
50 / 100
1083 ms1876 KiB
#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll count_swaps(vector<int> s) {
	int n = s.size() / 2;
	int ans = 0;
	for (int i = 0; i < 2 * n; i += 2) {
        if (s[i] > 0) {
            int x = i;
            while (s[x] != -s[i]) {
                x++;
            }
            for (int j = x; j > i; j--) {
                swap(s[j], s[j - 1]);
                ans++;
            }
        } else {
            int x = i + 1;
            while (s[x] != -s[i]) {
                x++;
            }
            for (int j = x; j > i + 1; j--) {
                swap(s[j], s[j - 1]);
                ans++;
            }
        }
	}
	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...