제출 #100393

#제출 시각아이디문제언어결과실행 시간메모리
100393Anai보물 찾기 (CEOI13_treasure2)C++14
44 / 100
3 ms384 KiB
#include "treasure.h" using namespace std; const int N = 105; int mx[N][N]; static int ask(int l1, int c1, int l2, int c2) { return countTreasure(l1, c1, l2, c2); } void findTreasure(int n){ for (int i = 1; i <= n; ++i) for (int j = 1; j <= n; ++j) mx[i][j] = ask(1, 1, i, j); for (int i = 1; i <= n; ++i) for (int j = 1; j <= n; ++j) if (mx[i][j] - mx[i - 1][j] - mx[i][j - 1] + mx[i - 1][j - 1] > 0) Report(i, j); }
#Verdict Execution timeMemoryGrader output
Fetching results...