oj.uz

Submission #999791

# Submission time Handle Problem Language Result Execution time Memory
999791 2024-06-16T06:57:33 Z whatthemomooofun1729 Sorting (IOI15_sorting) C++17
74 / 100
 1000 ms 25364 KB 
#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <stack>
#include <map>
#include <queue>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cstring>
#include <cmath>
#include <functional>
#include <cassert>
#include <iomanip>
#include <numeric>
#include <bitset>
#include <sstream>
#include <chrono>
#include <random>

#define ff first
#define ss second
#define PB push_back
#define sz(x) int(x.size())
#define rsz resize
#define fch(xxx, yyy) for (auto xxx : yyy) // abusive notation
#define all(x) (x).begin(),(x).end()
#define eps 1e-9

// more abusive notation (use at your own risk):
//#define int ll

using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;

// debugging
void __print(int x) {std::cerr << x;}
void __print(ll x) {std::cerr << x;} /* remember to uncomment this when not using THE MACRO */
void __print(unsigned x) {std::cerr << x;}
void __print(ull x) {std::cerr << x;}
void __print(float x) {std::cerr << x;}
void __print(double x) {std::cerr << x;}
void __print(ld x) {std::cerr << x;}
void __print(char x) {std::cerr << '\'' << x << '\'';}
void __print(const char *x) {std::cerr << '\"' << x << '\"';}
void __print(const string& x) {std::cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V> void __print(const pair<T, V> &x) {std::cerr << '{'; __print(x.ff); std::cerr << ", "; __print(x.ss); std::cerr << '}';}
template<typename T> void __print(const T& x) {int f = 0; std::cerr << '{'; for (auto &i: x) std::cerr << (f++ ? ", " : ""), __print(i); std::cerr << "}";}
void _print() {std::cerr << "]\n";}
template <typename T, typename... V> void _print(T t, V... v) {__print(t); if (sizeof...(v)) std::cerr << ", "; _print(v...);}
void println() {std::cerr << ">--------------------<" << endl;}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

// templates
template <class T> bool ckmin(T &a, const T &b) {return b<a ? a = b, 1 : 0;}
template <class T> bool ckmax(T &a, const T &b) {return b>a ? a = b, 1 : 0;}
template <class T> using gr = greater<T>;
template <class T> using vc = vector<T>;
template <class T> using p_q = priority_queue<T>;
template <class T> using pqg = priority_queue<T, vc<T>, gr<T>>;
template <class T1, class T2> using pr = pair<T1, T2>;
mt19937_64 rng_ll(chrono::steady_clock::now().time_since_epoch().count());
int rng(int M) {return (int)(rng_ll()%M);} /*returns any random number in [0, M) */

// const variables
constexpr int INF = (int)2e9;
constexpr int MOD = 998244353;
constexpr ll LL_INF = (ll)3e18;
constexpr int mod = (int)1e9 + 7;
constexpr ll inverse = 500000004LL; // inverse of 2 modulo 1e9 + 7

void setIO(const string& str) {// fast input/output
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    if (str.empty()) return;
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
}

int findSwapPairs(int N, int* s, int M, int* x, int* y, int* p, int* q) {
    vc<pii> ans;
    int l = 0, r = M;
    while (l <= r) {
        int mid = (l + r)/2;
        vi v(N);
        for (int i = 0; i < N; ++i) {
            v[i] = s[i];
        }
        for (int i = 0; i < mid; ++i) {
            swap(v[x[i]], v[y[i]]); // swapping the apples
        }
        set<pii> st;
        for (int i = 0; i < N; ++i) {
            st.insert({v[i], i});
        }
        vc<pii> ops;
        for (int i = 0; i < N; ++i) {
            while (v[i] != i) {
                ops.PB({v[i], v[v[i]]});
                swap(v[i], v[v[i]]);
            }
        }
        if (sz(ops) <= mid) {
            r = mid - 1;
        } else {
            l = mid + 1;
        }
    }
    r++;
    vi v(N);
    for (int i = 0; i < N; ++i) {
        v[i] = s[i];
    }
    for (int i = 0; i < r; ++i) {
        swap(v[x[i]], v[y[i]]); // swapping the apples
    }
    for (int i = 0; i < N; ++i) {
        while (v[i] != i) {
            ans.PB({v[i], v[v[i]]});
            swap(v[i], v[v[i]]);
        }
    }
    while (sz(ans) < r) {
        ans.PB({0, 0});
    }
    vi idx(N);
    for (int i = 0; i < N; ++i) {
        idx[s[i]] = i;
        v[i] = s[i];
    }
    for (int i = 0; i < r; ++i) {
        swap(v[x[i]], v[y[i]]);
    }
    for (int i = 0; i < r; ++i) {
        swap(idx[s[x[i]]], idx[s[y[i]]]);
        swap(s[x[i]], s[y[i]]);
        p[i] = idx[v[ans[i].ff]], q[i] = idx[v[ans[i].ss]];
        swap(idx[s[p[i]]], idx[s[q[i]]]);
        swap(s[p[i]], s[q[i]]);
    }
    return r;
}

/*
int N, M;
int S[10];
int x[10], y[10];
int p[10], q[10];


 FAILING TEST CASE:
 11
8 1 3 9 5 10 6 4 2 7 0
11
0 3
6 2
9 8
3 10
0 6
7 9
10 1
0 6
0 10
4 8
3 4

 */
/*
signed main() { // TIME YOURSELF !!!
    setIO("");
    int T = 50000;
    while (T--) {
        N = rng(11) + 1;
        vi s(N);
        iota(all(s), 0);
        unsigned seed = std::chrono::system_clock::now().time_since_epoch().count();
        shuffle(s.begin(), s.end(), default_random_engine(seed));
        for (int i = 0; i < N; ++i) {
            S[i] = s[i];
        }
        memset(x, 0, sizeof(x));
        memset(y, 0, sizeof(y));
        memset(p, 0, sizeof(p));
        memset(q, 0, sizeof(q));
        M = N;
        for (int i = 0; i < M; ++i) {
            x[i] = rng(N), y[i] = rng(N);
        }
        int ans = findSwapPairs(N, S, M, x, y, p, q);
        for (int i = 0; i < N; ++i) {
            S[i] = s[i];
        }
        for (int i = 0; i < ans; ++i) {
            swap(S[x[i]], S[y[i]]);
            swap(S[p[i]], S[q[i]]);
        }
        for (int i = 0; i < N; ++i) {
            if (i && S[i] < S[i-1]) {
                debug(N, M);
                for (int j = 0; j < N; ++j) {
                    cerr << S[j] << ' ';
                }
                cerr << '\n';
                for (int j = 0; j < M; ++j) {
                    cerr << x[j] << ' ' << y[j] << '\n';
                }
                cerr << "NOOOOOOO. Solution fails: \n";
                debug(ans);
                for (int j = 0; j < ans; ++j) {
                    debug(j, p[j], q[j]);
                }
                return 0;
            }
        }
    }
    return 0;*/
/*
    cin >> N;
    vi s(N);
    for (int i = 0; i < N; ++i) {
        cin >> S[i];
        s[i] = S[i];
    }
    cin >> M;
    for (int i = 0; i < M; ++i) {
        cin >> x[i] >> y[i];
    }
    int ans = findSwapPairs(N, S, M, x, y, p, q);
    debug(ans);
    debug(s);
    for (int i = 0; i < ans; ++i) {
        debug(i);
        debug(x[i], y[i]);
        debug(s);
        swap(s[x[i]], s[y[i]]);
        debug(s);
        debug(p[i], q[i]);
        debug(s);
        swap(s[p[i]], s[q[i]]);
        debug(s);
    }
    return 0;
}
*/
// TLE -> TRY NOT USING DEFINE INT LONG LONG
// CE -> CHECK LINE 45
// 5000 * 5000 size matrices are kinda big (potential mle)
// Do something, start simpler

Compilation message

sorting.cpp: In function 'void setIO(const string&)':
sorting.cpp:88:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   88 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sorting.cpp:89:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   89 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 440 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 596 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 440 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 440 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 2 ms 604 KB Output is correct
22 Correct 2 ms 604 KB Output is correct
23 Correct 2 ms 604 KB Output is correct
24 Correct 2 ms 604 KB Output is correct
25 Correct 2 ms 604 KB Output is correct
26 Correct 2 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 520 KB Output is correct
2 Correct 4 ms 604 KB Output is correct
3 Correct 4 ms 604 KB Output is correct
4 Correct 3 ms 604 KB Output is correct
5 Correct 3 ms 604 KB Output is correct
6 Correct 4 ms 600 KB Output is correct
7 Correct 6 ms 604 KB Output is correct
8 Correct 4 ms 684 KB Output is correct
9 Correct 4 ms 616 KB Output is correct
10 Correct 5 ms 604 KB Output is correct
11 Correct 4 ms 604 KB Output is correct
12 Correct 4 ms 604 KB Output is correct
13 Correct 4 ms 604 KB Output is correct
14 Correct 2 ms 604 KB Output is correct

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 520 KB Output is correct
2 Correct 4 ms 604 KB Output is correct
3 Correct 4 ms 604 KB Output is correct
4 Correct 3 ms 604 KB Output is correct
5 Correct 3 ms 604 KB Output is correct
6 Correct 4 ms 600 KB Output is correct
7 Correct 6 ms 604 KB Output is correct
8 Correct 4 ms 684 KB Output is correct
9 Correct 4 ms 616 KB Output is correct
10 Correct 5 ms 604 KB Output is correct
11 Correct 4 ms 604 KB Output is correct
12 Correct 4 ms 604 KB Output is correct
13 Correct 4 ms 604 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Execution timed out 1006 ms 25364 KB Time limit exceeded
16 Halted 0 ms 0 KB -