제출 #119325

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
119325		minhtung0404	보물 찾기 (CEOI13_treasure2)	C++17	69 / 100	3 ms	512 KiB

treasure

//https://oj.uz/problem/view/CEOI13_treasure2

#include<bits/stdc++.h>
#include "treasure.h"
const int N = 105;
using namespace std;

int n, sum[N][N], ans[N][N], cnt;

int ask(int r1, int c1, int r2, int c2){
    if (r1 > r2) swap(r1, r2);
    if (c1 > c2) swap(c1, c2);
    return countTreasure(r1, c1, r2, c2);
}

void findTreasure(int n){
    int half = n / 2;
    for (int i = half; i <= n; i++) for (int j = half; j <= n; j++) sum[i][j] = ask(1, 1, i, j);
    for (int i = half+1; i <= n; i++) for (int j = half+1; j <= n; j++) ans[i][j] = sum[i][j] - sum[i-1][j] - sum[i][j-1] + sum[i-1][j-1];

    for (int i = half; i <= n; i++) for (int j = 1; j <= half+1; j++) sum[i][j] = ask(1, n, i, j);
    for (int i = half+1; i <= n; i++) for (int j = 1; j <= half; j++) ans[i][j] = sum[i][j] - sum[i-1][j] - sum[i][j+1] + sum[i-1][j+1];

    for (int i = 1; i <= half+1; i++) for (int j = half; j <= n; j++) sum[i][j] = ask(n, 1, i, j);
    for (int i = 1; i <= half; i++) for (int j = half+1; j <= n; j++) ans[i][j] = sum[i][j] - sum[i+1][j] - sum[i][j-1] + sum[i+1][j-1];

    for (int i = 1; i <= half+1; i++) for (int j = 1; j <= half+1; j++) sum[i][j] = ask(n, n, i, j);
    for (int i = 1; i <= half; i++) for (int j = 1; j <= half; j++) ans[i][j] = sum[i][j] - sum[i+1][j] - sum[i][j+1] + sum[i+1][j+1];
    for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) if (ans[i][j]) Report(i, j);
//    cout << (cnt <= 7 * n * n * n * n / 16 + n * n);
}

• Subtask 1: 69 / 100