oj.uz

Submission #60140

# Submission time Handle Problem Language Result Execution time Memory
60140 2018-07-23T17:45:08 Z dukati8 Sorting (IOI15_sorting) C++14
20 / 100
 49 ms 384 KB 
#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++;
  }
  for (int j=i-1;j>=0; j--) {
    P[j]=moves[j].first;
    Q[j]=moves[j].second;
    rep (k,0,j-1) {
      if (moves[k].first==X[j]) moves[k].first=Y[j];
      else if (moves[k].first==Y[j]) moves[k].first=X[j];
      if (moves[k].second==X[j]) moves[k].second=Y[j];
      else if (moves[k].second==Y[j]) moves[k].second=X[j];
    }
  }
  return i;
}

Compilation message

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
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.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 3 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 3 ms 384 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 3 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 3 ms 256 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 256 KB Output is correct
2 Incorrect 2 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 3 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 3 ms 256 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 3 ms 256 KB Output is correct
14 Incorrect 2 ms 384 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 384 KB Output is correct
2 Incorrect 49 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 384 KB Output is correct
2 Incorrect 49 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -