Submission #1311411

#	Time	Username	Problem	Language	Result	Execution time	Memory
1311411		putuputu	Arranging Shoes (IOI19_shoes)	C++20	0 / 100	1094 ms	1956 KiB

shoes

#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
long long count_swaps(vector<int>a){
    int m=a.size();
    long long s=0;
    int n=m/2;
    bool ok=true;
    for(int i=0; i<n-1; i++){
        if(a[i]!=a[i+n]){
            ok=false;
        }
    }
    if(ok==true){
        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: 0 / 10
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 15