제출 #144770

#제출 시각아이디문제언어결과실행 시간메모리
144770monus1042Arranging Shoes (IOI19_shoes)C++17
25 / 100
31 ms1920 KiB
#include "shoes.h" long long count_swaps(std::vector<int> s) { if (s.size()<=16){ long long counterTOT=0; for (unsigned int i=0; i<s.size(); i+=2){ unsigned int j; j=i; while(s[j]>0){ ++j; } while(i!=j){ std::swap(s[j],s[j-1]); ++counterTOT; --j; } j=i+1; while(s[j]!=s[i]*-1){ ++j; } while(i+1!=j){ std::swap(s[j],s[j-1]); ++counterTOT; --j; } } return counterTOT; }else{ long long x=s.size()/2; return x*(x-1)/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...