Submission #253456

#TimeUsernameProblemLanguageResultExecution timeMemory
253456BadrangiikhArranging Shoes (IOI19_shoes)C++14
45 / 100
29 ms3320 KiB
#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 ) { 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 ; } n = s . size ( ) / 2 ; return ( n - 1 ) * n / 2 ; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...