제출 #383936

#제출 시각아이디문제언어결과실행 시간메모리
383936wp1270보물 찾기 (CEOI13_treasure2)C++11
100 / 100
2 ms364 KiB
#include "treasure.h" int t[102][102]; void findTreasure(int N) { int center = N / 2; for (int i = center + 1; i <= N; i++) { for (int j = center + 1; j <= N; j++) { t[i][j] = countTreasure(1, 1, i, j); } } for (int i = center + 1; i <= N; i++) { for (int j = 1; j <= center; j++) { t[i][j] = t[i][N] - countTreasure(1, j + 1, i, N); } } for (int i = 1; i <= center; i++) { for (int j = center + 1; j <= N; j++) { t[i][j] = t[N][j] - countTreasure(i + 1, 1, N, j); } } for (int i = 1; i <= center; i++) { for (int j = 1; j <= center; j++) { t[i][j] = t[N][j] + t[i][N] + countTreasure(i + 1, j + 1, N, N) - t[N][N]; } } for (int i = 1; i <= N; i++) { for (int j = 1; j <= N; j++) { if (t[i][j] - t[i - 1][j] - t[i][j - 1] + t[i - 1][j - 1]) { Report(i, j); } } } } /* 10 1011010101 1100010001 0100100101 0000101100 1111010100 0010100000 1101010001 0001010100 0101000100 1101010101 */
#Verdict Execution timeMemoryGrader output
Fetching results...