#include "treasure.h"
#include <bits/stdc++.h>
//여기서 부터 Hash 구현
#define MAX_TABLE 121550
typedef struct
{
int key[4];
int data;
}Hash;
Hash tb[MAX_TABLE];
using namespace std;
//#define pb push_back
//#define ii pair<int,int>
int ans[105][105];
int HOR[105], VER[105];
int area, included, line, ri, le;
map< tuple<int, int, int, int>, int > dp;
int askit(int r1, int c1, int r2, int c2) {
tuple<int, int, int, int> tup(r1, c1, r2, c2);
if (dp.find(tup) != dp.end()) return dp[tup];
return dp[tup] = countTreasure(r1, c1, r2, c2);
}
int f(int v, int r, int c, int N) {
int result = 0, knew = 0, red = 0, want = 0;
if (v == 0) {
for (int i = 1; i <= r - 1; i++) {
for (int j = 1; j <= c; j++) {
knew += ans[i][j];
}
}
red = askit(1, 1, r, c);
want = red - knew;
knew = 0;
for (int j = 1; j <= c - 1; j++) knew += ans[r][j];
result = want - knew;
}
else if (v == 1) {
for (int i = 1; i <= r - 1; i++) {
for (int j = c + 1; j <= N; j++) {
knew += ans[i][j];
}
}
if (c + 1 <= N) red = askit(1, c + 1, r, N);
want = red - knew;
result = included - want;
}
else if (v == 2) {
for (int i = 1; i <= r - 1; i++) {
for (int j = c + 1; j <= N; j++) {
knew += ans[i][j];
}
}
knew = ri - knew;
if (c + 1 <= N && r + 1 <= N) red = askit(r + 1, c + 1, N, N);
want = knew - red;
result = included - want;
}
else { // D
for (int i = 1; i <= r - 1; i++) {
for (int j = 1; j <= c; j++) {
knew += ans[i][j];
}
}
knew = le - knew;
if (r + 1 <= N) red = askit(r + 1, 1, N, c);
want = knew - red;
knew = 0;
for (int j = 1; j <= c - 1; j++) knew += ans[r][j];
result = want - knew;
}
return result;
}
void findTreasure(int N) {
//int cnt = countTreasure(1, 1, N, N);
//if(cnt > 0) Report (1, 1);
area = askit(1, 1, N, N);
for (int i = 1; i <= N - 1; i++) {
if (i > (N - i)) VER[i] = askit(1, 1, i, N);
else VER[i] = area - askit(i + 1, 1, N, N);
}
for (int i = 1; i <= N - 1; i++) {
if (i > (N - i)) HOR[i] = askit(1, 1, N, i);
else HOR[i] = area - askit(1, i + 1, N, N);
}
VER[N] = HOR[N] = area;
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
int below = VER[N] - VER[i];
int sup = VER[i - 1];
line = area - sup - below;
included = line;
for (int k = 1; k < j; k++) included -= ans[i][k];
ri = HOR[N] - HOR[j];
le = HOR[j];
//vector< pair<int, int> > srt;
int dx, dy;
int data[4][2];
dx = j, dy = i;
data[0][0] = dx * dy;
data[0][1] = 0;
dx = N - j, dy = i;
data[1][0] = dx * dy;
data[1][1] = 1;
dx = N - j, dy = N - i;
data[2][0] = dx * dy;
data[2][1] = 2;
dx = j, dy = N - i;
data[3][0] = dx * dy;
data[3][1] = 3;
for (int a = 0; a < 4; a++)
{
for (int b = a + 1; b < 4; b++)
{
if (data[a][0] > data[b][0])
{
int temp;
temp = data[a][0];
data[a][0] = data[b][0];
data[b][0] = temp;
temp = data[a][1];
data[a][1] = data[b][1];
data[b][1] = temp;
}
else if (data[a][0] == data[b][0] && data[a][1] > data[b][1])
{
int temp;
temp = data[a][0];
data[a][0] = data[b][0];
data[b][0] = temp;
temp = data[a][1];
data[a][1] = data[b][1];
data[b][1] = temp;
}
}
}
ans[i][j] = f(data[3][1], i, j, N);
}
}
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
if (ans[i][j]) Report(i, j);
}
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct - N = 5, K = 289, score = 10 |
| 2 |
Correct |
1 ms |
364 KB |
Output is correct - N = 10, K = 4475, score = 10 |
| 3 |
Correct |
1 ms |
364 KB |
Output is correct - N = 15, K = 22289, score = 10 |
| 4 |
Correct |
1 ms |
364 KB |
Output is correct - N = 16, K = 28928, score = 10 |
| 5 |
Correct |
5 ms |
620 KB |
Output is correct - N = 55, K = 4005289, score = 10 |
| 6 |
Correct |
8 ms |
620 KB |
Output is correct - N = 66, K = 8305803, score = 10 |
| 7 |
Correct |
13 ms |
748 KB |
Output is correct - N = 77, K = 15383161, score = 10 |
| 8 |
Correct |
21 ms |
876 KB |
Output is correct - N = 88, K = 26244416, score = 10 |
| 9 |
Correct |
30 ms |
1004 KB |
Output is correct - N = 99, K = 42032201, score = 10 |
| 10 |
Correct |
32 ms |
1104 KB |
Output is correct - N = 100, K = 43760000, score = 10 |
