# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
253514 | Badrangiikh | Arranging Shoes (IOI19_shoes) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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);*/
long long count_swaps ( vector < int > s ) {
long long n = s . size ( ) ;
if ( n == 2 ) {
if ( s [ 0 ] < s [ 1 ] ) return 0 ;
else return 1 ;
}
long long x = 0 ;
for ( long long 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 ( long long i = 0 ; i < n ; i ++ ) {
if ( s [ i ] < 0 ) {
z += abs ( i - y ) ;
y += 2 ;
}
}
return z ;
}
long long x = 0 ;
while ( s . size ( ) > 0 ) {
int n = s . size ( ) ;
for ( int i = 0 ; i < n ; i ++ ) {
if ( s [ i ] < 0 ) {
for ( int j = 0 ; j < n ; j ++ ) {
if ( s [ j ] == ( -1 ) * s [ i ] ) {
if ( j > i ) {
x += ( i + j - 1 ) ;
s . erase ( s . begin ( ) + j ) ;
s . erase ( s . begin ( ) + i ) ;
}
else {
x += ( i + j ) ;
s . erase ( s . begin ( ) + i ) ;
s . erase ( s . begin ( ) + j ) ;
}
break ;
}
}
break ;
}
}
}
return x ;
}