제출 #283997

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
283997		stoyan_malinin	정렬하기 (IOI15_sorting)	C++14	0 / 100	2 ms	512 KiB

sorting

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

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

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, vector <int> &s)
{
    for(int i = 1;i<n;i++)
    {
        if(s[i-1]>s[i]) return false;
    }

    return true;
}

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

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

                if(checkSorted(n, s)==true) return swapInd;
                break;
            }
        }
    }

    assert(false);
}

int solve3(int n, vector <int> s, int m, int *p, int *q)
{
    if(checkSorted(n, s)==true) return 0;

    int swapInd = 0;
    swap(s[0], s[1]);

    function <bool(int)> isGood = [&](int x)
    {
        if(x==0 || x==1) return true;
        return false;
    };
    for(int i = 2;i<n;i++)
    {
        //cout << " -> " << i << " " << s[i] << '\n';

        if(isGood(s[i])==true)
        {
            for(int j = 0;j<2;j++)
            {
                if(isGood(s[j])==false)
                {
                    p[swapInd] = i;
                    q[swapInd] = j;
                    swap(s[i], s[j]);
                    swapInd++;

                    //cout << "swap: " << i << " " << j << '\n';
                    //cout << " --> k" << '\n';
                    if(checkSorted(n, s)==true) return swapInd;

                    swap(s[0], s[1]);
                    break;
                }
            }
        }
    }

    //cout << "%%%";
    //for(int p = 0;p<n;p++) cout << s[p] << " ";
    //cout << '\n';

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

                //cout << "swap: " << i << " " << j << '\n';
                if(checkSorted(n, s)==true)
                {
                    //for(int p = 0;p<n;p++) cout << s[p] << " ";
                    //cout << '\n';

                    //cout << "ok " << i << '\n';
                    return swapInd;
                }

                swap(s[0], s[1]);
                break;
            }
        }
    }

    //cout << "%%%";
    //for(int p = 0;p<n;p++) cout << s[p] << " ";
    //cout << '\n';

    //cout << "A SQ DE" << '\n';
    if(checkSorted(n, s)==false)
    {
        //cout << "hier" << '\n';

        p[swapInd] = 0;
        q[swapInd] = 1;
        swapInd++;
    }
    else
    {

        p[swapInd] = 0;
        q[swapInd] = 0;
        swapInd++;
    }

    //cout << " ---- " << "END " << checkSorted(n, s) << " --- " << '\n';
    return swapInd;
}

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

    vector <int> v;
    for(int i = 0;i<N;i++) v.push_back(S[i]);

    return solve3(N, v, M, P, Q);

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

컴파일 시 표준 에러 (stderr) 메시지

sorting.cpp: In function 'int solve3(int, std::vector<int>, int, int*, int*)':
sorting.cpp:62:39: warning: unused parameter 'm' [-Wunused-parameter]
   62 | int solve3(int n, vector <int> s, int m, int *p, int *q)
      |                                   ~~~~^
sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:158:9: warning: unused variable 'subtask' [-Wunused-variable]
  158 |     int subtask = guessSubtask(M, X, Y);
      |         ^~~~~~~

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