Submission #132341

#	Time	Username	Problem	Language	Result	Execution time	Memory
132341		reda	Sorting (IOI15_sorting)	C++14	0 / 100	2 ms	376 KiB

sorting

#include<bits/stdc++.h>
using namespace std ;
# include "sorting.h"
vector<pair<int,int>>  v;
int findSwapPairs(int N, int S[], int M, int X[], int  Y[], int p[], int q[])
{
    for(int i=0;i<N;i++)
    {
        v.push_back(make_pair(S[i],i));
    }
    int  c=0;
    sort(v.begin(),v.end());
  int i=0,j=0;
    while(i<N)
    {
        if(v[i].first != S[i]){i++;p[j]=0;q[j]=0;}
      else {
        q[j]=i;
        p[j]=v[i].second;
        c++;
        j++;
        i++;
           }
    }
    return c;
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:5: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:5: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:5:58: warning: unused parameter 'Y' [-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