oj.uz

Submission #432561

# Submission time Handle Problem Language Result Execution time Memory
432561 2021-06-18T11:04:58 Z daniel920712 Sorting (IOI15_sorting) C++14
8 / 100
 1000 ms 332 KB 
#include "sorting.h"
#include <iostream>
using namespace std;
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[])
{
    int i,j,now=0,ok;
    for(i=N-1;i>=0;i--)
    {
        ok=1;
        for(j=0;j<N;j++) if(S[j]!=j) ok=0;
        if(ok) break;
        swap(S[X[now]],S[Y[now]]);
        for(j=0;j<N;j++)
        {
            if(S[j]==i)
            {
                if(i!=j)
                {
                    P[now]=i;
                    Q[now]=j;
                }
                else
                {
                    P[now]=1;
                    Q[now]=0;
                }
                swap(S[P[now]],S[Q[now]]);
                now++;
                break;
            }
        }

    }
    for(j=0;j<N;j++) if(S[j]!=j) while(1);
	return now;
}

Compilation message

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:34:34: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
   34 |     for(j=0;j<N;j++) if(S[j]!=j) while(1);
      |                                  ^~~~~
sorting.cpp:35:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
   35 |  return now;
      |  ^~~~~~
sorting.cpp:4:39: warning: unused parameter 'M' [-Wunused-parameter]
    4 | 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 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct

Subtask #2
0 / 12.0

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

Subtask #3
0 / 16.0

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

Subtask #4
0 / 18.0

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

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1085 ms 332 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1085 ms 332 KB Time limit exceeded
2 Halted 0 ms 0 KB -