oj.uz

Submission #572515

# Submission time Handle Problem Language Result Execution time Memory
572515 2022-06-04T15:04:35 Z MohamedFaresNebili Sorting (IOI15_sorting) C++14
74 / 100
 1000 ms 17616 KB 
#include <bits/stdc++.h>
#include "sorting.h"
#include <ext/pb_ds/assoc_container.hpp>

        using namespace std;
        using namespace __gnu_pbds;

        using ll = long long;
        using ii = pair<int, int>;
        using vi = vector<int>;

        #define pb push_back
        #define pp pop_back
        #define ff first
        #define ss second
        #define lb lower_bound
        #define all(x) (x).begin(), (x).end()

        typedef tree<int, null_type, less<int>, rb_tree_tag,
            tree_order_statistics_node_update> indexed_set;

        bool can(int N, int S[], int M, int X[], int Y[]) {
            int s[N], x[M], y[M];
            int res[N], pos[N], ind[N];
            for(int l = 0; l < N; l++) s[l] = S[l];
            for(int l = 0; l < M; l++)
                x[l] = X[l], y[l] = Y[l];
            for(int l = 0; l < N; l++) {
                res[l] = l; pos[s[l]] = l;
            }
            for(int l = 0; l < M; l++) {
                int i = x[l], j = y[l];
                swap(res[i], res[j]);
            }
            for(int l = 0; l < N; l++)
                ind[res[l]] = l;
            for(int l = 0; l < M; l++) {
                int i = x[l], j = y[l];
                swap(s[i], s[j]);
                swap(pos[s[i]], pos[s[j]]);
                i = ind[i], j = ind[j];
                swap(res[i], res[j]);
                swap(ind[res[i]], ind[res[j]]);
                int u = 0, v = 0;
                for(int k = 0; k < N; k++) {
                    if(s[k] == ind[k]) continue;
                    u = k;
                    for(int a = 0; a < N; a++) {
                        if(s[a] != ind[k]) continue;
                        v = a; break;
                    }
                    break;
                }
                swap(s[u], s[v]);
                swap(pos[s[u]], pos[s[v]]);
            }
            for(int l = 0; l < N - 1; l++)
                if(s[l] > s[l + 1]) return 0;
            return 1;
        }

        int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
            int lo = 0, hi = M;
            while(lo <= hi) {
                int md = (lo + hi) / 2;
                if(can(N, S, md, X, Y)) {
                    M = md; hi = md - 1;
                }
                else lo = md + 1;
            }
            int res[N], pos[N], ind[N];
            for(int l = 0; l < N; l++) {
                res[l] = l; pos[S[l]] = l;
            }
            for(int l = 0; l < M; l++) {
                int i = X[l], j = Y[l];
                swap(res[i], res[j]);
            }
            for(int l = 0; l < N; l++)
                ind[res[l]] = l;
            for(int l = 0; l < M; l++) {
                int i = X[l], j = Y[l];
                swap(S[i], S[j]);
                swap(pos[S[i]], pos[S[j]]);
                i = ind[i], j = ind[j];
                swap(res[i], res[j]);
                swap(ind[res[i]], ind[res[j]]);
                int u = 0, v = 0;
                for(int k = 0; k < N; k++) {
                    if(S[k] == ind[k]) continue;
                    u = k;
                    for(int a = 0; a < N; a++) {
                        if(S[a] != ind[k]) continue;
                        v = a; break;
                    }
                    break;
                }
                swap(S[u], S[v]);
                swap(pos[S[u]], pos[S[v]]);
                P[l] = u, Q[l] = v;
            }
            return M;
        }

Subtask #1
8.0 / 8.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 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct

Subtask #2
12.0 / 12.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 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 308 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 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 308 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 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 308 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 308 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 304 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 10 ms 468 KB Output is correct
22 Correct 10 ms 568 KB Output is correct
23 Correct 15 ms 468 KB Output is correct
24 Correct 10 ms 568 KB Output is correct
25 Correct 11 ms 596 KB Output is correct
26 Correct 10 ms 584 KB Output is correct
27 Correct 10 ms 596 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 460 KB Output is correct
2 Correct 47 ms 468 KB Output is correct
3 Correct 37 ms 460 KB Output is correct
4 Correct 9 ms 468 KB Output is correct
5 Correct 12 ms 472 KB Output is correct
6 Correct 15 ms 452 KB Output is correct
7 Correct 24 ms 468 KB Output is correct
8 Correct 39 ms 440 KB Output is correct
9 Correct 34 ms 448 KB Output is correct
10 Correct 41 ms 452 KB Output is correct
11 Correct 34 ms 452 KB Output is correct
12 Correct 26 ms 468 KB Output is correct
13 Correct 37 ms 372 KB Output is correct
14 Correct 12 ms 468 KB Output is correct

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 460 KB Output is correct
2 Correct 47 ms 468 KB Output is correct
3 Correct 37 ms 460 KB Output is correct
4 Correct 9 ms 468 KB Output is correct
5 Correct 12 ms 472 KB Output is correct
6 Correct 15 ms 452 KB Output is correct
7 Correct 24 ms 468 KB Output is correct
8 Correct 39 ms 440 KB Output is correct
9 Correct 34 ms 448 KB Output is correct
10 Correct 41 ms 452 KB Output is correct
11 Correct 34 ms 452 KB Output is correct
12 Correct 26 ms 468 KB Output is correct
13 Correct 37 ms 372 KB Output is correct
14 Correct 12 ms 468 KB Output is correct
15 Execution timed out 1036 ms 17616 KB Time limit exceeded
16 Halted 0 ms 0 KB -