oj.uz

Submission #753719

# Submission time Handle Problem Language Result Execution time Memory
753719 2023-06-05T18:23:09 Z nicksms Sorting (IOI15_sorting) C++17
100 / 100
 159 ms 24944 KB 
/**
 *      Author:  Nicholas Winschel
 *      Created: 05.09.2023 19:37:58
**/

#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using db=long double;
template<class T> using V=vector<T>;
using vi = V<int>;
using vl = V<ll>;
using pi = pair<int,int>;
#define f first
#define s second
#define sz(x) (int)((x).size())

#include "sorting.h"

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
    auto tr = [&](int l) -> bool {
        // cout << l << endl;
        vi s(N);
        for (int i = 0; i < N; i++) {
            s[i]=S[i];
        }
        for (int i = 0; i < l; i++) {
            swap(s[X[i]],s[Y[i]]);
        }
        // for (int i = 0; i < N; i++) {
        //     cout << s[i] << " ";
        // }
        // cout << "\n";
        V<bool> vis(N);
        int cnt = 0;
        auto dfs = [&](int v, auto &&dfs) -> void {
            if (vis[v]) return;
            vis[v]=true;
            dfs(s[v], dfs);
        };
        for (int i = 0; i < N; i++) {
            if (!vis[i]) {
                cnt++;
                dfs(i,dfs);
            }
        }
        cnt = N-cnt;
        return cnt <= l;
    };
    int l = -1, r = M;
    while (r-l > 1) {
        int m = (l+r)/2;
        if (tr(m)) r=m;
        else l=m;
    }
    vi s(N);
    for (int i = 0; i < N; i++) {
        s[i]=S[i];
    }
    for (int i = 0; i < r; i++) {
        swap(s[X[i]],s[Y[i]]);
    }
    V<pi> pans;
    V<bool> vis(N);
    vi stk;
    auto dfs = [&](int v, auto &&dfs) -> void {
        if (vis[v]) return;
        vis[v]=true;
        dfs(s[v], dfs);
        stk.push_back(v);
    };
    for (int i = 0; i < N; i++) {
        if (!vis[i]) {
            stk = vi();
            dfs(i,dfs);
            for (int j = 0; j < sz(stk)-1; j++) {
                pans.emplace_back(stk[j], stk[j+1]);
                // cout << stk[j] << " " << stk[j+1] << endl;
            }
        }
    }
    while (sz(pans) < r) pans.emplace_back(0,0);
    vi cur(N); iota(cur.begin(), cur.end(), 0);
    vi rcur=cur;
    for (int i = r-1; i >= 0; i--) {
        pi h = pans[i];
        P[i] = rcur[h.f];
        Q[i] = rcur[h.s];
        swap(cur[X[i]], cur[Y[i]]);
        rcur[cur[X[i]]]=X[i];
        rcur[cur[Y[i]]]=Y[i];
    }
    return r;
}

Compilation message

sorting.cpp: In lambda function:
sorting.cpp:36:38: warning: declaration of 'dfs' shadows a previous local [-Wshadow]
   36 |         auto dfs = [&](int v, auto &&dfs) -> void {
      |                               ~~~~~~~^~~
sorting.cpp:36:14: note: shadowed declaration is here
   36 |         auto dfs = [&](int v, auto &&dfs) -> void {
      |              ^~~
sorting.cpp: In lambda function:
sorting.cpp:66:34: warning: declaration of 'dfs' shadows a previous local [-Wshadow]
   66 |     auto dfs = [&](int v, auto &&dfs) -> void {
      |                           ~~~~~~~^~~
sorting.cpp:66:10: note: shadowed declaration is here
   66 |     auto dfs = [&](int v, auto &&dfs) -> void {
      |          ^~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 300 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 300 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 304 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 300 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 304 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 296 KB Output is correct
14 Correct 1 ms 300 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 316 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 2 ms 444 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 428 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 440 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 440 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 444 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 440 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 2 ms 444 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 1 ms 340 KB Output is correct

Subtask #6
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 440 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 440 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 444 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 440 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 2 ms 444 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 135 ms 19280 KB Output is correct
16 Correct 128 ms 21736 KB Output is correct
17 Correct 143 ms 21472 KB Output is correct
18 Correct 64 ms 15608 KB Output is correct
19 Correct 124 ms 17964 KB Output is correct
20 Correct 130 ms 18632 KB Output is correct
21 Correct 128 ms 18648 KB Output is correct
22 Correct 112 ms 16740 KB Output is correct
23 Correct 124 ms 23432 KB Output is correct
24 Correct 149 ms 23000 KB Output is correct
25 Correct 155 ms 21552 KB Output is correct
26 Correct 135 ms 18468 KB Output is correct
27 Correct 116 ms 17996 KB Output is correct
28 Correct 147 ms 23360 KB Output is correct
29 Correct 136 ms 19772 KB Output is correct
30 Correct 92 ms 18016 KB Output is correct
31 Correct 130 ms 20124 KB Output is correct
32 Correct 132 ms 22512 KB Output is correct
33 Correct 144 ms 21652 KB Output is correct
34 Correct 138 ms 20548 KB Output is correct
35 Correct 120 ms 17772 KB Output is correct
36 Correct 59 ms 16616 KB Output is correct
37 Correct 159 ms 24944 KB Output is correct
38 Correct 146 ms 23992 KB Output is correct
39 Correct 137 ms 24132 KB Output is correct