제출 #144706

#제출 시각아이디문제언어결과실행 시간메모리
144706AASGArranging Shoes (IOI19_shoes)C++14
15 / 100
30 ms1912 KiB
#include "shoes.h" long long count_swaps(std::vector<int> s) { if(s[0]<1 && s.size()==1)return 0; else if(s[0]>1 && s.size()==1) return 1; long long a; a=s.size()/2; return ((a)*(a-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...