Submission #774975

#TimeUsernameProblemLanguageResultExecution timeMemory
774975vjudge1Xor Sort (eJOI20_xorsort)C++17
0 / 100
742 ms524288 KiB
#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 = 1; i < N; 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 (stderr)

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++)
      |                  ~~^~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...