#include "bits/stdc++.h"
using namespace std;
#define ar array
vector<ar<int, 2>> get(vector<int>& a, int b = 20){
if(a.empty()) return {};
vector<int> tmp;
for(auto x : a) tmp.push_back(x>>b&1);
vector<ar<int, 2>> rr;
for(int i=0;i+1<(int)tmp.size();i++){
if(tmp[i] && tmp[i+1]){
tmp[i] ^= 1;
rr.push_back({i, i+1});
a[i] ^= a[i+1];
} else if(tmp[i] && tmp[i+1] == 0){
swap(tmp[i], tmp[i+1]);
rr.push_back({i+1, i});
rr.push_back({i, i+1});
a[i+1] ^= a[i];
a[i] ^= a[i+1];
}
}
if(b){
if(tmp.back()) a.pop_back();
vector<ar<int, 2>> tt = get(a, b - 1);
rr.insert(rr.end(), tt.begin(), tt.end());
}
return rr;
}
void solve(){
int n, s; cin>>n>>s;
vector<int> a(n);
for(auto& x : a) cin>>x;
vector<ar<int, 2>> res = get(a);
cout<<(int)res.size()<<"\n";
for(auto x : res) cout<<x[0] + 1<<" "<<x[1] + 1<<"\n";
cout<<"\n";
}
signed main(){
ios_base::sync_with_stdio(0); cin.tie(0);
int t = 1;
//~ cin>>t;
while(t--) solve();
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Incorrect |
1 ms |
332 KB |
Not sorted |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Incorrect |
1 ms |
332 KB |
Not sorted |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
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 |
2 ms |
460 KB |
Output is correct |
5 |
Correct |
9 ms |
976 KB |
Output is correct |
6 |
Correct |
7 ms |
976 KB |
Output is correct |
7 |
Correct |
7 ms |
976 KB |
Output is correct |
8 |
Correct |
7 ms |
976 KB |
Output is correct |
9 |
Correct |
11 ms |
976 KB |
Output is correct |
10 |
Correct |
7 ms |
976 KB |
Output is correct |
11 |
Correct |
7 ms |
1084 KB |
Output is correct |
12 |
Correct |
7 ms |
1048 KB |
Output is correct |
13 |
Correct |
11 ms |
1112 KB |
Output is correct |
14 |
Correct |
8 ms |
1048 KB |
Output is correct |
15 |
Correct |
9 ms |
1124 KB |
Output is correct |