oj.uz

Submission #804286

# Submission time Handle Problem Language Result Execution time Memory
804286 2023-08-03T07:47:18 Z _martynas Sorting (IOI15_sorting) C++11
0 / 100
 1 ms 340 KB 
#include "sorting.h"
#include <bits/stdc++.h>

using namespace std;

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
    for (int i = 0; i < M; i++) P[i] = Q[i] = 0;
    int T[N];
    for (int i = 0; i < N; i++) T[i] = S[i];
    for (int i = 0; i < M; i++) swap(T[X[i]], T[Y[i]]);
    int where[N];
    for (int i = 0; i < N; i++) where[T[i]] = i;
    vector<pair<int, int>> swap_list;
    for (int i = 0; i < N; i++) {
        if (T[i] != i) {
            swap_list.emplace_back(i, T[i]);
            int a = i, b = where[i];
            swap(where[T[a]], where[T[b]]);
            swap(T[a], T[b]);
        }
    }
    for (int i = 0; i < N; i++) T[i] = S[i];
    for (int i = 0; i < N; i++) where[T[i]] = i;
    for (int i = 0; i < (int)swap_list.size(); i++) {
        swap(T[X[i]], T[Y[i]]);
        int a = where[swap_list[i].first], b = where[swap_list[i].first];
        P[i] = a;
        Q[i] = b;
        swap(where[T[a]], where[T[b]]);
        swap(T[a], T[b]);
    }

    for (int i = 0; i < M; i++) {
        if (is_sorted(S, S+N)) return i;
        swap(S[X[i]], S[Y[i]]);
        swap(S[P[i]], S[Q[i]]);
    }
    return M;
}

// int main(int argc, char *argv[]) {
//     if (argc > 1) srand(atoi(argv[1]));
//     int N = rand() % 50 + 1;
//     int M = 30*N;
//     int S[N], X[M], Y[M], P[M], Q[M];

//     iota(S, S+N, 0);
//     random_shuffle(S, S+N);

//     for (int i = 0; i < N; i++) {
//         cerr << S[i] << " \n"[i == N-1];
//     }

//     for (int i = 0; i < M; i++) {
//         int a = rand() % N, b = rand() % N;
//         if (a > b) swap(a, b);
//         X[i] = 0, Y[i] = 0;
//     }

//     findSwapPairs(N, S, M, X, Y, P, Q);
//     return 0;
// }

Subtask #1
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 Incorrect 0 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
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 Incorrect 0 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
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 Incorrect 0 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -