제출 #1172531

#제출 시각아이디문제언어결과실행 시간메모리
1172531versesrevArranging Shoes (IOI19_shoes)C++20
25 / 100
12 ms1864 KiB
// 22:03 #include <vector> long long count_swaps(std::vector<int> ss) { long long n = ss.size() / 2; if (ss[0] < 0) return n * (n - 1) / 2; else return 1; }
#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...