# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
466243 | 2021-08-18T11:46:35 Z | CyberCow | Xor Sort (eJOI20_xorsort) | C++17 | 158 ms | 12432 KB |
#include <iostream> #include <algorithm> #include <vector> #include <queue> #include <set> #include <string> #include <cmath> #include <map> #include <unordered_map> #include <fstream> #include <iomanip> #include <iterator> #include <stack> using namespace std; using ll = long long; vector <int> v; vector <pair<int, int>> ans; void bubbleSort() { int i, j; bool swapped; for (i = 0; i < v.size() - 1; i++) { swapped = false; for (j = 0; j < v.size() - i - 1; j++) { if (v[j] > v[j + 1]) { swap(v[j], v[j + 1]); swapped = true; ans.push_back({j, j + 1}); ans.push_back({j + 1, j}); ans.push_back({j, j + 1}); } } if (swapped == false) break; } } int main() { ios_base::sync_with_stdio(false); cin.tie(0); int x, n, i, j, s; cin >> n >> s; for ( i = 0; i < n; i++) { cin >> x; v.push_back(x); } bubbleSort(); cout << ans.size() << endl; for ( i = 0; i < ans.size(); i++) { cout << ans[i].first + 1 << ' ' << ans[i].second + 1 << '\n'; } return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Correct | 1 ms | 204 KB | Output is correct |
3 | Correct | 1 ms | 332 KB | Output is correct |
4 | Correct | 3 ms | 564 KB | Output is correct |
5 | Correct | 4 ms | 592 KB | Output is correct |
6 | Correct | 4 ms | 592 KB | Output is correct |
7 | Correct | 4 ms | 592 KB | Output is correct |
8 | Correct | 4 ms | 592 KB | Output is correct |
9 | Correct | 4 ms | 592 KB | Output is correct |
10 | Correct | 4 ms | 592 KB | Output is correct |
11 | Correct | 1 ms | 204 KB | Output is correct |
12 | Correct | 7 ms | 848 KB | Output is correct |
13 | Correct | 7 ms | 892 KB | Output is correct |
14 | Correct | 7 ms | 976 KB | Output is correct |
15 | Correct | 8 ms | 848 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Correct | 1 ms | 204 KB | Output is correct |
3 | Correct | 1 ms | 332 KB | Output is correct |
4 | Correct | 3 ms | 564 KB | Output is correct |
5 | Correct | 4 ms | 592 KB | Output is correct |
6 | Correct | 4 ms | 592 KB | Output is correct |
7 | Correct | 4 ms | 592 KB | Output is correct |
8 | Correct | 4 ms | 592 KB | Output is correct |
9 | Correct | 4 ms | 592 KB | Output is correct |
10 | Correct | 4 ms | 592 KB | Output is correct |
11 | Correct | 1 ms | 204 KB | Output is correct |
12 | Correct | 7 ms | 848 KB | Output is correct |
13 | Correct | 7 ms | 892 KB | Output is correct |
14 | Correct | 7 ms | 976 KB | Output is correct |
15 | Correct | 8 ms | 848 KB | Output is correct |
16 | Correct | 1 ms | 204 KB | Output is correct |
17 | Correct | 4 ms | 592 KB | Output is correct |
18 | Correct | 6 ms | 848 KB | Output is correct |
19 | Correct | 6 ms | 848 KB | Output is correct |
20 | Correct | 6 ms | 848 KB | Output is correct |
21 | Correct | 6 ms | 848 KB | Output is correct |
22 | Correct | 6 ms | 848 KB | Output is correct |
23 | Correct | 6 ms | 848 KB | Output is correct |
24 | Correct | 6 ms | 848 KB | Output is correct |
25 | Correct | 7 ms | 848 KB | Output is correct |
26 | Incorrect | 12 ms | 1228 KB | Integer 59568 violates the range [0, 40000] |
27 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Correct | 1 ms | 312 KB | Output is correct |
3 | Correct | 1 ms | 332 KB | Output is correct |
4 | Correct | 6 ms | 848 KB | Output is correct |
5 | Incorrect | 158 ms | 12432 KB | Integer 764742 violates the range [0, 40000] |
6 | Halted | 0 ms | 0 KB | - |