# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
420271 | 2021-06-08T08:48:01 Z | acm | Xor Sort (eJOI20_xorsort) | C++14 | 1 ms | 204 KB |
#include <bits/stdc++.h> #define speed \ ios_base::sync_with_stdio(0); \ cin.tie(0); \ cout.tie(0); #define precision \ cout.precision(30); \ cerr.precision(10); #define ll long long #define ld long double #define pll pair<ll, ll> #define pii pair<int, int> #define forn(n) for (int i = 1; i <= n; i++) #define forlr(l, r) for (int i = l; i != r; (l > r ? i-- : i++)) #define pb(x) push_back(x) #define sz(x) (int)x.size() #define mp(x, y) make_pair(x, y) #define all(x) x.begin(), x.end() #define pc(x) __builtin_popcount(x) #define pcll(x) __builtin_popcountll(x) #define F first #define S second using namespace std; mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); void ioi(string name) { freopen((name + ".in").c_str(), "r", stdin); freopen((name + ".out").c_str(), "w", stdout); } int n, s, a[1005]; vector<pair<int, int>> v; int main() { speed; precision; // code cin >> n >> s; for (int i = 1; i <= n; i++) { cin >> a[i]; } while (true) { int ok = 1; for (int i = 1; i < n; i++) { if (a[i] < a[i + 1]) { v.pb(mp(i + 1, i)); v.pb(mp(i, i + 1)); v.pb(mp(i + 1, i)); a[i + 1] ^= a[i]; a[i] ^= a[i + 1]; a[i + 1] ^= a[i]; ok = 0; } } if (ok) break; } cout << sz(v) << "\n"; for (auto x : v) cout << x.F << " " << x.S << "\n"; // endl #ifndef ONLINE_JUDGE cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n"; #endif return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Not sorted |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Not sorted |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Not sorted |
2 | Halted | 0 ms | 0 KB | - |