oj.uz

Submission #432504

# Submission time Handle Problem Language Result Execution time Memory
432504 2021-06-18T10:47:27 Z snasibov05 Sorting (IOI15_sorting) C++14
36 / 100
 1000 ms 76824 KB 
#include "sorting.h"
#include <vector>
#include <cassert>
#include <algorithm>

using namespace std;

#define pii pair<int, int>
#define f first
#define s second
#define pb push_back

int findSwapPairs(int n, int s[], int m, int x[], int y[], int p[], int q[]) {

    vector<vector<int>> v(m+1, vector<int>(n));
    vector<vector<int>> idx(m+1, vector<int>(n));
    for (int i = 0; i < n; ++i) {
        v[0][i] = s[i];
        idx[0][s[i]] = i;
    }

    if (is_sorted(v[0].begin(), v[0].end())) return 0;

    for (int i = 1; i <= m; ++i) {
        v[i] = v[i-1];
        idx[i] = idx[i-1];
        swap(idx[i][v[i][x[i-1]]], idx[i][v[i][y[i-1]]]);
        swap(v[i][x[i-1]], v[i][y[i-1]]);

        vector<int> final = idx[i];
        vector<int> arr = v[i];
        vector<pii> swaps;

        for (int j = 0; j < n; ++j) {
            if (final[j] == j) continue;
            int k = final[j];
            swaps.pb({j, k});
            final[arr[j]] = k;
            arr[k] = arr[j];
            arr[j] = j;
        }

        if (swaps.size() > i) continue;

        arr = v[i];

        for (int j = 0; j < m; ++j) {
            p[i] = q[i] = 0;
        }

        int k = swaps.size();
        for (int l = 1; l <= k; ++l){
            if (is_sorted(v[l].begin(), v[l].end())) return l;

            int a = idx[l][arr[swaps[l-1].f]];
            int b = idx[l][arr[swaps[l-1].s]];
            p[l-1] = a, q[l-1] = b;
            swap(idx[l][arr[swaps[l-1].f]], idx[l][arr[swaps[l-1].s]]);
            swap(v[l][a], v[l][b]);
            swap(arr[swaps[l-1].f], arr[swaps[l-1].s]);

            if (is_sorted(v[l].begin(), v[l].end())) return l;

            for (int j = l+1; j <= m; ++j) {
                v[j] = v[j-1];
                idx[j] = idx[j-1];
                swap(idx[j][v[j][x[j-1]]], idx[j][v[j][y[j-1]]]);
                swap(v[j][x[j-1]], v[j][y[j-1]]);
            }
        }

        return i;
    }

    assert(false);

}

Compilation message

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:43:26: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   43 |         if (swaps.size() > i) continue;
      |             ~~~~~~~~~~~~~^~~
sorting.cpp:51:27: warning: conversion from 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   51 |         int k = swaps.size();
      |                 ~~~~~~~~~~^~

Subtask #1
8.0 / 8.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 21 ms 2636 KB Output is correct
11 Correct 22 ms 2876 KB Output is correct
12 Correct 22 ms 2636 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 21 ms 2716 KB Output is correct
4 Correct 21 ms 2764 KB Output is correct
5 Correct 22 ms 2764 KB Output is correct
6 Correct 0 ms 204 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 21 ms 2636 KB Output is correct
11 Correct 22 ms 2876 KB Output is correct
12 Correct 22 ms 2636 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 21 ms 2716 KB Output is correct
16 Correct 21 ms 2764 KB Output is correct
17 Correct 22 ms 2764 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Execution timed out 1085 ms 55820 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1093 ms 76824 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1093 ms 76824 KB Time limit exceeded
2 Halted 0 ms 0 KB -