oj.uz

Submission #64830

# Submission time Handle Problem Language Result Execution time Memory
64830 2018-08-05T18:34:35 Z Kubalionzzale Sorting (IOI15_sorting) C++14
0 / 100
 8 ms 512 KB 
#include "sorting.h"

#include <iostream>
#include <algorithm>
#include <set>

std::set<int> notPlaced;
int b[200010];

bool check(int n, int a[], int cur, int x[], int y[])
{
    notPlaced.clear();
    for (int i = 0; i < n; ++i)
    {
        a[i] = b[i];
    }
    for (int i = cur; i >= 0; --i)
    {
        std::swap(a[x[i]], a[y[i]]);
    }

    for (int i = 0; i < n; ++i)
    {
        if (a[i] != i)
            notPlaced.insert(i);
    }

    for (int i = 0; i <= cur; ++i)
    {
        if (notPlaced.size() > 0)
        {
            int first = *(notPlaced.begin());
            int second = a[first];

            std::swap(a[first], a[second]);
            if (a[first] == first)
                notPlaced.erase(first);
            if (a[second] == second)
                notPlaced.erase(second);
        }
        else
        {
            continue;
        }
    }

    if (notPlaced.size() == 0)
        return 1;
    else
        return 0;
}

int findSwapPairs(int n, int a[], int m, int x[], int y[], int xans[], int yans[]) {

    for (int i = 0; i < n; ++i)
    {
        b[i] = a[i];
    }

    int lowest = m;
    int l = 0, r = m - 1;
    while (l <= r)
    {
        int mid = l + (r - l) / 2;

        if (check(n, a, mid, x, y))
        {
            lowest = std::min(lowest, mid);

            r = mid - 1;
        }
        else
        {
            l = mid + 1;
        }
    }
    notPlaced.clear();
    for (int i = 0; i < n; ++i)
    {
        a[i] = b[i];
    }

    for (int i = lowest; i >= 0; --i)
    {
        std::swap(a[x[i]], a[y[i]]);
    }

    for (int i = 0; i < n; ++i)
    {
        if (a[i] != i)
            notPlaced.insert(i);
    }

    for (int i = 0; i <= lowest; ++i)
    {

        if (notPlaced.size() > 0)
        {
            int first = *(notPlaced.begin());
            int second = a[first];

            xans[i] = first;
            yans[i] = second;
            std::swap(a[first], a[second]);
            if (a[first] == first)
                notPlaced.erase(first);
            if (a[second] == second)
                notPlaced.erase(second);
        }
        else
        {
            xans[i] = 0;
            yans[i] = 0;
        }
    }
/*
    std::cout << lowest + 1 << "\n";
    for (int i = 0; i <= lowest; ++i)
    {
        std::cout << xans[i] << " " << yans[i] << "\n";
    }*/

    return lowest + 1;
}

Subtask #1
0 / 8.0

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

Subtask #2
0 / 12.0

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

Subtask #3
0 / 16.0

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

Subtask #4
0 / 18.0

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

Subtask #5
0 / 20.0

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

Subtask #6
0 / 26.0

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