oj.uz

Submission #1104508

# Submission time Handle Problem Language Result Execution time Memory
1104508 2024-10-24T01:40:11 Z TrinhKhanhDung Xor Sort (eJOI20_xorsort) C++14
25 / 100
 85 ms 12784 KB 
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define sz(x) (int)x.size()
#define ALL(v) v.begin(), v.end()
#define MASK(k) (1LL << (k))
#define BIT(x, i) (((x) >> (i)) & 1)
#define INF (ll)1e9
#define oo (ll)1e18
#define MOD (ll)(1e9 + 7)
#define double long double

using namespace std;

template<class T1, class T2>
    bool maximize(T1 &a, T2 b){if(a < b){a = b; return true;} return false;}

template<class T1, class T2>
    bool minimize(T1 &a, T2 b){if(a > b){a = b; return true;} return false;}

template<class T1, class T2>
    void add(T1 &a, T2 b){a += b; if(a >= MOD) a -= MOD;}

template<class T1, class T2>
    void sub(T1 &a, T2 b){a -= b; if(a < 0) a += MOD;}

template<class T>
    void cps(T &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}

const int MAX = 1003;

int N, S;
int a[MAX];

void input(){
    cin >> N >> S;
    for(int i = 1; i <= N; i++) cin >> a[i];
}

namespace subtask2{
    vector<pair<int, int>> ans;

    void Swap(int i, int j){
        ans.push_back({i, j});
        ans.push_back({j, i});
        ans.push_back({i, j});
    }

    void solve(){
        for(int i = 1; i <= N; i++){
            for(int j = 2; j <= N; j++){
                if(a[j] < a[j - 1]){
                    swap(a[j], a[j - 1]);
                    Swap(j, j - 1);
                }
            }
        }
        cout << sz(ans) << '\n';
        for(auto x: ans){
            cout << x.fi << ' ' << x.se << '\n';
        }
    }
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    // freopen("fence.inp", "r", stdin);
    // freopen("fence.out", "w", stdout);

    input();
    
    return subtask2::solve(), 0;

    return 0;
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 504 KB Output is correct
4 Correct 3 ms 728 KB Output is correct
5 Correct 4 ms 724 KB Output is correct
6 Correct 3 ms 848 KB Output is correct
7 Correct 3 ms 1012 KB Output is correct
8 Correct 4 ms 848 KB Output is correct
9 Correct 3 ms 848 KB Output is correct
10 Correct 3 ms 848 KB Output is correct
11 Correct 1 ms 508 KB Output is correct
12 Correct 5 ms 980 KB Output is correct
13 Correct 6 ms 980 KB Output is correct
14 Correct 5 ms 980 KB Output is correct
15 Correct 5 ms 980 KB Output is correct

Subtask #2
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 504 KB Output is correct
4 Correct 3 ms 728 KB Output is correct
5 Correct 4 ms 724 KB Output is correct
6 Correct 3 ms 848 KB Output is correct
7 Correct 3 ms 1012 KB Output is correct
8 Correct 4 ms 848 KB Output is correct
9 Correct 3 ms 848 KB Output is correct
10 Correct 3 ms 848 KB Output is correct
11 Correct 1 ms 508 KB Output is correct
12 Correct 5 ms 980 KB Output is correct
13 Correct 6 ms 980 KB Output is correct
14 Correct 5 ms 980 KB Output is correct
15 Correct 5 ms 980 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 3 ms 848 KB Output is correct
18 Correct 5 ms 1148 KB Output is correct
19 Correct 5 ms 980 KB Output is correct
20 Correct 5 ms 980 KB Output is correct
21 Correct 4 ms 980 KB Output is correct
22 Correct 4 ms 980 KB Output is correct
23 Correct 4 ms 980 KB Output is correct
24 Correct 5 ms 980 KB Output is correct
25 Correct 5 ms 980 KB Output is correct
26 Incorrect 8 ms 1244 KB Integer 59568 violates the range [0, 40000]
27 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 8 ms 812 KB Output is correct
5 Incorrect 85 ms 12784 KB Integer 764742 violates the range [0, 40000]
6 Halted 0 ms 0 KB -