Submission #145093

#	Time	Username	Problem	Language	Result	Execution time	Memory
145093		JovanK26	Arranging Shoes (IOI19_shoes)	C++14	65 / 100	1071 ms	2012 KiB

shoes

#include "shoes.h"
#include<bits/stdc++.h>
using namespace std;
int pos[100001];
long long count_swaps(vector<int> s)
{
    long long rez=0;
	int n=s.size();
	long long nn=n/2;
    bool check=0;
    for(int i=0;i+nn<n;i++)
    {
        if(s[i]>0 || s[i+nn]<0)
        {
            check=1;
            break;
        }
        else if(-s[i]!=s[i+nn])
        {
            check=1;
            break;
        }
    }
    if(!check)
    {
        rez=(nn*(nn-1))/2;
        return rez;
    }
    for(int i=0;i<n;i+=2)
    {
       for(int j=i+1;j<n;j++)
       {
           if(abs(s[i])==abs(s[j]) && s[i]*s[j]<0)
           {
               for(int k=j;k>i+1;k--)
               {
                   swap(s[k],s[k-1]);
                   rez++;
               }
               if(s[i+1]<0)
               {
                   swap(s[i],s[i+1]);
                   rez++;
               }
               break;
           }
       }
    }
    return rez;
}

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