Submission #432577

#	Time	Username	Problem	Language	Result	Execution time	Memory
432577		daniel920712	Sorting (IOI15_sorting)	C++14	36 / 100	3 ms	332 KiB

sorting

#include "sorting.h"
#include <iostream>
#include <stdio.h>
using namespace std;
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[])
{
    int i,j,now=0,ok;
    for(i=N-1;i>=0;i--)
    {
        ok=1;
        if(S[i]==i) continue;
        if(X[now]!=Y[now]) swap(S[X[now]],S[Y[now]]);
        for(j=0;j<N;j++)
        {
            if(S[j]==i)
            {
                P[now]=i;
                Q[now]=j;
                
                
                swap(S[P[now]],S[Q[now]]);
                now++;
                break;
            }
        }

    }
    //for(j=0;j<N;j++) printf("%d ",S[j]);
	return now;
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:7:19: warning: variable 'ok' set but not used [-Wunused-but-set-variable]
    7 |     int i,j,now=0,ok;
      |                   ^~
sorting.cpp:5:39: warning: unused parameter 'M' [-Wunused-parameter]
    5 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[])
      |                                   ~~~~^

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