# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
466459 | 2021-08-19T10:24:43 Z | myvaluska | Xor Sort (eJOI20_xorsort) | C++14 | 0 ms | 204 KB |
// palindromefree.cpp : This file contains the 'main' function. Program execution begins and ends there. // #include <iostream> #include <string> #include <vector> #include <algorithm> using namespace std; //long long int cifra[20]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; int s; cin >> n; cin >> s; vector<int>v(n); for (int i = 0; i < n; i++) { cin >> v[i]; } vector<pair<int, int>>vys; for (int i = 0; i < n; i++) { for (int j = 0; j < n-1; j++) { if (v[j] > v[j + 1]) { vys.push_back({ j,j + 1 }); vys.push_back({ j + 1,j }); swap(v[j], v[j + 1]); } } } cout << vys.size() << endl; for (int i = 0; i < vys.size(); i++) { cout << vys[i].first + 1 << ' '; cout << vys[i].second + 1 << endl; } return 0; //std::cout << "Hello World!\n"; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 204 KB | Not sorted |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 204 KB | Not sorted |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 204 KB | Not sorted |
2 | Halted | 0 ms | 0 KB | - |