Submission #253478

#	Time	Username	Problem	Language	Result	Execution time	Memory
253478		Badrangiikh	Arranging Shoes (IOI19_shoes)	C++14	10 / 100	1096 ms	1936 KiB

shoes

#include<bits/stdc++.h>
#include <deque> 
#include <cmath>
using namespace std;
 
#define ll long long 
 
/*freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);*/
 
int count_swaps ( vector < int > s ) {
    int n = s . size ( ) ;
    if ( n == 2 ) {
        if ( s [ 0 ] < s [ 1 ] ) return 0 ;
        else return 1 ;
    }
    int x = 0 ;
    for ( int i = 1 ; i < n ; i ++ ) {
        if ( abs ( s [ i ] ) == abs ( s [ 0 ] ) ) x ++ ;
    }
    if ( x + 1 == n ) {
        long long y = 0 ;
        long long z = 0 ;
        for ( int i = 0 ; i < n ; i ++ ) {
            if ( s [ i ] < 0 ) {
                z += abs ( i - y ) ;
                y += 2 ;
            } 
        }
        return z ;
    }
    x = 0 ;
  	long long y = 0 ;
    while ( n > 0 ) {
        for ( int i = 0 ; i < n ; i ++ ) {
            if ( s [ i ] < 0 ) {
                x += i ;
                y = abs ( s [ i ] ) ;
                s . erase ( s . begin ( ) + i ) ;
              	n -- ;
                for ( int j = 0 ; j < n ; j ++ ) {
                    if ( s [ j ] == y ) {
                        x += j ;
                        s . erase ( s . begin ( ) + j ) ;
                      	n -- ;
                        break ;
                    }
                }
                break ;
            }
        }
    }
    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