#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <stack>
#include <map>
#include <queue>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cstring>
#include <cmath>
#include <functional>
#include <cassert>
#include <iomanip>
#include <numeric>
#include <bitset>
#include <sstream>
#include <chrono>
#include <random>
#define ff first
#define ss second
#define PB push_back
#define sz(x) int(x.size())
#define rsz resize
#define fch(xxx, yyy) for (auto xxx : yyy) // abusive notation
#define all(x) (x).begin(),(x).end()
#define eps 1e-9
// more abusive notation (use at your own risk):
//#define int ll
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
// debugging
void __print(int x) {std::cerr << x;}
void __print(ll x) {std::cerr << x;} /* remember to uncomment this when not using THE MACRO */
void __print(unsigned x) {std::cerr << x;}
void __print(ull x) {std::cerr << x;}
void __print(float x) {std::cerr << x;}
void __print(double x) {std::cerr << x;}
void __print(ld x) {std::cerr << x;}
void __print(char x) {std::cerr << '\'' << x << '\'';}
void __print(const char *x) {std::cerr << '\"' << x << '\"';}
void __print(const string& x) {std::cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V> void __print(const pair<T, V> &x) {std::cerr << '{'; __print(x.ff); std::cerr << ", "; __print(x.ss); std::cerr << '}';}
template<typename T> void __print(const T& x) {int f = 0; std::cerr << '{'; for (auto &i: x) std::cerr << (f++ ? ", " : ""), __print(i); std::cerr << "}";}
void _print() {std::cerr << "]\n";}
template <typename T, typename... V> void _print(T t, V... v) {__print(t); if (sizeof...(v)) std::cerr << ", "; _print(v...);}
void println() {std::cerr << ">--------------------<" << endl;}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
// templates
template <class T> bool ckmin(T &a, const T &b) {return b<a ? a = b, 1 : 0;}
template <class T> bool ckmax(T &a, const T &b) {return b>a ? a = b, 1 : 0;}
template <class T> using gr = greater<T>;
template <class T> using vc = vector<T>;
template <class T> using p_q = priority_queue<T>;
template <class T> using pqg = priority_queue<T, vc<T>, gr<T>>;
template <class T1, class T2> using pr = pair<T1, T2>;
mt19937_64 rng_ll(chrono::steady_clock::now().time_since_epoch().count());
int rng(int M) {return (int)(rng_ll()%M);} /*returns any random number in [0, M) */
// const variables
constexpr int INF = (int)2e9;
constexpr int MOD = 998244353;
constexpr ll LL_INF = (ll)3e18;
constexpr int mod = (int)1e9 + 7;
constexpr ll inverse = 500000004LL; // inverse of 2 modulo 1e9 + 7
void setIO(const string& str) {// fast input/output
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
if (str.empty()) return;
freopen((str + ".in").c_str(), "r", stdin);
freopen((str + ".out").c_str(), "w", stdout);
}
#include "treasure.h"
int N, mid;
int topleft[105][105], topright[105][105], bottomleft[105][105], bottomright[105][105];
int answer[101][101];
void findTreasure(int n) {
N = n;
mid = N/2;
for (int i = 1; i <= mid+1; ++i) {
for (int j = 1; j <= mid+1; ++j) {
topleft[i][j] = countTreasure(i, j, N, N);
}
}
for (int i = 1; i <= mid+1; ++i) {
for (int j = mid; j <= N; ++j) {
topright[i][j] = countTreasure(i, 1, N, j);
}
}
for (int i = mid; i <= N; ++i) {
for (int j = 1; j <= mid+1; ++j) {
bottomleft[i][j] = countTreasure(1, j, i, N);
}
}
for (int i = mid; i <= N; ++i) {
for (int j = mid; j <= N; ++j) {
bottomright[i][j] = countTreasure(1, 1, i, j);
}
}
for (int i = mid; i >= 1; --i) {
for (int j = mid; j >= 1; --j) {
int amount = topleft[i][j] - topleft[i+1][j] - topleft[i][j+1] + topleft[i+1][j+1];
if (amount) answer[i][j] = 1;
}
}
for (int i = 1; i <= mid; ++i) {
for (int j = mid+1; j <= N; ++j) {
int amount = topright[i][j] - topright[i][j-1] - topright[i+1][j] + topright[i+1][j-1];
if (amount) answer[i][j] = 1;
}
}
for (int i = mid+1; i <= N; ++i) {
for (int j = 1; j <= mid; ++j) {
int amount = bottomleft[i][j] - bottomleft[i-1][j] - bottomleft[i][j+1] + bottomleft[i-1][j+1];
if (amount) answer[i][j] = 1;
}
}
for (int i = mid+1; i <= N; ++i) {
for (int j = mid+1; j <= N; ++j) {
int amount = bottomright[i][j] - bottomright[i-1][j] - bottomright[i][j-1] + bottomright[i-1][j-1];
if (amount) answer[i][j] = 1;
}
}
for (int i = 1; i <= N; ++i) {
for (int j = 1; j <= N; ++j) {
if (answer[i][j]) Report(i, j);
}
}
}
/*
signed main() { // TIME YOURSELF !!!
setIO("");
}
*/
// TLE -> TRY NOT USING DEFINE INT LONG LONG
// CE -> CHECK LINE 45
// 5000 * 5000 size matrices are kinda big (potential mle)
// Do something, start simpler
Compilation message
treasure.cpp: In function 'void setIO(const string&)':
treasure.cpp:88:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
88 | freopen((str + ".in").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
treasure.cpp:89:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
89 | freopen((str + ".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Partially correct |
0 ms |
348 KB |
Output is partially correct - N = 5, K = 598, score = 1 |
| 2 |
Partially correct |
1 ms |
428 KB |
Output is partially correct - N = 10, K = 6444, score = 4 |
| 3 |
Partially correct |
0 ms |
348 KB |
Output is partially correct - N = 15, K = 28833, score = 8 |
| 4 |
Partially correct |
0 ms |
348 KB |
Output is partially correct - N = 16, K = 36612, score = 8 |
| 5 |
Partially correct |
0 ms |
348 KB |
Output is partially correct - N = 55, K = 4304273, score = 8 |
| 6 |
Partially correct |
0 ms |
348 KB |
Output is partially correct - N = 66, K = 8816812, score = 8 |
| 7 |
Partially correct |
0 ms |
604 KB |
Output is partially correct - N = 77, K = 16197286, score = 8 |
| 8 |
Partially correct |
0 ms |
604 KB |
Output is partially correct - N = 88, K = 27450900, score = 8 |
| 9 |
Partially correct |
0 ms |
604 KB |
Output is partially correct - N = 99, K = 43755201, score = 8 |
| 10 |
Partially correct |
0 ms |
604 KB |
Output is partially correct - N = 100, K = 45527904, score = 8 |
