oj.uz

Submission #134283

# Submission time Handle Problem Language Result Execution time Memory
134283 2019-07-22T10:41:14 Z Runtime_error_ Sorting (IOI15_sorting) C++14
0 / 100
 4 ms 380 KB 
#include "sorting.h"
#include <bits/stdc++.h>
using namespace std;

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
    if(N < 2)
        return 0;
    int l =2,tr=1;
    for(int i=0;i<N;i++)
        if(S[i] != i)
            tr = 0;
    if(tr)
        return 0;

    for(int i=0;i<N;i++)
        if(S[i] != i)
            tr++;
    if(tr = 0)
        return 0;
    for(int i=0;i<M;i++){
        swap( S[ X[i] ],S[ Y[i] ] );

        while(S[l] == l && l<N)
            l++;
        if( l == N){

            if(S[0] == 0 && S[1] == 1)
                P[i] = 0,Q[i] = 0;

            else
                P[i]=0,Q[i] = 1;

            i++;
            return i;
        }
        int j;
        for(j=0;j<N;j++)
            if(S[j] == l)
                break;
        P[i] = l , Q[i] = j;
        swap(S[l],S[j]);
    }

}

Compilation message

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:18:11: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
     if(tr = 0)
        ~~~^~~
sorting.cpp:44:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Incorrect 2 ms 376 KB Output isn't correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Incorrect 2 ms 376 KB Output isn't correct

Subtask #3
0 / 16.0

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

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Incorrect 2 ms 376 KB Output isn't correct

Subtask #5
0 / 20.0

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

Subtask #6
0 / 26.0

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