oj.uz

Submission #299478

# Submission time Handle Problem Language Result Execution time Memory
299478 2020-09-15T02:38:03 Z Hideo Sorting (IOI15_sorting) C++17
100 / 100
 283 ms 22424 KB 
#include "sorting.h"
//#include "grader.cpp"
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define all(s) s.begin(), s.end()
#define pb push_back
#define fr first
#define sc second
#define vi vector < int >
#define pi pair < int, int >

const int MN = 6e5 + 7;

vector < pi > sw, out;
int a[MN], b[MN], r[MN];
int x[MN], y[MN];
int n, m;

bool check (int k){
    for (int i = 0; i < n; i++)
        a[i] = b[i];
    for (int i = 0; i < k; i++)
        swap(a[x[i]], a[y[i]]);
    for (int i = 0; i < n; i++)
        r[a[i]] = i;
    vector < pi > kek;
    for (int i = 0; i < n; i++){
        int it = i;
        while (it != a[it]){
            int x = it, y = a[it];
            it = a[it];
            kek.pb({x, y});
            swap(a[r[x]], a[r[y]]);
            swap(r[x], r[y]);
        }
    }
    for (int i = 0; i < n; i++){
        int it = i;
        while (it != a[it]){
            int x = it, y = a[it];
            it = a[it];
            kek.pb({x, y});
            swap(a[r[x]], a[r[y]]);
            swap(r[x], r[y]);
        }
    }
    if (kek.size() <= k)
        sw = kek;
    return kek.size() <= k;
}

void simulate (int k){
    while (sw.size() != k)
        sw.pb({0, 0});
    for (int i = 0; i < n; i++){
        a[i] = b[i];
        r[a[i]] = i;
    }
    for (int i = 0; i < k; i++){
        swap(r[a[x[i]]], r[a[y[i]]]);
        swap(a[x[i]], a[y[i]]);
        int v = r[sw[i].fr], u = r[sw[i].sc];
        out.pb({v, u});
        swap(r[a[v]], r[a[u]]);
        swap(a[v], a[u]);
    }
}

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
    n = N; m = M;
    bool sorted = true;
    for (int i = 0; i < n; i++){
        b[i] = S[i];
        if (b[i] != i)
            sorted = false;
    }
    if (sorted)
        return 0;
    for (int i = 0; i < m; i++){
        x[i] = X[i];
        y[i] = Y[i];
    }
    int lf = 0, rg = M + 1;
    while (lf + 1 < rg){
        int mid = (lf + rg) >> 1;
        if (check(mid))
            rg = mid;
        else
            lf = mid;
    }
    simulate(rg);
    for (int i = 0; i < out.size(); i++){
        P[i] = out[i].fr;
        Q[i] = out[i].sc;
    }
    return rg;
}

Compilation message

sorting.cpp: In function 'bool check(int)':
sorting.cpp:33:17: warning: declaration of 'x' shadows a global declaration [-Wshadow]
   33 |             int x = it, y = a[it];
      |                 ^
sorting.cpp:19:5: note: shadowed declaration is here
   19 | int x[MN], y[MN];
      |     ^
sorting.cpp:33:25: warning: declaration of 'y' shadows a global declaration [-Wshadow]
   33 |             int x = it, y = a[it];
      |                         ^
sorting.cpp:19:12: note: shadowed declaration is here
   19 | int x[MN], y[MN];
      |            ^
sorting.cpp:43:17: warning: declaration of 'x' shadows a global declaration [-Wshadow]
   43 |             int x = it, y = a[it];
      |                 ^
sorting.cpp:19:5: note: shadowed declaration is here
   19 | int x[MN], y[MN];
      |     ^
sorting.cpp:43:25: warning: declaration of 'y' shadows a global declaration [-Wshadow]
   43 |             int x = it, y = a[it];
      |                         ^
sorting.cpp:19:12: note: shadowed declaration is here
   19 | int x[MN], y[MN];
      |            ^
sorting.cpp:50:20: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   50 |     if (kek.size() <= k)
      |         ~~~~~~~~~~~^~~~
sorting.cpp:52:23: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   52 |     return kek.size() <= k;
      |            ~~~~~~~~~~~^~~~
sorting.cpp: In function 'void simulate(int)':
sorting.cpp:56:22: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   56 |     while (sw.size() != k)
      |            ~~~~~~~~~~^~~~
sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:95:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   95 |     for (int i = 0; i < out.size(); i++){
      |                     ~~^~~~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 512 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 512 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 640 KB Output is correct
22 Correct 2 ms 640 KB Output is correct
23 Correct 2 ms 640 KB Output is correct
24 Correct 1 ms 640 KB Output is correct
25 Correct 1 ms 768 KB Output is correct
26 Correct 1 ms 640 KB Output is correct
27 Correct 1 ms 640 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 640 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 640 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 640 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 640 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 2 ms 640 KB Output is correct
14 Correct 1 ms 512 KB Output is correct

Subtask #6
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 640 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 640 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 640 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 640 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 2 ms 640 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 234 ms 19924 KB Output is correct
16 Correct 236 ms 20792 KB Output is correct
17 Correct 283 ms 21260 KB Output is correct
18 Correct 41 ms 6264 KB Output is correct
19 Correct 171 ms 17772 KB Output is correct
20 Correct 190 ms 18352 KB Output is correct
21 Correct 179 ms 18512 KB Output is correct
22 Correct 246 ms 21728 KB Output is correct
23 Correct 241 ms 22424 KB Output is correct
24 Correct 278 ms 21564 KB Output is correct
25 Correct 282 ms 21396 KB Output is correct
26 Correct 174 ms 17532 KB Output is correct
27 Correct 161 ms 17400 KB Output is correct
28 Correct 256 ms 21664 KB Output is correct
29 Correct 241 ms 20568 KB Output is correct
30 Correct 126 ms 15092 KB Output is correct
31 Correct 237 ms 22196 KB Output is correct
32 Correct 253 ms 21112 KB Output is correct
33 Correct 272 ms 21644 KB Output is correct
34 Correct 245 ms 22108 KB Output is correct
35 Correct 167 ms 17692 KB Output is correct
36 Correct 74 ms 12792 KB Output is correct
37 Correct 250 ms 21584 KB Output is correct
38 Correct 239 ms 21464 KB Output is correct
39 Correct 243 ms 20796 KB Output is correct