제출 #1179315

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1179315		andriy57	Xor Sort (eJOI20_xorsort)	C++20	0 / 100	985 ms	589824 KiB

xorsort

#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
#define forin for(int i = 1; i <= n; i++)
#define stforin for(int i = 0; i < n; i++)
#define forim for(int i = 1; i <= m; i++)
#define forjn for(int j = 1; j <= n; j++)
#define forch(j, n) for(int i = j; i <= n; i++)
#define forch2(i, j, n) for(int i = j; i <= n; i++)
#define forjm for(int j = 1; j <= m; j++)
#define lol long long
#define lb long double
#define endl '\n'
#define debug cout << "Completed" << endl;
#define fix(n, m) cout << fixed; cout.precision(b); cout << n << endl
#define Yes cout << "YES" << endl
#define No cout << "NO" << endl
#define bads cout << -1 << endl
#define pll pair<lol, lol>
#define mod 998244353
#define fst first
#define snd second
#define inf 1e15
#define tofix cin
; string sbuf;
ostringstream buf(sbuf);
istringstream atcin(sbuf);
//priority_queue <pll, vector<pll>, greater<pll>> q
const long long N = 500;
int ts, n, a[N], hmm;
vector<pair<int, int>> ans;
void solve() {
    cin >> n;
    stforin cin >> a[i];
    while (!hmm) {
        hmm = 1;
        forch(0, n - 2) if (a[i] >= a[i + 1]) {
            hmm = 0;
            a[i] ^= a[i + 1];
            ans.push_back({ i + 1, i + 2 });
            break;
        }
    }
    cout << ans.size() << endl;
    for (auto el : ans) cout << el.first << " " << el.second << endl;
}
int main() {
    ts = 1;
    //cin >> ts;
    while(ts--) solve();
    return 0;
}

• Subtask 1: 0 / 25
• Subtask 2: 0 / 35
• Subtask 3: 0 / 40