Submission #1206010

#TimeUsernameProblemLanguageResultExecution timeMemory
1206010JakobZorzArranging Shoes (IOI19_shoes)C++20
50 / 100
1095 ms1864 KiB
#include "shoes.h"
using namespace std;
typedef long long ll;

ll count_swaps(vector<int>arr){
	int n=(int)arr.size();
	ll res=0;
	for(int i=0;i<n;i+=2){
		int v=arr[i];
		int i2=-1;
		for(int j=i+1;j<n;j++)
			if(arr[j]==-v){
				i2=j;
				break;
			}
		while(i2!=i+1){
			swap(arr[i2],arr[i2-1]);
			i2--;	
			res++;
		}	
		if(arr[i]>arr[i+1])
			res++;
	}
	return res;
}
#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...