oj.uz

Submission #804321

# Submission time Handle Problem Language Result Execution time Memory
804321 2023-08-03T08:01:36 Z _martynas Sorting (IOI15_sorting) C++11
54 / 100
 1000 ms 532 KB 
#include "sorting.h"
#include <bits/stdc++.h>

using namespace std;

int tryFindSwapPairs(const int N, int S[], const 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(where[T[X[i]]], where[T[Y[i]]]);
        swap(T[X[i]], T[Y[i]]);
        int a = where[swap_list[i].first], b = where[swap_list[i].second];
        P[i] = a;
        Q[i] = b;
        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 < M; i++) {
        if (is_sorted(T, T+N)) return i;
        swap(T[X[i]], T[Y[i]]);
        swap(T[P[i]], T[Q[i]]);
    }
    if (!is_sorted(T, T+N)) return -1;
    return M;
}

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
    int mn_i = M, mn_val = M;
    for (int i = 0; i < M; i++) {
        int p[M], q[M];
        int ans = tryFindSwapPairs(N, S, i, X, Y, p, q);
        if (ans >= 0 && ans < mn_val) {
            mn_val = ans;
            mn_i = i;
        }
    }
    int p[M], q[M];
    int ans = tryFindSwapPairs(N, S, mn_i, X, Y, p, q);
    copy(p, p+M, P), copy(q, q+M, Q);
    return ans;
}

// int main(int argc, char *argv[]) {
//     if (argc > 1) srand(atoi(argv[1]));
//     int N = rand() % 2000 + 1;
//     int M = 3*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;
//     }

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

//     return 0;
// }

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 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 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 21 ms 348 KB Output is correct
11 Correct 21 ms 344 KB Output is correct
12 Correct 23 ms 352 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 17 ms 340 KB Output is correct
4 Correct 18 ms 352 KB Output is correct
5 Correct 18 ms 344 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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 21 ms 348 KB Output is correct
11 Correct 21 ms 344 KB Output is correct
12 Correct 23 ms 352 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 17 ms 340 KB Output is correct
16 Correct 18 ms 352 KB Output is correct
17 Correct 18 ms 344 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 497 ms 520 KB Output is correct
22 Correct 504 ms 516 KB Output is correct
23 Correct 615 ms 528 KB Output is correct
24 Correct 554 ms 520 KB Output is correct
25 Correct 509 ms 532 KB Output is correct
26 Correct 582 ms 532 KB Output is correct
27 Correct 446 ms 516 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 248 ms 416 KB Output is correct
2 Execution timed out 1077 ms 508 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 248 ms 416 KB Output is correct
2 Execution timed out 1077 ms 508 KB Time limit exceeded
3 Halted 0 ms 0 KB -