제출 #418191

#제출 시각아이디문제언어결과실행 시간메모리
418191AderfishArranging Shoes (IOI19_shoes)C++14
10 / 100
29 ms3100 KiB
#include "shoes.h" long long count_swaps(std::vector<int> s) { int n = s.size()/2; if(n == 1){ if(s[0] < 0) return 0; else return 1; } else{ int swaps = 0; for(int i = 0; i < n; i++){ swaps += i; } return swaps; } return 0; }
#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...