제출 #314078

#제출 시각아이디문제언어결과실행 시간메모리
314078asifthegreatArranging Shoes (IOI19_shoes)C++14
50 / 100
1097 ms3224 KiB
#include <bits/stdc++.h>
#include "shoes.h"
// #define int long long
using namespace std;


long long count_swaps(std::vector<int> s) {
	int n = s.size();
	long long moves = 0;
	for(int i = 0; i < n;i+=2){
		int j = i+1;
		while(j <= n and s[j] != -s[i]){
			j++;
		}
		// s[i] = -s[j];
		while(j != i+1){
			swap(s[j], s[j-1]);
			j--;
			moves++;
		}
		if(s[i] > 0)swap(s[i], s[j]), moves++;
	}
	return moves;
}
#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...