Submission #60142

#	Time	Username	Problem	Language	Result	Execution time	Memory
60142		dukati8	정렬하기 (IOI15_sorting)	C++14	36 / 100	40 ms	496 KiB

sorting

#include "sorting.h"
#include <bits/stdc++.h>
#define rep(i,a,b) for (int i=a; i<int(b); i++)
using namespace std;

vector<pair<int, int> > moves;
int movestofix(int Ii[],int Ss[], int N) {
  int I[N], S[N];
  rep (i,0,N) { I[i]=Ii[i];S[i]=Ss[i];}
  moves.clear();
  //I[i] is not value at i, but index of value i in S
  int counter=0;
  rep(i,0,N) {
    if (S[i]==i) continue;
    counter++;
    int a,b;
    a=i;
    b=I[i];
    //a och b byter plats
    int sa,sb;
    sa=S[a];
    sb=S[b];
    moves.push_back(make_pair(a,b));
    S[a]=sb;
    S[b]=sa;
    I[sa]=b;
    I[sb]=a;

  }
  moves.push_back(make_pair(0,0));
  return counter;
}

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
  int I[N];
  rep (i,0,N) {
    I[S[i]]=i;
  }
  int i=0;
  while (movestofix(I,S,N)>i) {

    int a,b;
    a=X[i];
    b=Y[i];
    //a och b byter plats
    int sa,sb;
    sa=S[a];
    sb=S[b];
    S[a]=sb;
    S[b]=sa;
    I[sa]=b;
    I[sb]=a;
    i++;
  }
  int switches[N];
  rep (i,0,N) switches[i]=i;

  for (int j=i-1;j>=0; j--) {
    P[j]=switches[moves[j].first];
    Q[j]=switches[moves[j].second];
    swap(switches[X[j]],switches[Y[j]]);
  }
  return i;
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:56:8: warning: declaration of 'i' shadows a previous local [-Wshadow]
   rep (i,0,N) switches[i]=i;
        ^
sorting.cpp:3:29: note: in definition of macro 'rep'
 #define rep(i,a,b) for (int i=a; i<int(b); i++)
                             ^
sorting.cpp:39:7: note: shadowed declaration is here
   int i=0;
       ^
sorting.cpp:34:39: warning: unused parameter 'M' [-Wunused-parameter]
 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