oj.uz

Submission #579924

# Submission time Handle Problem Language Result Execution time Memory
579924 2022-06-20T09:31:32 Z thezomb1e Xor Sort (eJOI20_xorsort) C++17
25 / 100
 117 ms 12476 KB 
//thatsramen

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define eb emplace_back
#define pb push_back
#define ft first
#define sd second
#define pi pair<int, int>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define dbg(...) dbg_out(__VA_ARGS__)

using ll = long long;
using ld = long double;
using namespace std;
using namespace __gnu_pbds;

//Constants
const ll INF = 5 * 1e18;
const int IINF = 2 * 1e9;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const ld PI = 3.14159265359;

//Templates
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) {return os << '(' << p.first << ", " << p.second << ')';}
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) {os << '['; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << ']';}
void dbg_out() {cerr << endl;}
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << H << ' '; dbg_out(T...); }
template<typename T> void mins(T& x, T y) {x = min(x, y);}
template<typename T> void maxs(T& x, T y) {x = max(x, y);}
template<typename T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using omset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

//order_of_key(k): number of elements strictly less than k
//find_by_order(k): k-th element in the set

void setPrec() {cout << fixed << setprecision(15);}
void unsyncIO() {cin.tie(0)->sync_with_stdio(0);}
void setIn(string s) {freopen(s.c_str(), "r", stdin);}
void setOut(string s) {freopen(s.c_str(), "w", stdout);}
void setIO(string s = "") {
    unsyncIO(); setPrec();
    if(s.size()) setIn(s + ".in"), setOut(s + ".out");
}

// #define TEST_CASES

void solve() {
    int n, s;
    cin >> n >> s;
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    vector<pi> ans;
    auto op = [&](int x, int y) {
        x++; y++;
        ans.pb({y, x});
        ans.pb({x, y});
        ans.pb({y, x});
    };
    for (int i = 0; i < n; i++) {
        int min_i = i;
        for (int j = i; j < n; j++) {
            if (a[min_i] > a[j]) {
                min_i = j;
            }
        }
        for (int j = min_i; j > i; j--) {
            swap(a[j - 1], a[j]);
            op(j - 1, j);
        }
    }
    cout << ans.size() << '\n';
    for (pi x : ans) {
        cout << x.ft << ' ' << x.sd << '\n';
    }
}

int main() {
    setIO();

    int tt = 1;
    #ifdef TEST_CASES
        cin >> tt;
    #endif

    while (tt--)
        solve();

    return 0;
}

Compilation message

xorsort.cpp: In function 'void setIn(std::string)':
xorsort.cpp:44:30: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 | void setIn(string s) {freopen(s.c_str(), "r", stdin);}
      |                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
xorsort.cpp: In function 'void setOut(std::string)':
xorsort.cpp:45:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 | void setOut(string s) {freopen(s.c_str(), "w", stdout);}
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 3 ms 596 KB Output is correct
5 Correct 3 ms 600 KB Output is correct
6 Correct 5 ms 724 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 3 ms 600 KB Output is correct
9 Correct 4 ms 708 KB Output is correct
10 Correct 3 ms 600 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 6 ms 984 KB Output is correct
13 Correct 5 ms 984 KB Output is correct
14 Correct 5 ms 964 KB Output is correct
15 Correct 6 ms 968 KB Output is correct

Subtask #2
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 3 ms 596 KB Output is correct
5 Correct 3 ms 600 KB Output is correct
6 Correct 5 ms 724 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 3 ms 600 KB Output is correct
9 Correct 4 ms 708 KB Output is correct
10 Correct 3 ms 600 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 6 ms 984 KB Output is correct
13 Correct 5 ms 984 KB Output is correct
14 Correct 5 ms 964 KB Output is correct
15 Correct 6 ms 968 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 3 ms 600 KB Output is correct
18 Correct 6 ms 856 KB Output is correct
19 Correct 6 ms 856 KB Output is correct
20 Correct 7 ms 856 KB Output is correct
21 Correct 5 ms 856 KB Output is correct
22 Correct 5 ms 856 KB Output is correct
23 Correct 5 ms 856 KB Output is correct
24 Correct 6 ms 856 KB Output is correct
25 Correct 5 ms 856 KB Output is correct
26 Incorrect 10 ms 1364 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 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 5 ms 856 KB Output is correct
5 Incorrect 117 ms 12476 KB Integer 764742 violates the range [0, 40000]
6 Halted 0 ms 0 KB -