oj.uz

Submission #31816

# Submission time Handle Problem Language Result Execution time Memory
31816 2017-09-10T11:23:25 Z top34051 Sorting (IOI15_sorting) C++14
0 / 100
 14 ms 384 KB 
#include "sorting.h"
#include<bits/stdc++.h>
using namespace std;
#define maxn 2005

int a[maxn], pos[maxn];

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
    int i,x,now,cnt;
    for(now=0;now<M;now++) {
        swap(S[X[now]], S[Y[now]]);

        for(i=0;i<N;i++) a[i] = S[i];
        for(i=0;i<N;i++) pos[a[i]] = i;

        cnt = 0;
        for(i=0;i<N;i++) {
            x = pos[i];
            if(i!=x) {
                pos[a[i]] = x;
                swap(a[i], a[x]);
                P[cnt] = i; Q[cnt] = x;
                cnt++;
            }
        }

        if(cnt<=now+1) return now+1;
    }
}

Compilation message

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:29:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
0 / 8.0

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

Subtask #2
0 / 12.0

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

Subtask #3
0 / 16.0

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

Subtask #4
0 / 18.0

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

Subtask #5
0 / 20.0

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

Subtask #6
0 / 26.0

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