oj.uz

답안 #999624

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
999624 2024-06-16T01:17:27 Z Gilgamesh 정렬하기 (IOI15_sorting) C++17
100 / 100
 142 ms 12920 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
        }
 
        vc<pii> ops;
        for (int i = 0; i < N; ++i) {
            while(v[i] != i) {
                ops.emplace_back(v[i], v[v[i]]);
                swap(v[i], v[v[i]]);
            }
        }
        if (ops.size() <= mid) {
            r = mid;
        } else {
            l = mid + 1;
        }
    }
    vi cur(N);
    for (int i = 0; i < N; ++i) {
        cur[i] = s[i];
    }
    for (int i = 0; i < l; ++i) {
        swap(cur[x[i]], cur[y[i]]); // swapping the apples
    }
    ans.clear();
    for (int i = 0; i < N; ++i) {
        while(cur[i] != i) {
            ans.emplace_back(cur[i], cur[cur[i]]);
            swap(cur[i], cur[cur[i]]);
        }
    }
    assert(sz(ans) <= l);
    while (sz(ans) < l) {
        ans.PB({0, 0});
    }
    for(int i = 0; i < N; ++i) {
        cur[i] = s[i];
    }
    vi ind(N);
    for (int i = 0; i < N; ++i) {
        ind[cur[i]] = i;
    }

    for (int i = 0; i < l; ++i) {
        int a = x[i];
        int b = y[i];
        swap(ind[cur[a]], ind[cur[b]]);
        swap(cur[a], cur[b]);
        a = ans[i].ff;
        b = ans[i].ss;
        p[i] = ind[a], q[i] = ind[b];
        swap(cur[ind[a]], cur[ind[b]]);
        swap(ind[a], ind[b]);
    }
    return l;
}
 

int N, M;
int S[11];
int x[11], y[11];
int p[11], q[11];
 
/* 
 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() {
    setIO("test");
    N = 11;
    M = 33;
    S[0] = 8; S[1] = 1; S[2] = 3; S[3] = 9; S[4] = 5; S[5] = 10; S[6] = 6; 
    S[7] = 4; S[8] = 2; S[9] = 7; S[10] = 0;
    x[0] = 0, y[0] = 3;
    x[1] = 6, y[1] = 2;
    x[2] = 9, y[2] = 8;
    x[3] = 3, y[3] = 10;
    x[4] = 0, y[4] = 6;
    x[5] = 7, y[5] = 9;
    x[6] = 10, y[6] = 1;
    x[7] = 0, y[7] = 6;
    x[8] = 0, y[8] = 10;
    x[9] = 4, y[9] = 8;
    x[10] = 3, y[10] = 4;
    int amt = findSwapPairs(N, S, M, x, y, p, q);
    cout << amt << "\n";
    for(int i = 0; i < amt; ++i) {
        cout << p[i] << " " << q[i] << "\n";
    }
}*/
/*
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 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:112:24: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  112 |         if (ops.size() <= mid) {
      |             ~~~~~~~~~~~^~~~~~
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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 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 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 360 KB Output is correct
6 Correct 1 ms 348 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 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 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 360 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 348 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct

Subtask #6
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 121 ms 10724 KB Output is correct
16 Correct 125 ms 10948 KB Output is correct
17 Correct 139 ms 11340 KB Output is correct
18 Correct 50 ms 9124 KB Output is correct
19 Correct 89 ms 10060 KB Output is correct
20 Correct 90 ms 10500 KB Output is correct
21 Correct 91 ms 10492 KB Output is correct
22 Correct 116 ms 11432 KB Output is correct
23 Correct 142 ms 11552 KB Output is correct
24 Correct 138 ms 12920 KB Output is correct
25 Correct 131 ms 12080 KB Output is correct
26 Correct 92 ms 9216 KB Output is correct
27 Correct 84 ms 8800 KB Output is correct
28 Correct 139 ms 11408 KB Output is correct
29 Correct 124 ms 11744 KB Output is correct
30 Correct 63 ms 8656 KB Output is correct
31 Correct 136 ms 11180 KB Output is correct
32 Correct 135 ms 12708 KB Output is correct
33 Correct 141 ms 12748 KB Output is correct
34 Correct 141 ms 11424 KB Output is correct
35 Correct 90 ms 10116 KB Output is correct
36 Correct 35 ms 7240 KB Output is correct
37 Correct 140 ms 11900 KB Output is correct
38 Correct 134 ms 11564 KB Output is correct
39 Correct 135 ms 12828 KB Output is correct