Submission #1311421

#	Time	Username	Problem	Language	Result	Execution time	Memory
1311421		putuputu	Arranging Shoes (IOI19_shoes)	C++20	65 / 100	1094 ms	1964 KiB

shoes

#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
long long count_swaps(vector<int>a){
    long long m=a.size();
    long long s=0;
    long long n=m/2;
    //bool ok=true;
    long long cnt=0;
    for(int i=0; i<n; i++){
      if(!(a[i]<0 && abs(a[i])==a[i+n] && a[i+n]>0)){
        cnt++;
      }
        // if(a[i]!=a[i+n]){
        //     ok=false;
        // }
    }
    if(cnt==0){
        return(n*(n-1)/2);
    }
    for(int pos=0; pos<m; pos+=2){
        if(a[pos]>0){
            int nl=-a[pos]; 
            int j=pos+1;
            while(j<m and a[j]!=nl){
               j++; 
            } 
            while(j>pos){
                swap(a[j], a[j-1]);
                j--;
                s++;
            }
        }
        int nr=-a[pos];
        int j=pos+1;
        while(j<m and a[j]!=nr){
            j++;
        } 
        while(j>pos+1){
            swap(a[j], a[j-1]);
            j--;
            s++;
        }
    }
    return s;
    
}

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