Submission #198917

#	Time	Username	Problem	Language	Result	Execution time	Memory
198917		kshitij_sodani	Arranging Shoes (IOI19_shoes)	C++17	25 / 100	40 ms	2016 KiB

shoes

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef  long long int llo;
#define mp make_pair
#define pb push_back
#define a first
#define b second
#include "shoes.h"
 
long long count_swaps(vector<int> s){
	long long n=s.size();
    n/=2;
	if(n==1){
		if(s[0]<0){
			return 0;
		}
		else{
			return 1;
		}
	}
	int x=s[0];
	int st=0;
	for(int i=0;i<2*n;i++){
		if(abs(s[i])!=x){
			st=1;
		}
	}
	if(st==0){
		
		long long tot=0;
		long long ind=0;
		for(long long i=0;i<2*n;i++){
			if(s[i]<0){
				tot+=abs(i-ind);
				ind+=2;
			}

		}
		long long tot2=0;
		ind=1;
		for(long long i=0;i<2*n;i++){
			if(s[i]>0){
				tot+=abs(i-ind);
				ind+=2;
			}

		}

		return min(tot,tot2);

	}

	return ((n*(n-1))/2);
 
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 15 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 15