Submission #630669

#TimeUsernameProblemLanguageResultExecution timeMemory
630669fadyscubeArranging Shoes (IOI19_shoes)C++17
50 / 100
562 ms1048576 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long int getIndex(vector<int> v, int K) { auto it = find(v.begin(), v.end(), K); if (it != v.end()) return it - v.begin(); else return -1; } int ans = 0; ll count_swaps(vector<int> S) { if (S.size() == 2) { ans += (S[0] > 0) ? 1 : 0; return ans; } else if (S.size() < 2) return ans; int in = getIndex(S, S[0]*-1); ans += S[0] > 0 ? in : in-1; S.erase(S.begin()+in); S.erase(S.begin()+0); return count_swaps(S); }
#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...