Submission #1219433

#TimeUsernameProblemLanguageResultExecution timeMemory
1219433moondarksideArranging Shoes (IOI19_shoes)C++20
10 / 100
1096 ms1984 KiB
#include <iostream>
#include<bits/stdc++.h>
using namespace std;

int pushDown(int x, int y,vector<int>& S) {
	int vo=S[y];
	for(int i=y; i>x; i--) {
		S[i]=S[i-1];
	}
	S[x]=vo;
	return y-x;
}

int count_swaps(std::vector<int>S) {
	int swaps=0;
	int pos=0;
	for(int i=0; i<S.size(); i++) {
		int val=S[i];
		if(S[i]<0) {
			swaps+=pushDown(pos,i,S);
			int k=pos+1;
			for(; S[k]!=-val; k++) {}
			swaps+=pushDown(pos+1,k,S);
			pos+=2;
		}

	}
	return swaps;





}
#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...