oj.uz

답안 #434644

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
434644 2021-06-21T13:43:18 Z Maqsut_03 정렬하기 (IOI15_sorting) C++17
0 / 100
 2 ms 716 KB 
#include <bits/stdc++.h>
#include "sorting.h"

using namespace std;
int S[555555];
int findSwapPairs(int N, int s[], int M, int X[], int Y[], int P[], int Q[]){
    for (int i = 0 ; i<N;i++) S[i] = (int)s[i];
    int R = 0;
    for (int i = 0 ; i< N; i++) {
        for (int j = 1; j < N; j++) {
            if (S[j-1] > S[j]) {

                int tmp  = 0;
                //std::swap(S[j-1], S[j]);
                tmp = S[j-1];
                S[j-1] = S[j];
                S[j] = tmp;

                P[R] = j-1;
                Q[R] = j;
                //std::cout << j-1 << ' ' << j <<std:: endl;
                R++;
            }
        }
    }
    assert(R<=M);
    for (int i = 0;i<N;i++) {
        assert(S[i]==i);
    }
    return R;
}

Compilation message

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:6:46: warning: unused parameter 'X' [-Wunused-parameter]
    6 | int findSwapPairs(int N, int s[], int M, int X[], int Y[], int P[], int Q[]){
      |                                          ~~~~^~~
sorting.cpp:6:55: warning: unused parameter 'Y' [-Wunused-parameter]
    6 | int findSwapPairs(int N, int s[], int M, int X[], int Y[], int P[], int Q[]){
      |                                                   ~~~~^~~

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Incorrect 1 ms 204 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Incorrect 1 ms 204 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Incorrect 1 ms 204 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 716 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 716 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -