Submission #40819

#TimeUsernameProblemLanguageResultExecution timeMemory
40819esspks21Treasure (different grader from official contest) (CEOI13_treasure2)C++14
100 / 100
2 ms784 KiB
#include "treasure.h" #include <vector> using namespace std; struct pos { int r, c; }; vector<pos> vt; int psum[101][101]; // 1 2 // 3 4 void findTreasure(int N) { pos temp; // 4사분면 for (int i = N; i > N / 2; i--) for (int j = N; j > N / 2; j--) psum[i][j] = countTreasure(1, 1, i, j); // 2사분면 for (int i = 1; i <= N / 2; i++) for (int j = N / 2 + 1; j <= N; j++) psum[i][j] = psum[N][j] - countTreasure(i+1, 1, N, j); // 3사분면 for (int i = N / 2 + 1; i <= N; i++) for (int j = 1; j <= N / 2; j++) psum[i][j] = psum[i][N] - countTreasure(1, j+1, i, N); // 1사분면 for (int i = 1; i <= N / 2; i++) for (int j = 1; j <= N / 2; j++) psum[i][j] = psum[i][N] + psum[N][j] - psum[N][N] + countTreasure(i+1, j+1, N, N); //for (int i = 1; i <= N; i++) { // for (int j = 1; j <= N; j++) { // cout << psum[i][j] << " "; // } // cout << endl; //} for (int i = 1; i <= N; i++) { for (int j = 1; j <= N; j++) { int tmp; if (i == 1 && j == 1) tmp = psum[i][j]; else if (i == 1 && j != 1) tmp = psum[i][j] - psum[i][j - 1]; else if (i != 1 && j == 1) tmp = psum[i][j] - psum[i - 1][j]; else tmp = psum[i][j] - psum[i - 1][j] - psum[i][j - 1] + psum[i - 1][j - 1]; if (tmp == 1) { temp.r = i; temp.c = j; vt.push_back(temp); } } } for (int i = 0; i < vt.size(); i++) Report(vt[i].r, vt[i].c); return; }

Compilation message (stderr)

grader.c: In function 'int main()':
grader.c:63:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         my_assert(strlen(A[i]+1) == N, "each line of the map must contain N zeroes or ones (before loop)");
                                  ^
treasure.cpp: In function 'void findTreasure(int)':
treasure.cpp:52:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < vt.size(); i++)
                    ^
#Verdict Execution timeMemoryGrader output
Fetching results...