Submission #314548

#TimeUsernameProblemLanguageResultExecution timeMemory
314548baibhav26062008Arranging Shoes (IOI19_shoes)C++14
10 / 100
30 ms2040 KiB
#include "shoes.h" #include <bits/stdc++.h> using namespace std; long long count_swaps(std::vector<int> s) { int n = s.size()/2; if (n == 1) { if (s[0] < s[1]) { return 0; } else { return 1; } } int ans=0; for (int i = 0; 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...