제출 #1058971

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1058971		codexistent	Treasure (different grader from official contest) (CEOI13_treasure2)	C++14	0 / 100	1 ms	604 KiB

treasure

#include "treasure.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MAXN 105
#define FOR(i, a, b) for(ll i = a; i <= b; i++)

ll pfx[MAXN][MAXN];

void findTreasure (int N) {
    ll m = N / 2;
    for(ll i = N; i >= 1; i--){
        for(ll j = N; j >= 1; j--){
            if(i >= m & j >= m) {
                pfx[i][j] = countTreasure(1, 1, N, N);
            } else if(i >= m && j < m){
                pfx[i][j] = pfx[i][N] - countTreasure(1, j + 1, i, N);
            } else if(i < m && j >= m){
                pfx[i][j] = pfx[N][j] = countTreasure(i + 1, 1, N, j);
            } else if(i < m && j < m){
                pfx[i][j] = pfx[N][j] + pfx[i][N] - (pfx[N][N] - countTreasure(i + 1, j + 1, N, N));
            }
        }
    }
    
    FOR(i, 1, N){
        FOR(j, 1, N){
            if(pfx[i][j] - pfx[i - 1][j] - pfx[i][j - 1] + pfx[i - 1][j - 1]){
                Report(i, j);
            }
        }
    }
}

컴파일 시 표준 에러 (stderr) 메시지

treasure.cpp: In function 'void findTreasure(int)':
treasure.cpp:14:18: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
   14 |             if(i >= m & j >= m) {
      |                ~~^~~~

• Subtask 1: 0 / 100