Submission #775106

#TimeUsernameProblemLanguageResultExecution timeMemory
775106tpd2kXor Sort (eJOI20_xorsort)C++14
0 / 100
1 ms212 KiB
// teddybear's code // the one who loves NBP // noe the second // goal: 0 / 8 // get medal in APIO (like TKN) //#pragma GCC optimize("O3,unroll-loops") //#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt") // prob: #include <bits/stdc++.h> using namespace std; #pragma GCC optimize("Ofast") #pragma GCC target("avx,avx2,fma") #define FOR(i,n) for (int i = 0; i<n; i++) using ll = long long; using ull = unsigned long long; ll n,m,t; ll cnt = 0; const int maxn = 1e5; const ll mod = 1e9 + 7; #define Y "YES" #define N "NO" ll a[maxn + 5]; bool visited[1005][1005]; int dist[1005][1005]; int w,h; int fx[4] = {-1, 1, 0, 0}; int fy[4] = {0, 0, -1, 1}; queue <pair<int,int>> q; void solve() { cin >> n; vector <pair<int,int>> vp; for (int i = 1; i<=n; i++) { cin >> a[i]; } for (int i = 1; i<=n-1; i++) { if (a[i] > a[i+1]) { swap(a[i], a[i+1]); vp.push_back({i, i+1}); vp.push_back({i+1, i}); vp.push_back({i, i+1}); } } cout << vp.size() << '\n'; for (auto j : vp) { cout << j.first << ' ' << j.second << '\n'; } } void init() { int te = 1; //cin >> te; while (te--) { solve(); } } void preprocess() { } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); //cin.tie(0); cout.tie(0); //freopen(".inp", "r", stdin); //freopen(".out", "w", stdout); init(); preprocess(); //solve(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...