제출 #246370

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

treasure

#include <bits/stdc++.h>
#include "treasure.h"
using namespace std;

void findTreasure (int n) {
    int ps1[n][n];
    int ps2[n][n];
    int ps3[n][n];
    int ps4[n][n];
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (i>=n/2-1&&j>=n/2-1) ps1[i][j] = countTreasure(1, 1, i+1, j+1);
            if (i<n/2+1&&j<n/2+1) ps2[i][j] = countTreasure(i+1, j+1, n, n);
            if (i<n/2+1&&j>=n/2-1) ps3[i][j] = countTreasure(i+1,1,n,j+1);
            if (i>=n/2-1&&j<n/2+1) ps4[i][j] = countTreasure(1,j+1,i+1,n);
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (i>=n/2&&j>=n/2) {
                if (ps1[i][j]-ps1[i-1][j]-ps1[i][j-1]+ps1[i-1][j-1] == 1) Report(i+1,j+1);
            } else if (i<n/2&&j<n/2) {
                if (ps2[i][j] - ps2[i+1][j] - ps2[i][j+1] + ps2[i+1][j+1] == 1) Report(i+1, j+1);
            } else if (i<n/2&&j>=n/2) {
                if (ps3[i][j] - ps3[i+1][j] - ps3[i][j-1] + ps3[i+1][j-1] == 1) Report(i+1,j+1);
            } else if (i>=n/2&&j<n/2) {
                if (ps4[i][j] - ps4[i-1][j] - ps4[i][j+1] + ps4[i-1][j+1] == 1) Report(i+1,j+1);
            } else assert(false);
            /*
            if (i>=n/2&&j>=n/2) {
                if (ps[i][j]-(i-1>=n/2?ps[i-1][j]:0)-(j-1>=n/2?ps[i][j-1]:0)+(i-1>=n/2&&j-1>=n/2?ps[i-1][j-1]:0) == 1) Report(i+1,j+1);
            } else if (i<n/2&&j<n/2) {
                if (ps[i][j] - (i+1<n/2?ps[i+1][j]:0) - (j+1<n/2?ps[i][j+1]:0) + (i+1<n/2&&j+1<n/2?ps[i+1][j+1]:0) == 1) Report(i+1, j+1);
            } else if (i<n/2&&j>=n/2) {
                if (ps[i][j] - (i+1<n/2?ps[i+1][j]:0) - (j-1>=n/2?ps[i][j-1]:0) + (i+1<n/2&&j-1>=n/2?ps[i+1][j-1]:0) == 1) Report(i+1,j+1);
            } else if (i>=n/2&&j<n/2) {
                if (ps[i][j] - (i-1>=n/2?ps[i-1][j]:0) - (j+1<n/2?ps[i][j+1]:0) + (i-1>=n/2&&j+1<n/2?ps[i-1][j+1]:0) == 1) Report(i+1,j+1);
            } else assert(false);
            */
        }
    }
}

• Subtask 1: 69 / 100