oj.uz

Submission #379600

# Submission time Handle Problem Language Result Execution time Memory
379600 2021-03-18T19:41:48 Z idk321 Sorting (IOI15_sorting) C++11
74 / 100
 1000 ms 15940 KB 
#include "sorting.h"

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int n, m;
int* s;
int* x;
int* y;
int* q;
int* p;

bool isOk(int r)
{
    vector<int> change(n);
    for (int i = 0; i < n; i++) change[i] = i;
    for (int i = 0; i <= r; i++)
    {
        swap(change[x[i]], change[y[i]]);
    }
    vector<int> needed(n);
    for (int i = 0; i < n; i++)
    {
        needed[change[i]] = i;
    }

    vector<int> cur(s, s + n);

    vector<int> isOn(n);
    for (int i = 0; i < n; i++)
    {
        isOn[cur[i]] = i;
    }

    int check = 0;
    for (int i = 0; i <= r; i++)
    {
        swap(cur[x[i]], cur[y[i]]);
        swap(needed[x[i]], needed[y[i]]);
        isOn[cur[x[i]]] = x[i];
        isOn[cur[y[i]]] = y[i];


        while (check < n)
        {
            if (check != needed[isOn[check]])
            {
                int a = isOn[check];
                int b = isOn[needed[isOn[check]]];
                swap(cur[a], cur[b]);
                isOn[cur[a]] = a;
                isOn[cur[b]] = b;
                p[i] = a;
                q[i] = b;
                break;
            }

            check++;
        }


    }



    for (int i = 1; i < n; i++)
    {
        if (cur[i] < cur[i - 1]) return false;
    }
    return true;
}

int bs()
{
    int from = 0;
    int to = m - 1;
    int res = -1;

    while (from <= to)
    {
        int mid = (from + to) / 2;

        if (isOk(mid))
        {
            res = mid;
            to = mid - 1;
        } else
        {
            from = mid + 1;
        }
    }

    return res;
}


int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
    n = N;
    m = M;
    s = S;
    x = X;
    y = Y;
    p = P;
    q = Q;

    bool alreadyGood = true;
    for (int i = 1; i < n; i++)
    {
        if (s[i] < s[i - 1]) alreadyGood = false;
    }

    if (alreadyGood) return 0;


    int best = -1;
    for (int i = 0; i < m; i++)
    {
        if (isOk(i))
        {
            best = i + 1;
            break;
        }
    }




	return best;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 384 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 0 ms 364 KB Output is correct
19 Correct 0 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 7 ms 492 KB Output is correct
22 Correct 7 ms 492 KB Output is correct
23 Correct 8 ms 492 KB Output is correct
24 Correct 7 ms 492 KB Output is correct
25 Correct 2 ms 492 KB Output is correct
26 Correct 4 ms 492 KB Output is correct
27 Correct 8 ms 492 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 364 KB Output is correct
2 Correct 107 ms 492 KB Output is correct
3 Correct 86 ms 492 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 4 ms 492 KB Output is correct
6 Correct 12 ms 492 KB Output is correct
7 Correct 46 ms 492 KB Output is correct
8 Correct 102 ms 492 KB Output is correct
9 Correct 100 ms 492 KB Output is correct
10 Correct 102 ms 492 KB Output is correct
11 Correct 86 ms 620 KB Output is correct
12 Correct 46 ms 492 KB Output is correct
13 Correct 113 ms 492 KB Output is correct
14 Correct 1 ms 492 KB Output is correct

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 364 KB Output is correct
2 Correct 107 ms 492 KB Output is correct
3 Correct 86 ms 492 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 4 ms 492 KB Output is correct
6 Correct 12 ms 492 KB Output is correct
7 Correct 46 ms 492 KB Output is correct
8 Correct 102 ms 492 KB Output is correct
9 Correct 100 ms 492 KB Output is correct
10 Correct 102 ms 492 KB Output is correct
11 Correct 86 ms 620 KB Output is correct
12 Correct 46 ms 492 KB Output is correct
13 Correct 113 ms 492 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Execution timed out 1093 ms 15940 KB Time limit exceeded
16 Halted 0 ms 0 KB -