oj.uz

Submission #795558

# Submission time Handle Problem Language Result Execution time Memory
795558 2023-07-27T11:18:57 Z Josia Sorting (IOI15_sorting) C++17
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] = 0;
    for (int i = 0; i<M; i++) Q[i] = 0;
    assert(M >= N);
    vector<int> S(N);
    for (int i = 0; i<N; i++) S[i] = _S[i];

    for (int i = 0; i<N; i++) {
        for (int j = i; j<N; j++) {
            if (S[j] == i) {
                P[i]=i;
                Q[i]=j;
                swap(S[i], S[j]);
                break;
            }
        }
    }

    return N;
}

Compilation message

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:7:47: warning: unused parameter 'X' [-Wunused-parameter]
    7 | int findSwapPairs(int N, int _S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                           ~~~~^~~
sorting.cpp:7:56: warning: unused parameter 'Y' [-Wunused-parameter]
    7 | int findSwapPairs(int N, int _S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                                    ~~~~^~~

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

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 1 ms 212 KB Output isn't correct
5 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 -