oj.uz

답안 #421102

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
421102 2021-06-08T18:08:22 Z LouayFarah 정렬하기 (IOI15_sorting) C++14
0 / 100
 2 ms 844 KB 
#include "bits/stdc++.h"
#include "sorting.h"
using namespace std;

bool sorted(int s[], int n)
{
    int i = 0;
    while(i<n)
    {
        if(s[i]!=i)
            return false;
        i++;
    }

    return true;
}

int findSwapPairs(int n, int s[], int m, int x[], int y[], int p[], int q[])
{
    int res = 0;
    for(int k = 0; k<n; k++)
    {
        for(int i = 0; i<n-1; i++)
        {
            if(sorted(s, n))
                break;

            if(s[i]>s[i+1])
            {
                p[res] = i;
                p[res+1] = i+1;
                swap(p[res], p[res+1]);
                res++;
            }
        }
    }

    return res;
}

Compilation message

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:18:39: warning: unused parameter 'm' [-Wunused-parameter]
   18 | int findSwapPairs(int n, int s[], int m, int x[], int y[], int p[], int q[])
      |                                   ~~~~^
sorting.cpp:18:46: warning: unused parameter 'x' [-Wunused-parameter]
   18 | int findSwapPairs(int n, int s[], int m, int x[], int y[], int p[], int q[])
      |                                          ~~~~^~~
sorting.cpp:18:55: warning: unused parameter 'y' [-Wunused-parameter]
   18 | int findSwapPairs(int n, int s[], int m, int x[], int y[], int p[], int q[])
      |                                                   ~~~~^~~
sorting.cpp:18:73: warning: unused parameter 'q' [-Wunused-parameter]
   18 | 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 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 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 288 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

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

Subtask #5
0 / 20.0

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

Subtask #6
0 / 26.0

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