제출 #78345

#제출 시각아이디문제언어결과실행 시간메모리
78345win11905보물 찾기 (CEOI13_treasure2)C++11
44 / 100
3 ms708 KiB
#include "treasure.h"
#include <bits/stdc++.h>
using namespace std;


int ans[105][105];
bool have[105][105];

void findTreasure (int N) {
    int m = N >> 1;
    for(int i = m; i <= N; ++i) for(int j = 1; j <= N; ++j) ans[i][j] = countTreasure(1, 1, i, j);
    for(int i = m+1; i <= N; ++i) for(int j = 1; j <= N; ++j) have[i][j] = ans[i][j] - ans[i-1][j] - ans[i][j-1] + ans[i-1][j-1];
    for(int i = 1; i <= m+1; ++i) for(int j = 1; j <= N; ++j) ans[i][j] = countTreasure(i, j, N, N);
    for(int i = 1; i <= m; ++i) for(int j = 1; j <= N; ++j) have[i][j] = ans[i][j] - ans[i+1][j] - ans[i][j+1] + ans[i+1][j+1];
    for(int i = 1; i <= N; ++i) for(int j = 1; j <= N; ++j) if(have[i][j]) Report(i, j);
}
#Verdict Execution timeMemoryGrader output
Fetching results...