oj.uz

답안 #443133

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
443133 2021-07-09T18:53:40 Z AdamGS Xor Sort (eJOI20_xorsort) C++14
40 / 100
 10 ms 976 KB 
#include<bits/stdc++.h>
using namespace std;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define pb push_back
#define st first
#define nd second
const int LIM=1e3+7;
int T[LIM], n;
void solve2() {
	vector<pair<int,int>>ans;
	for(int i=19; i>=0; --i) {
		if(!n) break;
		rep(j, n-1) {
			if(T[j]&(1<<i)) {
				if(!(T[j+1]&(1<<i))) {
					ans.pb({j+1, j});
					T[j+1]^=T[j];
				}
				ans.pb({j, j+1});
				T[j]^=T[j+1];
			}
		} 
		--n;
	}
	cout << ans.size() << '\n';
	for(auto i : ans) cout << i.st+1 << " " << i.nd+1 << '\n';
}
int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	int typ;
	cin >> n >> typ;
	rep(i, n) cin >> T[i];
	if(typ==2) solve2();
}

Subtask #1
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 204 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #2
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 204 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 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 6 ms 848 KB Output is correct
6 Correct 6 ms 848 KB Output is correct
7 Correct 6 ms 848 KB Output is correct
8 Correct 6 ms 848 KB Output is correct
9 Correct 6 ms 848 KB Output is correct
10 Correct 6 ms 848 KB Output is correct
11 Correct 6 ms 848 KB Output is correct
12 Correct 7 ms 848 KB Output is correct
13 Correct 10 ms 848 KB Output is correct
14 Correct 9 ms 944 KB Output is correct
15 Correct 8 ms 976 KB Output is correct