Submission #896174

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
896174	2024-01-01 00:15:51	svaz	Arranging Shoes (IOI19_shoes)	C++14	50 / 100	1098 ms	142552 KiB

shoes

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "shoes.h"
#include<iostream>
#include<vector>
#include<deque>
#include<map>
using namespace std;
long long count_swaps(std::vector<int> S){
    map < int , pair < deque<pair<int,int> >,deque<pair<int,int> > > > alm;
    int tam=S.size();
    vector<bool> visitados(tam,false);
    for(int i=0;i<tam;i++)
    {
        int absol=abs(S[i]);
        if(S[i]<0) ((alm[absol]).first).push_back(make_pair(i,i)); /// los izquierdos al primero
        else ((alm[absol]).second).push_back(make_pair(i,i));/// los derechos al segundo
    }
   // cout<<"siii"<<endl;
    int ans=0,empares=0;
    for(int i=0;i<tam;i++){
       // cout<<"vuelta "<<i+1<<endl;
        int p_izq,p_der,dif,p_mov;
        if(! visitados[i]){///si no esta emparejado
            empares++;
          //  cout<<"no esta emparejado"<<endl;
            int absol=abs(S[i]);
           // cout<<"el tipo de zapato es el "<<absol<<endl;
            p_izq=(((alm[absol]).first).front()).second;
           // cout<<"el zapato izquierdo esta en "<<p_izq<<endl;
            p_der=(((alm[absol]).second).front()).second;
          //  cout<<"el zapato derecho esta en "<<p_der<<endl;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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