답안 #956240

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
956240 2024-04-01T11:42:51 Z arush_agu 보물 찾기 (CEOI13_treasure2) C++17
100 / 100
3 ms 1116 KB
#include "treasure.h"
#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;

void findTreasure(int N) {
  int n = N;

  // #ifdef DEBUG
  //   cin >> n;
  //   vvi board(n, vi(n));
  //   for (vi &x : board)
  //     for (int &y : x)
  //       cin >> y;
  // #else
  // cin >> n;
  // #endif

  int mid = n / 2;

  int count = 0;
  map<pair<ii, ii>, int> cache;
  auto query = [&](int r1, int c1, int r2, int c2) {
    if (cache.count({{r1, c1}, {r2, c2}}))
      return cache[{{r1, c1}, {r2, c2}}];

    // count += 1 + n * n - (r2 - r1 + 1) * (c2 - c1 + 1);

    int res = countTreasure(r1 + 1, c1 + 1, r2 + 1, c2 + 1);
    // #ifdef DEBUG
    //     for (int i = r1; i <= r2; i++)
    //       for (int j = c1; j <= c2; j++)
    //         res += board[i][j];
    // #else
    // cout << r1 + 1 << " " << c1 + 1 << " " << r2 + 1 << " " << c2 + 1 <<
    // endl; cin >> res; #endif

    return cache[{{r1, c1}, {r2, c2}}] = res;
  };

  vvi tl(n, vi(n, -1)), tr(n, vi(n, -1)), bl(n, vi(n, -1)), br(n, vi(n, -1));

  int total = query(0, 0, n - 1, n - 1);
  for (int i = mid; i < n; i++)
    for (int j = mid; j < n; j++)
      tl[i][j] = query(0, 0, i, j);
  for (int i = mid; i < n; i++)
    for (int j = 0; j <= mid; j++)
      tr[i][j] = query(0, j, i, n - 1);
  for (int i = 0; i <= mid; i++)
    for (int j = mid; j < n; j++)
      bl[i][j] = query(i, 0, n - 1, j);
  for (int i = 0; i <= mid; i++)
    for (int j = 0; j <= mid; j++)
      br[i][j] = query(i, j, n - 1, n - 1);

  // cerr << count << "\n";
  // cerr << fixed << setprecision(10)
  //      << ((ld)(n * n * n * n) * (ld)(7.0 / 16.0) + (ld)(n * n)) << "\n";

  for (int i = n - 1; i >= mid; i--)
    for (int j = mid - 1; j >= 0; j--)
      tl[i][j] = tl[i][n - 1] - tr[i][j + 1];
  for (int i = mid - 1; i >= 0; i--)
    for (int j = n - 1; j >= mid; j--)
      tl[i][j] = tl[n - 1][j] - bl[i + 1][j];
  for (int i = mid - 1; i >= 0; i--)
    for (int j = mid - 1; j >= 0; j--)
      tl[i][j] = total - br[i + 1][0] - br[0][j + 1] + br[i + 1][j + 1];

  // cout << "END" << endl;

  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      int ans = tl[i][j];
      if (i)
        ans -= tl[i - 1][j];
      if (j)
        ans -= tl[i][j - 1];
      if (i && j)
        ans += tl[i - 1][j - 1];

      if (ans)
        Report(i + 1, j + 1);
      // cout << ans;
    }

    // cout << endl;
  }
}

// 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

treasure.cpp: In function 'void findTreasure(int)':
treasure.cpp:108:7: warning: unused variable 'count' [-Wunused-variable]
  108 |   int count = 0;
      |       ^~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct - N = 5, K = 289, score = 10
2 Correct 0 ms 388 KB Output is correct - N = 10, K = 4475, score = 10
3 Correct 0 ms 348 KB Output is correct - N = 15, K = 22289, score = 10
4 Correct 1 ms 348 KB Output is correct - N = 16, K = 28928, score = 10
5 Correct 1 ms 600 KB Output is correct - N = 55, K = 4005289, score = 10
6 Correct 1 ms 604 KB Output is correct - N = 66, K = 8305803, score = 10
7 Correct 2 ms 956 KB Output is correct - N = 77, K = 15383161, score = 10
8 Correct 2 ms 1112 KB Output is correct - N = 88, K = 26244416, score = 10
9 Correct 3 ms 1116 KB Output is correct - N = 99, K = 42032201, score = 10
10 Correct 3 ms 1116 KB Output is correct - N = 100, K = 43760000, score = 10