제출 #234157

#제출 시각아이디문제언어결과실행 시간메모리
234157qaws12Treasure (different grader from official contest) (CEOI13_treasure2)C++98
44 / 100
5 ms384 KiB
#include "treasure.h" #include <iostream> #define MAP 101 int map[MAP][MAP]; void findTreasure(int N) { for (int i = N; i > 0; i-- ) { for (int j = N; j > 0; j-- ) { map[i][j] = countTreasure(1,1, i, j); } } for (int i = N; i > 0; i--) { for (int j = N; j > 0; j--) { int answer = map[i][j] - map[i - 1][j] - map[i][j - 1] + map[i - 1][j - 1]; if (answer == 1) { Report(i, j); } } } }
#Verdict Execution timeMemoryGrader output
Fetching results...