oj.uz

Submission #420709

# Submission time Handle Problem Language Result Execution time Memory
420709 2021-06-08T13:26:55 Z LouayFarah Sorting (IOI15_sorting) C++14
0 / 100
 1 ms 332 KB 
#include "bits/stdc++.h"
#include "sorting.h"
using namespace std;

int findSwapPairs(int n, int s[], int m, int x[], int y[], int p[], int q[])
{
    bool sub0 = true, sub2 = true;
    for(int i = 0; i<m; i++)
    {
        if((x[i]!=y[i])||(x[i]==y[i]&&x[i]!=0))
        {
            sub0 = false;
            break;
        }
    }
    for(int i = 0; i<m; i++)
    {
        if(x[i]!=0||y[i]!=1)
        {
            sub2 = false;
            break;
        }
    }

    if(sub0)
    {
        int i = 0;
        int r = 0;
        int curr = 1;
        while(i<n)
        {
            if(curr!=s[i])
                break;
            i++, curr++;
        }

        while(i<n)
        {
            int j;
            for(j = i+1; j<n; j++)
            {
                if(s[j]==curr)
                    break;
            }
            p[r] = i, q[r] = j;
            swap(s[i], s[j]);
            j++, i++, curr++;
            while(i<n)
            {
                if(curr!=s[i])
                    break;
                curr++, i++;
            }
        }
        
        return r;
    }
    else if(sub2)
    {

    }
    else
    {

    }
}

Compilation message

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

Subtask #1
0 / 8.0

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

Subtask #2
0 / 12.0

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

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

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

Subtask #6
0 / 26.0

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