Submission #135315

#	Time	Username	Problem	Language	Result	Execution time	Memory
135315		tinjyu	Sorting (IOI15_sorting)	C++14	0 / 100	7 ms	376 KiB

sorting

#include "sorting.h"
#include <iostream>
using namespace std;
int findSwapPairs(int n, int s[], int m, int x[], int y[], int P[], int Q[]) {
    int num[50005];
    for(int i=0;i<n;i++)num[i]=i;
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<i;j++)
        {
            if(s[i]<s[j])
            {
                swap(num[i],num[j]);
                swap(s[i],s[j]);
            }
        }
    }
    for(int i=0;i<n;i++)s[num[i]]=i;
    //for(int i=0;i<n;i++)cout<<s[i]<<" ";
    //cout<<endl;
    int r=0;
    for(int i=0;i<n;i++)
    {
        int t=0;
        for(int j=0;j<n;j++)if(s[j]==i)
        {
            t=j;
            break;
        }
        if(i==t)continue;
        //cout<<P[r]<<" "<<Q[r]<<endl;
        swap(s[i],s[t]);
        //for(int j=0;j<n;j++)cout<<s[j]<<" ";
        //cout<<endl;
        r++;
    }
    //if(s[0]!=0)r++;
	return r;
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:4:39: warning: unused parameter 'm' [-Wunused-parameter]
 int findSwapPairs(int n, int s[], int m, int x[], int y[], int P[], int Q[]) {
                                       ^
sorting.cpp:4:48: warning: unused parameter 'x' [-Wunused-parameter]
 int findSwapPairs(int n, int s[], int m, int x[], int y[], int P[], int Q[]) {
                                                ^
sorting.cpp:4:57: warning: unused parameter 'y' [-Wunused-parameter]
 int findSwapPairs(int n, int s[], int m, int x[], int y[], int P[], int Q[]) {
                                                         ^
sorting.cpp:4:66: warning: unused parameter 'P' [-Wunused-parameter]
 int findSwapPairs(int n, int s[], int m, int x[], int y[], int P[], int Q[]) {
                                                                  ^
sorting.cpp:4:75: warning: unused parameter 'Q' [-Wunused-parameter]
 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