Submission #241568

#	Time	Username	Problem	Language	Result	Execution time	Memory
241568		Mercenary	Treasure (different grader from official contest) (CEOI13_treasure2)	C++14	0 / 100	5 ms	512 KiB

treasure

#include "treasure.h"
#include<bits/stdc++.h>
using namespace std;
const int maxn = 105;

int n, sum[maxn][maxn];

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){
                sum[i][j] = countTreasure(1,1,i,j);
            }else if(i > N / 2 && j <= N / 2){
                sum[i][j] = sum[i][N] - countTreasure(1 , j + 1 , i , N);
            }else if(i <= N / 2 && j > N / 2){
                sum[i][j] = sum[N][j] - countTreasure(i + 1 , 1 , N , j);
            }else{
                sum[i][j] = sum[i][N] + sum[N][j] - sum[N][N] - countTreasure(i + 1 , j + 1 , N , N);
            }
        }
    }
    for(int i = 1 ; i <= N ; ++i){
        for(int j = 1 ; j <= N ; ++j){
            if(sum[i][j] - sum[i - 1][j] - sum[i][j - 1] + sum[i - 1][j - 1]){
                Report(i , j);
            }
        }
    }
}

• Subtask 1: 0 / 100