제출 #144720

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