Submission #283345

#	Time	Username	Problem	Language	Result	Execution time	Memory
283345		stoyan_malinin	Sorting (IOI15_sorting)	C++14	0 / 100	1 ms	512 KiB

sorting

#include "sorting.h"
//#include "grader.cpp"

#include <vector>
#include <assert.h>
#include <iostream>

using namespace std;

int guessSubtask(int m, int *x, int *y)
{
    bool subtask2 = true;
    for(int i = 0;i<m;i++)
    {
        if(!(x[i]==0 && y[i]==0))
        {
            subtask2 = false;
            break;
        }
    }
    if(subtask2==true) return 2;

    return -1;
}

bool checkSorted(int n, int *s)
{
    for(int i = 1;i<n;i++)
    {
        if(s[i-1]>s[i]) return false;
    }

    return true;
}

int solve2(int n, int *s, int *p, int *q)
{
    if(checkSorted(n, s)==true) return 0;

    for(int i = 0;i<n;i++)
    {
        for(int j = i;j<n;j++)
        {
            if(s[j]==i)
            {
                swap(s[i], s[j]);
                p[i] = i;
                q[i] = j;

                if(checkSorted(n, s)==true) return i + 1;
                break;
            }
        }
    }

    assert(false);
}

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[])
{
    int subtask = guessSubtask(M, X, Y);
    if(subtask==2) return solve2(N, S, P, Q);

    assert(false);
}
/*
4
3 2 1 0
5
0 0
0 0
0 0
0 0
0 0
*/

• Subtask 1: 0 / 8
• Subtask 2: 0 / 12
• Subtask 3: 0 / 16
• Subtask 4: 0 / 18
• Subtask 5: 0 / 20
• Subtask 6: 0 / 26