Submission #972746

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
972746	2024-05-01T05:19:18 Z	arush_agu	Hyper-minimum (IZhO11_hyper)	C++17	0 / 100	0 ms	348 KB

hyper

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

#ifdef DEBUG
#include <time.h>
#endif

#define all(a) (a).begin(), (a).end()
#define rev(a) (a).rbegin(), (a).rend()
#define F first
#define S second
int recur_depth = 0;
#ifdef DEBUG
#define dbg(x)                                                                 \
  {                                                                            \
    ++recur_depth;                                                             \
    auto x_ = x;                                                               \
    --recur_depth;                                                             \
    cerr << string(recur_depth, '\t') << "\e[91m" << __func__ << ":"           \
         << __LINE__ << "\t" << #x << " = " << x_ << "\e[39m" << endl;         \
  }
#else
#define dbg(x)
#endif

using namespace std;
using namespace __gnu_pbds;

typedef pair<int, int> ii;

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> llll;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pair<int, int>> vii;
typedef vector<vii> vvii;

typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pair<ll, ll>> vll;
typedef vector<vll> vvll;

typedef vector<bool> vb;

template <class type1>
using ordered_set = tree<type1, null_type, less<type1>, rb_tree_tag,
                         tree_order_statistics_node_update>;

template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) {
  return os << '(' << p.first << ", " << p.second << ')';
}
template <typename T_container, typename T = typename enable_if<
                                    !is_same<T_container, string>::value,
                                    typename T_container::value_type>::type>
ostream &operator<<(ostream &os, const T_container &v) {
  os << '{';
  string sep;
  for (const T &x : v)
    os << sep << x, sep = ", ";
  return os << '}';
}

const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1e9;
const ld EPS = 1e-9;

struct MinQ {
  vii s1, s2;

  void add(int x) {
    int mn = s1.empty() ? x : min(s1.back().second, x);
    s1.push_back({x, mn});
  }

  void pop() {
    if (s1.empty() && s2.empty())
      exit(1729);
    if (s2.empty()) {
      while (!s1.empty()) {
        auto [x, pmn] = s1.back();
        s1.pop_back();
        int mn = s2.empty() ? x : min(pmn, s2.back().second);
        s2.push_back({x, mn});
      }
    }
    s2.pop_back();
  }

  int mn() {
    if (s1.empty() && s2.empty())
      exit(1729);
    if (s1.empty() || s2.empty())
      return s1.empty() ? s2.back().second : s1.back().second;
    return min(s1.back().second, s2.back().second);
  }

  int sz() { return s1.size() + s2.size(); }
};

void solve() {
  int n, m;
  cin >> n >> m;
  int a[n][n][n][n];
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++)
      for (int k = 0; k < n; k++)
        for (int l = 0; l < n; l++)
          cin >> a[i][j][k][l];

  int one[n][n][n][n];
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++)
      for (int k = 0; k < n; k++) {
        MinQ mq;
        for (int l = 0; mq.sz() < m; l++)
          mq.add(a[i][j][k][l]);

        for (int l = 0; l < n; l++) {
          one[i][j][k][l] = mq.mn();

          mq.pop();
          if (l + m < n)
            mq.add(a[i][j][k][l + m]);
        }
      }

  int two[n][n][n][n];
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++)
      for (int l = 0; l < n; l++) {
        MinQ mq;
        for (int k = 0; mq.sz() < m; k++)
          mq.add(one[i][j][k][l]);
        for (int k = 0; k < n; k++) {
          two[i][j][k][l] = mq.mn();

          mq.pop();
          if (k + m < n)
            mq.add(one[i][j][k + m][l]);
        }
      }

  int three[n][n][n][n];
  for (int i = 0; i < n; i++)
    for (int k = 0; k < n; k++)
      for (int l = 0; l < n; l++) {
        MinQ mq;
        for (int j = 0; mq.sz() < m; j++)
          mq.add(two[i][j][k][l]);
        for (int j = 0; j < n; j++) {
          three[i][j][k][l] = mq.mn();

          mq.pop();
          if (j + m < n)
            mq.add(two[i][j + m][k][l]);
        }
      }

  int four[n][n][n][n];
  for (int j = 0; j < n; j++)
    for (int k = 0; k < n; k++)
      for (int l = 0; l < n; l++) {
        MinQ mq;
        for (int i = 0; mq.sz() < m; i++)
          mq.add(three[i][j][k][l]);
        for (int i = 0; i < n; i++) {
          four[i][j][k][l] = mq.mn();

          mq.pop();
          if (i + m < n)
            mq.add(three[i + m][j][k][l]);
        }
      }

  for (int i = 0; i <= n - m; i++)
    for (int j = 0; j <= n - m; j++)
      for (int k = 0; k <= n - m; k++)
        for (int l = 0; l <= n - m; l++)
          cout << four[i][j][k][l] << " ";
  cout << "\n";
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);

  clock_t start = clock();

  int test_cases = 1;
  // cin >> test_cases;

  while (test_cases--)
    solve();

#ifdef DEBUG
  cerr << fixed << setprecision(10)
       << "\nTime Taken: " << (double)(clock() - start) / CLOCKS_PER_SEC
       << "s\n";
#endif
  return 0;
}

Compilation message

hyper.cpp: In function 'int main()':
hyper.cpp:215:11: warning: unused variable 'start' [-Wunused-variable]
  215 |   clock_t start = clock();
      |           ^~~~~

Subtask #1

0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Incorrect	0 ms	348 KB	Output isn't correct
3	Halted	0 ms	0 KB	-