제출 #888591

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
888591		Lincito_31	Arranging Shoes (IOI19_shoes)	C++14	0 / 100	1 ms	604 KiB

shoes

#include <bits/stdc++.h>
#include "shoes.h"
using namespace std;
long long x=0;
long long count_swaps(vector<int> s) {
	/*while(!s.empty()){
        int i=0;
        while(s[i]>0){
            i++;
        }
        x+=i;
        int abso=-s[i];
        s.erase(s.begin()+i);
        i=0;
        while(s[i]!=abso){
            i++;
        }
        x+=i;
        s.erase(s.begin()+i);
	}
	return x;*/
	int num;
	if(s[0]<0){
        num=-s[0];
	}else{
	    num=s[0];
	}
	while(s[0]==-num && s[1]==num){
        s.erase(s.begin(),s.begin()+2);
	}
	int tam=s.size();
	while(s[tam-2]==-num && s[tam-1]==num){
	    cout << "a";
        s.erase(s.end()-2,s.end());
        tam=s.size();
	}
	while(!s.empty()){
	    int con=0;
        while(s[con]!=-num){
            con++;
        }
        x+=con;
        s.erase(s.begin()+con);
        con=0;
        while(s[con]!=num){
            con++;
        }
        x+=con;
        s.erase(s.begin()+con);
	}
	return x;
}

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