제출 #1212441

#제출 시각아이디문제언어결과실행 시간메모리
1212441loiiii12358Arranging Shoes (IOI19_shoes)C++20
10 / 100
1093 ms1960 KiB
#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;

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