Submission #834270

#TimeUsernameProblemLanguageResultExecution timeMemory
834270GordonRemzi007Xor Sort (eJOI20_xorsort)C++17
0 / 100
1 ms212 KiB
#include <bits/stdc++.h> using namespace std; int main() { int n, s; cin >> n >> s; vector<int> a(n), b(n); vector<pair<int,int>> op; map<int,int> pos; for(int i = 0; i < n; i++) { cin >> a[i]; b[i] = a[i]; pos[a[i]] = i; } sort(b.begin(), b.end()); for(int i = 0; i < n; i++) { for(int j = pos[b[i]]; j > i; j--) { op.push_back({j-1, j}); op.push_back({j, j-1}); op.push_back({j-1, j}); pos[a[j-1]] = j; a[j] = a[j-1]; } pos[b[i]] = i; a[i] = b[i]; } cout << op.size() << "\n"; for(auto i : op) cout << i.first << " " << i.second << "\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...