This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define endl endl
const int mod = 1e9 + 7;
const int maxn = 10005;
int n, s, arr[maxn];
vector < pair < int, int >> ans;
void s1()
{
for(int i = n - 1; i >= 0; i--)
{
int mx = -1;
for(int j = 0; j <= i; j++) if(mx == -1 || arr[mx] < arr[j]) mx = j;
for(int j = 0; j < i; j++) ans.push_back({j, j + 1});
for (int j = mx + 1; j <= i; j++) ans.push_back({j, j - 1});
for (int j = mx - 2; j >= 0; j--) ans.push_back({j, j + 1});
for (int j = mx; j + 1 < n; j++) swap(arr[j], arr[j + 1]);
}
for (int i = n - 2; i >= 0; --i) ans.push_back({i, i + 1});
}
void s2()
{
for(int i = 19; i >= 0; i--)
{
for(int j = 0; j < n - 1; j++)
{
if(arr[j + 1] >= (1 << (i + 1))) break;
if(!(arr[j] & (1 << i))) continue;
if(!(arr[j + 1] & (1 << i))) ans.push_back({j + 1, j}), arr[j + 1] ^= arr[j];
ans.push_back({j, j + 1});
arr[j] ^= arr[j + 1];
}
}
}
void solve()
{
cin >> n >> s;
for(int i = 0; i < n; i++) cin >> arr[i];
if(s == 1) s1();
else s2();
cout << ans.size() << endl;
for(auto [i, j] : ans) cout << i << " " << j << endl;
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int tt = 1;
//cin >> tt;
while(tt--) solve();
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |