Submission #397884

#TimeUsernameProblemLanguageResultExecution timeMemory
397884snasibov05Arranging Shoes (IOI19_shoes)C++14
45 / 100
49 ms7516 KiB
#include "shoes.h" #include <bits/stdc++.h> using namespace std; long long count_swaps(vector<int> s) { long long ans = 0; int n = s.size(); set<int> st; for (int i = 1; i < n; i += 2) { if (s[i] < 0) st.insert(i); } for (int i = 0; i < n; i += 2) { if (s[i] < 0) continue; ans += abs(*st.begin() - i); st.erase(st.begin()); } 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...