Submission #947068

#TimeUsernameProblemLanguageResultExecution timeMemory
947068studyArranging Shoes (IOI19_shoes)C++17
50 / 100
1061 ms3256 KiB
#include "shoes.h" #include <bits/stdc++.h> using namespace std; long long count_swaps(std::vector<int> s) { int cnt=0, n = s.size(); for (int i=0; i<n; i += 2){ int idx = 0; for (int j=i+1; j<n; ++j){ if (s[i] == -s[j]){ idx = j; break; } } for (int j=idx; j>=i+2; --j){ swap(s[j],s[j-1]); ++cnt; } if (s[i] > 0){ ++cnt; } } return cnt; }
#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...