Submission #465952

#TimeUsernameProblemLanguageResultExecution timeMemory
465952Sench2006Xor Sort (eJOI20_xorsort)C++14
0 / 100
0 ms204 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define ar array #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define lb lower_bound #define ub upper_bound #define FOR(i, a, b) for(auto i = a; i < b; i++) #define FORD(i, a, b) for(auto i = a - 1; i >= b; i--) #define trav(x, v) for(auto x : v) #define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); // ---------------------------------------- Solution ---------------------------------------- // const int N = 1005; int s, n; int a[N]; void solve1() { } void solve2() { vector <pair<int, int>> ans; for(int i = 1; i <= (1 << 20); i *= 2) { for(int j = 0; j < n - 1; j++) { if (i&a[j]) { if (!(i&a[j + 1])) { ans.push_back({j + 1, j}); a[j + 1] ^= a[j]; } else { ans.push_back({j, j + 1}); a[j] ^= a[j + 1]; } } } } cout << ans.size() << "\n"; FOR(i, 0, ans.size()) { cout << ans[i].first + 1 << " " << ans[i].second + 1 << "\n"; } } void solve() { cin >> n >> s; FOR(i, 0, n) { cin >> a[i]; } if (s == 1) solve1(); else solve2(); } int main() { fastio; int tests = 1; // cin >> tests; while (tests--) { solve(); } return 0; }

Compilation message (stderr)

xorsort.cpp: In function 'void solve2()':
xorsort.cpp:12:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 | #define FOR(i, a, b) for(auto i = a; i < b; i++)
......
   44 |     FOR(i, 0, ans.size()) {
      |         ~~~~~~~~~~~~~~~~                
xorsort.cpp:44:5: note: in expansion of macro 'FOR'
   44 |     FOR(i, 0, ans.size()) {
      |     ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...