oj.uz

Submission #434622

# Submission time Handle Problem Language Result Execution time Memory
434622 2021-06-21T13:17:38 Z Maqsut_03 Sorting (IOI15_sorting) C++14
0 / 100
 1 ms 460 KB 
#include "sorting.h"
#include<bits/stdc++.h>
using namespace std;
int S[500500];
int findSwapPairs(int N, int s[], int M, int X[], int Y[], int P[], int Q[]) {
    for (int i = 0;i<M;i++) {
        assert(X[i]+Y[i]==0);
    }
    for (int i = 0; i < N; i++) S[i] = s[i];
    int r = 0;
    for (int i=0; i<N; i++)
        for (int j=i; j<N; j++)
    {
        if (S[i] > S[j]) {
                swap(S[i], S[j]); P[r] = i; Q[r] = j; r++;
        }
    }
    return M;
}

Subtask #1
0 / 8.0

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

Subtask #2
0 / 12.0

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

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 460 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

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

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 460 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 460 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -