oj.uz

Submission #316483

# Submission time Handle Problem Language Result Execution time Memory
316483 2020-10-26T12:46:59 Z mohamedsobhi777 Sorting (IOI15_sorting) C++14
74 / 100
 921 ms 15096 KB 
#include <bits/stdc++.h>
#include "sorting.h"

using namespace std;
const int _N = 1e5;

int n;
int s[_N], _s[_N];
int x[_N], y[_N];
int nxt[_N];

int check()
{
        int ret = 0;
        map<int, int> vis;
        memset(nxt, -1, sizeof nxt);
        for (int i = 0; i < n; ++i)
        {
                nxt[i] = s[i];
        }
        for (int i = 0; i < n; ++i)
        {
                int cnt = 1;
                int cur = nxt[i];
                if (vis[i])
                        continue;
                while (cur != i)
                {
                        vis[cur]++;
                        cur = nxt[cur];
                        ++cnt;
                }
                vis[cur]++;
                ret += --cnt;
        }
        return ret;
}
vector<pair<int, int>> ans, ans2;

void solve(int X)
{

        memset(nxt, -1, sizeof nxt);
        for (int i = 0; i < n; ++i)
        {
                nxt[i] = s[i];
        }

        map<int, int> vis;
        for (int i = 0; i < n; ++i)
        {
                if (vis[i])
                        continue;
                int cur = nxt[i];
                while (cur != i)
                {
                        ++vis[cur];
                        ans.push_back({i, cur});
                        cur = nxt[cur];
                }
                ++vis[cur];
        }
        while (ans.size() < X)
        {
                ans.push_back({0, 0});
        }
        ans2.resize(X);

        for (int i = 0; i < X; ++i)
        {
                int rep[n + 1];
                for (int j = 0; j < n; ++j)
                        rep[j] = j;
                for (int j = i + 1; j < X; ++j)
                {
                        swap(rep[x[j]], rep[y[j]]);
                }
                ans2[i] = {rep[ans[i].first], rep[ans[i].second]};
                swap(rep[x[i]], rep[y[i]]);
        }
        for (int i = 0; i < X; ++i)
        {
                swap(_s[x[i]], _s[y[i]]);
                swap(_s[ans2[i].first], _s[ans2[i].second]);
        }
        for (int i = 0; i < n; ++i)
        {
                //cout << _s[i] << " ";
        }
}

void print()
{
        for (int i = 0; i < n; ++i)
        {
                cout << s[i] << " ";
        }
        cout << "-----------\n";
}

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[])
{
        n = N;
        for (int i = 0; i < N; ++i)
        {
                s[i] = S[i];
                _s[i] = S[i];
        }
        if (check() == 0)
        {
                return 0;
        }

        for (int i = 0; i < M; ++i)
        {
                x[i] = X[i];
                y[i] = Y[i];
                swap(s[X[i]], s[Y[i]]);
                if (check() <= i + 1)
                {
                        solve(i + 1);
                        for (int j = 0; j <= i; ++j)
                        {
                                P[j] = ans2[j].first;
                                Q[j] = ans2[j].second;
                        }
                        return ++i;
                }
        }

        //assert(0);
        return 0;
}

Compilation message

sorting.cpp: In function 'void solve(int)':
sorting.cpp:63:27: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   63 |         while (ans.size() < X)
      |                ~~~~~~~~~~~^~~

Subtask #1
8.0 / 8.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
16.0 / 16.0

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

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 1 ms 768 KB Output is correct
3 Correct 1 ms 768 KB Output is correct
4 Correct 1 ms 768 KB Output is correct
5 Correct 1 ms 768 KB Output is correct
6 Correct 1 ms 768 KB Output is correct
7 Correct 1 ms 768 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 1 ms 768 KB Output is correct
10 Correct 4 ms 768 KB Output is correct
11 Correct 3 ms 768 KB Output is correct
12 Correct 3 ms 768 KB Output is correct
13 Correct 1 ms 768 KB Output is correct
14 Correct 1 ms 768 KB Output is correct
15 Correct 3 ms 768 KB Output is correct
16 Correct 3 ms 768 KB Output is correct
17 Correct 3 ms 768 KB Output is correct
18 Correct 1 ms 768 KB Output is correct
19 Correct 1 ms 768 KB Output is correct
20 Correct 1 ms 768 KB Output is correct
21 Correct 52 ms 1024 KB Output is correct
22 Correct 52 ms 1024 KB Output is correct
23 Correct 55 ms 1172 KB Output is correct
24 Correct 46 ms 1024 KB Output is correct
25 Correct 16 ms 1024 KB Output is correct
26 Correct 27 ms 1024 KB Output is correct
27 Correct 46 ms 1024 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 782 ms 1016 KB Output is correct
2 Correct 921 ms 1272 KB Output is correct
3 Correct 828 ms 1272 KB Output is correct
4 Correct 2 ms 896 KB Output is correct
5 Correct 46 ms 1016 KB Output is correct
6 Correct 135 ms 1016 KB Output is correct
7 Correct 450 ms 1024 KB Output is correct
8 Correct 868 ms 1144 KB Output is correct
9 Correct 900 ms 1144 KB Output is correct
10 Correct 901 ms 992 KB Output is correct
11 Correct 800 ms 1272 KB Output is correct
12 Correct 450 ms 1016 KB Output is correct
13 Correct 833 ms 1016 KB Output is correct
14 Correct 2 ms 896 KB Output is correct

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 782 ms 1016 KB Output is correct
2 Correct 921 ms 1272 KB Output is correct
3 Correct 828 ms 1272 KB Output is correct
4 Correct 2 ms 896 KB Output is correct
5 Correct 46 ms 1016 KB Output is correct
6 Correct 135 ms 1016 KB Output is correct
7 Correct 450 ms 1024 KB Output is correct
8 Correct 868 ms 1144 KB Output is correct
9 Correct 900 ms 1144 KB Output is correct
10 Correct 901 ms 992 KB Output is correct
11 Correct 800 ms 1272 KB Output is correct
12 Correct 450 ms 1016 KB Output is correct
13 Correct 833 ms 1016 KB Output is correct
14 Correct 2 ms 896 KB Output is correct
15 Runtime error 48 ms 15096 KB Execution killed with signal 11 (could be triggered by violating memory limits)
16 Halted 0 ms 0 KB -