oj.uz

답안 #774981

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
774981 2023-07-06T06:27:07 Z daoquanglinh2007 Xor Sort (eJOI20_xorsort) C++17
0 / 100
 580 ms 524288 KB 
#include <bits/stdc++.h>
using namespace std;

#define pii pair <int, int>
#define fi first
#define se second
#define mp make_pair

const int NM = 1000;

int N, S, a[NM+5];
vector <pii> ans;

void process(int i){
	if (a[i] < (a[i]^a[i+1]) || (S == 2 && a[i] == (a[i]^a[i+1]))){
		a[i+1] ^= a[i];
		ans.push_back(mp(i+1, i));
	}
	else{
		a[i] ^= a[i+1];
		ans.push_back(mp(i, i+1));
	}
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> N >> S;
	for (int i = 1; i <= N; i++) cin >> a[i];
	while (true){
		bool ok = 1;
		for (int i = N-1; i >= 1; i--)
			if (a[i] > a[i+1] || (S == 1 && a[i] == a[i+1])){
				process(i);
				ok = 0;
			}
		if (ok) break;
	}
	cout << ans.size() << '\n';
	for (int i = 0; i < ans.size(); i++)
		cout << ans[i].fi << ' ' << ans[i].se << '\n';
	return 0;
}

Compilation message

xorsort.cpp: In function 'int main()':
xorsort.cpp:41:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |  for (int i = 0; i < ans.size(); i++)
      |                  ~~^~~~~~~~~~~~

Subtask #1
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Runtime error 580 ms 524288 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #2
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Runtime error 580 ms 524288 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 577 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -