oj.uz

Submission #1024979

# Submission time Handle Problem Language Result Execution time Memory
1024979 2024-07-16T13:36:27 Z Arpi2007 Xor Sort (eJOI20_xorsort) C++14
60 / 100
 8 ms 1136 KB 
#include <iostream>
#include <queue>
#include <sstream>
#include <fstream>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <utility>
#include <stack>
#include <math.h>
#include <climits>
#include <stdlib.h>
#include <stdio.h>
#include <iomanip>
using namespace std;

#define ll long long
#define ld long double
#define ull unsigned long long
#define ub upper_bound
#define lb lower_bound 
#define ff first
#define ss second
#define mpr make_pair
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int,int>
#define vpi vector<pii>
#define pb push_back
#define pob pop_back
#define mii map<int,int>
#define vpl vector<pair<ll, ll>>
#define pll pair<ll,ll>
#define all(v) v.begin(),v.end()
#define sz(x) x.size()
#define clr(x) x.clear()
#define yes cout << "YES\n"
#define no cout << "NO\n"
#define print(x) cout<<"x="<<x<<endl;

ll MOD = 1e9 + 7;
ll MOD2 = 998244353;

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

/* void setprecision(int x) {

    cout.setf(ios::fixed | ios::showpoint);
    cout.precision(x);
} */

/*void setIO(string name = "") {
    if ((int)name.size() > 0) {
        freopen((name + ".in").c_str(), "r", stdin);
        freopen((name + ".out").c_str(), "w", stdout);
    }
}*/

ll gcd(ll a, ll b)
{
    if (b == 0) {
        return a;
    }
    else {
        return gcd(b, a % b);
    }
}

int num(int n) {
    ll ans = 0;
    while (n != 0) {
        ans++;
        n /= 10;
    }
    return ans;
}

ll lcm(ll a, ll b) {
    return (a * b) / gcd(a, b);
}


ll factorial(ll n) {
    ll ans = 1;
    for (int i = 1; i <= n; i++) {
        ans *= i;
        ans %= MOD2;
    }
    return ans;
}

bool isPrime(int n)
{
    if (n <= 1) {
        return false;
    }
    if (n == 2) {
        return true;
    }
    for (int i = 2; i * i <= n; i++) {
        if (n % i == 0)
            return false;
    }
    return true;
}

int sumnum(int n) {
    int ans = 0;
    while (n != 0) {
        ans += n % 10;
        n /= 10;
    }
    return ans;
}

ll bpow_mod(ll a, ll b, ll mod)
{
    ll ans = 1;
    while (b) {
        if ((b & 1) == 1) {
            ans *= a;
            ans %= mod;
        }
        b >>= 1;
        a *= a;
        a %= mod;
    }
    return ans;
}

int highpow2(int n)
{
    int p = (int)log2(n);
    return (int)pow(2, p);
}

bool sortbysec(const pair<int, int>& a,
    const pair<int, int>& b)
{
    return (a.second < b.second);
}

void precalc() {
    return;
}


const int N = 3e5 + 10;
int a[1003];

void solve(){
    int n, s; cin >> n >> s;
    for(int i = 1; i <= n; ++i){
        cin >> a[i];
    }
    vpi ans;
    if(s == 1){
        int curmx = 0;
        for(int i = n; i >= 1; i--){
            int id = 1;
            for(int j = 1; j <= i; ++j){
                if((a[j] ^ curmx) > (a[id] ^ curmx)){
                    id = j;
                }
            }
           // cout << a[id] << endl;
            int minch = i;
            if(i == n){
                minch = n - 1;
            }
            for(int j = 1; j <= minch; ++j){
                ans.pb({j, j + 1});
                a[j] = (a[j + 1] ^ a[j]);
            }
            for(int j = id + 1; j <= i; ++j){
                ans.pb({j, j - 1});
                a[j] = (a[j - 1] ^ a[j]);
            }
            for(int j = id - 1; j >= 2; j--){
                ans.pb({j - 1, j});
                a[j - 1] = (a[j] ^ a[j - 1]);
            }
            curmx = a[i];
        }
    }

    cout << sz(ans) << "\n";
    for(auto i : ans){
        cout << i.ff << ' ' << i.ss << "\n";
    }
}

void cases() {
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
}

int main() {
   // setIO("hps");
    fastio();
    precalc();
    //setprecision(5);
    solve();
    return 0;
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 736 KB Output is correct
5 Correct 4 ms 860 KB Output is correct
6 Correct 3 ms 860 KB Output is correct
7 Correct 2 ms 736 KB Output is correct
8 Correct 5 ms 912 KB Output is correct
9 Correct 3 ms 736 KB Output is correct
10 Correct 2 ms 856 KB Output is correct
11 Correct 3 ms 860 KB Output is correct
12 Correct 4 ms 736 KB Output is correct
13 Correct 3 ms 860 KB Output is correct
14 Correct 3 ms 736 KB Output is correct
15 Correct 3 ms 736 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 736 KB Output is correct
5 Correct 4 ms 860 KB Output is correct
6 Correct 3 ms 860 KB Output is correct
7 Correct 2 ms 736 KB Output is correct
8 Correct 5 ms 912 KB Output is correct
9 Correct 3 ms 736 KB Output is correct
10 Correct 2 ms 856 KB Output is correct
11 Correct 3 ms 860 KB Output is correct
12 Correct 4 ms 736 KB Output is correct
13 Correct 3 ms 860 KB Output is correct
14 Correct 3 ms 736 KB Output is correct
15 Correct 3 ms 736 KB Output is correct
16 Correct 0 ms 352 KB Output is correct
17 Correct 3 ms 860 KB Output is correct
18 Correct 8 ms 992 KB Output is correct
19 Correct 4 ms 988 KB Output is correct
20 Correct 4 ms 992 KB Output is correct
21 Correct 4 ms 992 KB Output is correct
22 Correct 5 ms 992 KB Output is correct
23 Correct 4 ms 992 KB Output is correct
24 Correct 4 ms 992 KB Output is correct
25 Correct 4 ms 1136 KB Output is correct
26 Correct 5 ms 992 KB Output is correct
27 Correct 4 ms 992 KB Output is correct
28 Correct 7 ms 992 KB Output is correct
29 Correct 5 ms 1052 KB Output is correct
30 Correct 5 ms 992 KB Output is correct

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Not sorted
2 Halted 0 ms 0 KB -