Submission #909918

#TimeUsernameProblemLanguageResultExecution timeMemory
909918vjudge1Arranging Shoes (IOI19_shoes)C++17
25 / 100
16 ms3164 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<int, int>; ll count_swaps(vector<int> shoes) { if (shoes.size() == 2) return shoes[0] > shoes[1]; ll swaps = 0; int n = (shoes.size() + 1) / 2; for (int i = 1; i < n; i++) swaps += n - i; return swaps; }
#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...