제출 #97627

#제출 시각아이디문제언어결과실행 시간메모리
97627dalgerokTreasure (different grader from official contest) (CEOI13_treasure2)C++17
100 / 100
3 ms512 KiB
#include "treasure.h" #include<bits/stdc++.h> using namespace std; int pref[101][101]; void findTreasure(int n){ for(int i = n; i >= 1; i--){ for(int j = n; j >= 1; j--){ if(i <= n / 2 && j <= n / 2){ pref[i][j] = pref[n][j] + pref[i][n] - pref[n][n] + countTreasure(i + 1, j + 1, n, n); } else if(i <= n / 2){ pref[i][j] = pref[n][j] - countTreasure(i + 1, 1, n, j); } else if(j <= n / 2){ pref[i][j] = pref[i][n] - countTreasure(1, j + 1, i, n); } else{ pref[i][j] = countTreasure(1, 1, i, j); } } } for(int i = 1; i <= n; i++){ for(int j = 1; j <= n; j++){ if(pref[i][j] - pref[i - 1][j] - pref[i][j - 1] + pref[i - 1][j - 1] == 1){ Report(i, j); } } } }
#Verdict Execution timeMemoryGrader output
Fetching results...