제출 #1172529

#제출 시각아이디문제언어결과실행 시간메모리
1172529versesrevArranging Shoes (IOI19_shoes)C++20
0 / 100
0 ms324 KiB
// 22:03
#include <vector>

long long count_swaps(std::vector<int> ss) {
  long long n = ss.size();
  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...