제출 #520977

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