Submission #434552

#	Time	Username	Problem	Language	Result	Execution time	Memory
434552		ismoilov	정렬하기 (IOI15_sorting)	C++14	0 / 100	6 ms	332 KiB

sorting

#include "sorting.h"
#include <bits/stdc++.h>
using namespace std;
bool check(int a[], int n){
    for(int i = 0; i < n; i ++)
        if(a[i] != i)
            return 0;
    return 1;
}
int findSwapPairs(int n, int s[], int m, int x[], int y[], int p[], int q[]) {
    while(!check(s, n)){
        for(int i = 0; i < n; i ++){
            for(int j = 0; j < n; j ++){
                if(s[j] == i){
                    swap(s[j], s[i]);
                    p[i] = i, q[i] = j;
                }
            }
        }
    }
    return n;
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:10:39: warning: unused parameter 'm' [-Wunused-parameter]
   10 | int findSwapPairs(int n, int s[], int m, int x[], int y[], int p[], int q[]) {
      |                                   ~~~~^
sorting.cpp:10:46: warning: unused parameter 'x' [-Wunused-parameter]
   10 | int findSwapPairs(int n, int s[], int m, int x[], int y[], int p[], int q[]) {
      |                                          ~~~~^~~
sorting.cpp:10:55: warning: unused parameter 'y' [-Wunused-parameter]
   10 | int findSwapPairs(int n, int s[], int m, int x[], int y[], int p[], int q[]) {
      |                                                   ~~~~^~~

• Subtask 1: 0 / 8
• Subtask 2: 0 / 12
• Subtask 3: 0 / 16
• Subtask 4: 0 / 18
• Subtask 5: 0 / 20
• Subtask 6: 0 / 26