Submission #1122127

#	Time	Username	Problem	Language	Result	Execution time	Memory
1122127		epicci23	정렬하기 (IOI15_sorting)	C++17	0 / 100	4 ms	336 KiB

sorting

#include "sorting.h"
#include "bits/stdc++.h"
#define all(v) v.begin() , v.end()
#define sz(a) (int)a.size()
using namespace std;

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

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:7:39: warning: unused parameter 'M' [-Wunused-parameter]
    7 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                   ~~~~^
sorting.cpp:7:46: 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:55: 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
• Subtask 2: 0 / 12
• Subtask 3: 0 / 16
• Subtask 4: 0 / 18
• Subtask 5: 0 / 20
• Subtask 6: 0 / 26