Submission #277128

#	Time	Username	Problem	Language	Result	Execution time	Memory
277128		Marlov	Treasure (different grader from official contest) (CEOI13_treasure2)	C++14	0 / 100	1 ms	592 KiB

treasure

/*
Code by @marlov       
*/
#include "treasure.h"

#define maxN 105

int N;
int grid[maxN][maxN];

void bs(int x1,int y1,int x2,int y2){
    if(x1==x2||y1==y2) return;
    int num=countTreasure(x1+1,y1+1,x2,y2);
    if(num==0) return;
    if(num==((x2-x1)*(y2-y1))){
        for(int i=x1;x1<x2;i++){
            for(int j=y1;y1<y2;j++){
                grid[i][j]=1;
            }
        }
        return;
    }
    bs(x1,y1,(x1+x2)/2,(y1+y2)/2);
    bs((x1+x2)/2,y1,x2,(y1+y2)/2);
    bs(x1,(y1+y2)/2,(x1+x2)/2,y2);
    bs((x1+x2)/2,(y1+y2)/2,x2,y2);
}

void findTreasure(int gN){
//	ios_base::sync_with_stdio(0); cin.tie(0);
    N=gN;
    bs(0,0,N,N);
    for(int i=0;i<N;i++){ 
        for(int j=0;j<N;j++){
            if(grid[i][j]==1) Report(i+1,j+1);
        }
    }
}

/* stuff you should look for
	* int overflow, array bounds
	* special cases (n=1,n=0?)
	* do smth instead of nothing and stay organized
*/

• Subtask 1: 0 / 100