제출 #253526

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
253526		Badrangiikh	Arranging Shoes (IOI19_shoes)	C++14	45 / 100	44 ms	3208 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);*/
 
long long m , s1 , s2 , y ;
 
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 ;
    }
  	x = 0 ;
  	for ( int i = 0 ; i < n / 2 ; i ++ ) {
      	if ( s [ i ] == ( -1 ) * s [ i + n / 2 ] ) {
          	x ++ ;
        }
      	if ( x * 2 == n ) {
          	y = ( n / 2 ) * ( n / 2 - 1 ) / 2 ;
          	return y ;
        }
    }
  	if ( n <= 2000 ) {
      	for ( int i = 0 ; i < n ; i += 2 ) {
            for ( int j = i + 1 ; j < n ; j ++ ) {
                if ( ( -1 ) * s [ i ] == s [ j ] ) {
                    for ( int l = j ; l >= i + 2 ; l -- ) {
                      	y = s [ l ] ;
                      	s [ l ] = s [ l - 1 ] ;
                      	s [ l - 1 ] = y ;
                        x ++ ;
                    }
                    break;
                }
            }
            if ( s [ i ] > s [ i + 1 ] ) {
              	x ++ ;
            }
        }
        return x ;
    }
  	x = ( n / 2 ) * ( n / 2 - 1 ) / 2 ;
  	return x ;
}

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