제출 #501072

#제출 시각아이디문제언어결과실행 시간메모리
501072LucaIlieArranging Shoes (IOI19_shoes)C++17
10 / 100
1089 ms1856 KiB
#include <stdio.h> #include <vector> #include "shoes.h" using namespace std; long long count_swaps( vector <int> s ) { int n, i, j, l; long long nrSwaps; n = s.size() / 2; nrSwaps = 0; for ( i = 0; i < n; i++ ) { j = 2 * i; while ( s[j] > 0 ) j++; for ( l = j; l > 2 * i; l-- ) { swap( s[l], s[l - 1] ); nrSwaps++; } j = 2 * i + 1; while ( s[j] != -s[2 * i] ) j++; for ( l = j; l > 2 * i + 1; l-- ) { swap( s[l], s[l - 1] ); nrSwaps++; } } return nrSwaps; }
#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...