제출 #306326

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