Submission #888555

#	Time	Username	Problem	Language	Result	Execution time	Memory
888555		Lincito_31	Arranging Shoes (IOI19_shoes)	C++14	10 / 100	1084 ms	5492 KiB

shoes

#include <bits/stdc++.h>
#include "shoes.h"
using namespace std;
long long x;
long long count_swaps(vector<int> s) {
	//x=s.size();
	//x/=2;
	/*if(x==1){
        return s[0]<0?0:1;
	}else{
	    x=x*(x-1)/2;
        return x;
	*/
	while(!s.empty()){
        long long i=0;
        while(s[i]>0){
            i++;
        }
        x+=i;
        long long abso=-1*s[i];
        vector<int> ant(s.begin(),s.begin()+i);
        vector<int> pos(s.begin()+i+1,s.end());
        ant.insert(ant.end(),pos.begin(),pos.end());
        s=ant;
        i=0;
        while(s[i]!=abso){
            i++;
        }
        x+=i;
        vector<int> ante(s.begin(),s.begin()+i);
        vector<int> post(s.begin()+i+1,s.end());
        ante.insert(ante.end(),post.begin(),post.end());
        s=ante;
	}
	return x;
}

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