oj.uz

Submission #1042001

# Submission time Handle Problem Language Result Execution time Memory
1042001 2024-08-02T11:59:08 Z c2zi6 Sorting (IOI15_sorting) C++14
74 / 100
 1000 ms 12108 KB 
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<typename T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "sorting.h"

#define ANSWER {\
        rep(i, ans.size()) {\
            P[i] = ans[i].ff;\
            Q[i] = ans[i].ss;\
        }\
        return ans.size();\
    }

struct PERM {
    int n;
    VI a;
    VI ind;
    PERM(int N_ARG) : n(N_ARG) {
        a = ind = VI(n);
        rep(i, n) a[i] = ind[i] = i;
    }
    PERM(VI A_ARG) : a(A_ARG) {
        n = a.size();
        ind = VI(n);
        rep(i, n) ind[a[i]] = i;
    }
    int size() {
        return n;
    }
    int& operator[](const int i) {
        return a[i];
    }
};

PERM operator*(const PERM& perm, const PII p) {
    auto[x, y] = p;
    PERM ret = perm;
    swap(ret.ind[ret[x]], ret.ind[ret[y]]);
    swap(ret[x], ret[y]);
    return ret;
}
void operator*=(PERM& perm, const PII p) {
    auto[x, y] = p;
    swap(perm.ind[perm[x]], perm.ind[perm[y]]);
    swap(perm[x], perm[y]);
}

VPI ret;
bool f(const VI& A_ARG, const VPI& op) {
    PERM a(A_ARG);
    int n = a.size();
    int m = op.size();
    PERM cur(n);
    reprl(i, m-1, 0) cur *= op[i];
    int i = 0;
    for (const PII& p : op) {
        cur *= p;
        a *= p;
        while (i < n && a.ind[i] == cur.ind[i]) i++;
        int x, y;
        if (i == n) {
            x = y = 0;
        } else {
            x = a.ind[i];
            y = cur.ind[i];
        }
        ret.pb({x, y});
        a *= mkp(x, y);
    }
    rep(i, n) if (a[i] != i) return false;
    return true;
}

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
    int n = N;
    int m = min(M, N);
    VI a(n);
    rep(i, n) a[i] = S[i];
    VPI op(m);
    rep(i, m) op[i] = mkp(X[i], Y[i]);

    VPI ans(m+1);

    VPI curop;
    rep(i, m+1) {
        ret.clear();
        if (f(a, curop)) {
            /*cout << "true " << ret.size() << endl;*/
            if (ret.size() < ans.size()) {
                ans = ret;
            }
            ANSWER
        }
        /*else cout << "false " << ret.size() << endl;*/

        if (i == m) break;
        curop.pb(op[i]);
    }
    ANSWER;
}

Compilation message

sorting.cpp: In constructor 'PERM::PERM(VI)':
sorting.cpp:51:19: warning: conversion from 'std::vector<int>::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   51 |         n = a.size();
      |             ~~~~~~^~
sorting.cpp: In function 'PERM operator*(const PERM&, PII)':
sorting.cpp:64:9: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   64 |     auto[x, y] = p;
      |         ^
sorting.cpp: In function 'void operator*=(PERM&, PII)':
sorting.cpp:71:9: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   71 |     auto[x, y] = p;
      |         ^
sorting.cpp: In function 'bool f(const VI&, const VPI&)':
sorting.cpp:80:20: warning: conversion from 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   80 |     int m = op.size();
      |             ~~~~~~~^~
sorting.cpp:98:9: warning: declaration of 'i' shadows a previous local [-Wshadow]
   98 |     rep(i, n) if (a[i] != i) return false;
      |         ^
sorting.cpp:9:28: note: in definition of macro 'rep'
    9 | #define rep(i, n) for (int i = 0; i < int(n); ++i)
      |                            ^
sorting.cpp:83:9: note: shadowed declaration is here
   83 |     int i = 0;
      |         ^
sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:35:13: warning: declaration of 'i' shadows a previous local [-Wshadow]
   35 |         rep(i, ans.size()) {\
      |             ^
sorting.cpp:9:28: note: in definition of macro 'rep'
    9 | #define rep(i, n) for (int i = 0; i < int(n); ++i)
      |                            ^
sorting.cpp:120:13: note: in expansion of macro 'ANSWER'
  120 |             ANSWER
      |             ^~~~~~
sorting.cpp:113:9: note: shadowed declaration is here
  113 |     rep(i, m+1) {
      |         ^
sorting.cpp:9:28: note: in definition of macro 'rep'
    9 | #define rep(i, n) for (int i = 0; i < int(n); ++i)
      |                            ^
sorting.cpp:39:24: warning: conversion from 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   39 |         return ans.size();\
      |                ~~~~~~~~^~
sorting.cpp:120:13: note: in expansion of macro 'ANSWER'
  120 |             ANSWER
      |             ^~~~~~
sorting.cpp:39:24: warning: conversion from 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   39 |         return ans.size();\
      |                ~~~~~~~~^~
sorting.cpp:127:5: note: in expansion of macro 'ANSWER'
  127 |     ANSWER;
      |     ^~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
16.0 / 16.0

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

Subtask #4
18.0 / 18.0

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

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 652 KB Output is correct
2 Correct 32 ms 592 KB Output is correct
3 Correct 27 ms 604 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 12 ms 604 KB Output is correct
8 Correct 29 ms 604 KB Output is correct
9 Correct 30 ms 604 KB Output is correct
10 Correct 31 ms 604 KB Output is correct
11 Correct 25 ms 620 KB Output is correct
12 Correct 13 ms 604 KB Output is correct
13 Correct 33 ms 604 KB Output is correct
14 Correct 0 ms 344 KB Output is correct

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 652 KB Output is correct
2 Correct 32 ms 592 KB Output is correct
3 Correct 27 ms 604 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 12 ms 604 KB Output is correct
8 Correct 29 ms 604 KB Output is correct
9 Correct 30 ms 604 KB Output is correct
10 Correct 31 ms 604 KB Output is correct
11 Correct 25 ms 620 KB Output is correct
12 Correct 13 ms 604 KB Output is correct
13 Correct 33 ms 604 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Execution timed out 1030 ms 12108 KB Time limit exceeded
16 Halted 0 ms 0 KB -