oj.uz

Submission #316568

# Submission time Handle Problem Language Result Execution time Memory
316568 2020-10-26T16:47:58 Z mohamedsobhi777 Sorting (IOI15_sorting) C++14
74 / 100
 1000 ms 9336 KB 
#include <bits/stdc++.h>
#include "sorting.h"

using namespace std;
const int _N = 2e5;

int n, m;
int s[_N], _s[_N];
int x[_N], y[_N];
int t;
int viz[_N];
int Nxt[_N];
int cyc = 0;
int pos[_N];
int rep[_N];

int cycles()
{
        ++t;
        int ret = 0;
        for (int i = 0; i < n; ++i)
        {
                int cnt = 1;
                int cur = Nxt[i];
                if (viz[i] == t)
                        continue;
                ++ret;
                while (cur != i)
                {
                        viz[cur] = t;
                        cur = Nxt[cur];
                        ++cnt;
                }
                viz[cur] = t;
        }
        return ret;
}
vector<pair<int, int>> ans, ans2;

void solve(int X)
{
        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 < n; ++i)
                pos[s[i]] = i;

        for (int i = 0; i < X; ++i)
        {
                int x1 = pos[_s[x[i]]];
                int x2 = pos[_s[y[i]]];
                swap(rep[x1], rep[x2]);
                ans2[i] = {rep[ans[i].first], rep[ans[i].second]};
                swap(_s[x[i]], _s[y[i]]);
        }
}

bool can(int mid)
{
        int nxt[_N];
        for (int i = 0; i < n; ++i)
                nxt[i] = s[i];
        for (int j = 0; j < mid; ++j)
                swap(nxt[x[j]], nxt[y[j]]);
        ++t;
        int ret = 0;
        for (int i = 0; i < n; ++i)
        {
                int cur = nxt[i];
                if (viz[i] == t)
                        continue;
                ++ret;
                while (cur != i)
                {
                        viz[cur] = t;
                        cur = nxt[cur];
                }
                viz[cur] = t;
        }
        return n - ret <= mid;
}

int binary_sr4()
{
        int ret = m;
        int lo = 1, hi = m;
        while (lo <= hi)
        {
                int mid = (lo + hi) >> 1;
                if (can(mid))
                        hi = mid - 1, ret = mid;
                else
                        lo = mid + 1;
        }
        return ret;
}

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[])
{
        n = N;
        m = M;
        for (int i = 0; i < N; ++i)
        {
                Nxt[i] = S[i];
                s[i] = S[i];
                _s[i] = S[i];
                rep[i] = i;
        }
        cyc = cycles();
        if (n - cyc == 0)
                return 0;
        int opt = binary_sr4();
        bool conv = 0;
        for (int i = 1; i < M; ++i)
        {
                if (can(i))
                        conv = 1;
                assert(can(i) == conv);
        }
        for (int i = 0; i < M; ++i)
        {
                x[i] = X[i];
                y[i] = Y[i];
                swap(s[X[i]], s[Y[i]]);
                swap(rep[X[i]], rep[Y[i]]);
                swap(Nxt[X[i]], Nxt[Y[i]]);
                if (n - cycles() <= i + 1)
                {
                        assert(opt != M);
                        solve(i + 1);
                        for (int j = 0; j <= i; ++j)
                        {
                                P[j] = ans2[j].first;
                                Q[j] = ans2[j].second;
                        }
                        return ++i;
                }
        }
        return 0;
}

Compilation message

sorting.cpp: In function 'void solve(int)':
sorting.cpp:56: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]
   56 |         while (ans.size() < X)
      |                ~~~~~~~~~~~^~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 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 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 34 ms 384 KB Output is correct
11 Correct 36 ms 384 KB Output is correct
12 Correct 34 ms 384 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 33 ms 428 KB Output is correct
4 Correct 30 ms 384 KB Output is correct
5 Correct 35 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 34 ms 384 KB Output is correct
11 Correct 36 ms 384 KB Output is correct
12 Correct 34 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 33 ms 428 KB Output is correct
16 Correct 30 ms 384 KB Output is correct
17 Correct 35 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 799 ms 536 KB Output is correct
22 Correct 791 ms 632 KB Output is correct
23 Correct 855 ms 632 KB Output is correct
24 Correct 789 ms 632 KB Output is correct
25 Correct 831 ms 632 KB Output is correct
26 Correct 754 ms 632 KB Output is correct
27 Correct 745 ms 532 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 197 ms 760 KB Output is correct
2 Correct 231 ms 632 KB Output is correct
3 Correct 208 ms 632 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 172 ms 504 KB Output is correct
6 Correct 160 ms 504 KB Output is correct
7 Correct 179 ms 628 KB Output is correct
8 Correct 218 ms 624 KB Output is correct
9 Correct 225 ms 632 KB Output is correct
10 Correct 229 ms 632 KB Output is correct
11 Correct 224 ms 632 KB Output is correct
12 Correct 175 ms 760 KB Output is correct
13 Correct 178 ms 632 KB Output is correct
14 Correct 154 ms 504 KB Output is correct

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 197 ms 760 KB Output is correct
2 Correct 231 ms 632 KB Output is correct
3 Correct 208 ms 632 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 172 ms 504 KB Output is correct
6 Correct 160 ms 504 KB Output is correct
7 Correct 179 ms 628 KB Output is correct
8 Correct 218 ms 624 KB Output is correct
9 Correct 225 ms 632 KB Output is correct
10 Correct 229 ms 632 KB Output is correct
11 Correct 224 ms 632 KB Output is correct
12 Correct 175 ms 760 KB Output is correct
13 Correct 178 ms 632 KB Output is correct
14 Correct 154 ms 504 KB Output is correct
15 Execution timed out 1092 ms 9336 KB Time limit exceeded
16 Halted 0 ms 0 KB -