oj.uz

답안 #1058989

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1058989 2024-08-14T15:45:09 Z codexistent 보물 찾기 (CEOI13_treasure2) C++14
100 / 100
 0 ms 348 KB 
#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(i, 0, N) FOR(j, 0, N) pfx[i][j] = 0;
    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, i, j);
            } 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);
            }
        }
    }
}

Compilation message

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

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct - N = 5, K = 289, score = 10
2 Correct 0 ms 348 KB Output is correct - N = 10, K = 4475, score = 10
3 Correct 0 ms 348 KB Output is correct - N = 15, K = 22289, score = 10
4 Correct 0 ms 348 KB Output is correct - N = 16, K = 28928, score = 10
5 Correct 0 ms 348 KB Output is correct - N = 55, K = 4005289, score = 10
6 Correct 0 ms 348 KB Output is correct - N = 66, K = 8305803, score = 10
7 Correct 0 ms 348 KB Output is correct - N = 77, K = 15383161, score = 10
8 Correct 0 ms 348 KB Output is correct - N = 88, K = 26244416, score = 10
9 Correct 0 ms 348 KB Output is correct - N = 99, K = 42032201, score = 10
10 Correct 0 ms 348 KB Output is correct - N = 100, K = 43760000, score = 10