Submission #1311434

#	Time	Username	Problem	Language	Result	Execution time	Memory
1311434		lizi14	Arranging Shoes (IOI19_shoes)	C++20	25 / 100	13 ms	1972 KiB

shoes

#include "shoes.h"
#include <cstdio>
#include <cassert>
#include <bits/stdc++.h>
using namespace std;

//#include "shoes.h"

long long count_swaps(vector<int> s) {
    long long n=s.size()/2;
    if(n==1){
        if(s[0]<0 && s[1]>0){
            return 0;
        }
        else return 1;
    }
    long long cnt=0;
   
    for(int i=0; i<n; i++){
        if(!(abs(s[i])==s[i+n] && s[i]<0)){
            cnt=1;
            break;
        }
    }
    if(cnt==0){
        return (n*(n-1)/2);
    }
    int c[2*n];
    fill(c,c+2*n,0);
    int ans=0;
    for(int i=0; i<2*n; i++){
        if(c[i]==0){
            if(s[i]<0){
                int ans1=-1;
                for(int j=i; j<2*n; j++){
                    if(s[j]==abs(s[i]) && c[j]==0){
                        ans+=j-i-1;
                        c[j]=1;
                        c[i]=1;
                        break;
                    }
                }
            }
            else{
                for(int j=i; j<2*n; j++){
                    if(abs(s[j])==s[i] && c[j]==0){
                        ans+=j-i+1;
                        c[j]=1;
                        c[i]=1;
                        break;
                    }
                }
            }
        }
    }
    return ans;
}

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