oj.uz

Submission #95513

# Submission time Handle Problem Language Result Execution time Memory
95513 2019-02-01T17:50:59 Z tincamatei Sorting (IOI15_sorting) C++14
0 / 100
 12 ms 504 KB 
#include "sorting.h"
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 200000;

int *p, *q, *s;
int top;

int poz[MAX_N];

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
  p = P;
  q = Q;
  s = S;

  for(int i = 0; i < N; ++i)
    poz[i] = i;

  for(int i = 0; i < M; ++i)
    swap(poz[X[i]], poz[Y[i]]);

  for(int i = M - 1; i >= 0; --i) {
    int j = 0;
    while(j < N && poz[j] == S[j])
      ++j;
    if(j == N) { // we did it boys
      P[top] = 0;
      Q[top++] = 0;
    } else {
      int k = 0;
      while(k < N && poz[k] != S[j])
        ++k;
      P[top] = j;
      Q[top++] = k;
      swap(S[j], S[k]);
    }
  }

  reverse(P, P + top);
  reverse(Q, Q + top);

	return top;
}

Subtask #1
0 / 8.0

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

Subtask #2
0 / 12.0

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

Subtask #3
0 / 16.0

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

Subtask #4
0 / 18.0

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

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 504 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 504 KB Output isn't correct
2 Halted 0 ms 0 KB -