oj.uz

Submission #41227

# Submission time Handle Problem Language Result Execution time Memory
41227 2018-02-14T05:36:25 Z wzy Treasure (different grader from official contest) (CEOI13_treasure2) C++14
46 / 100
 2 ms 476 KB 
#include "treasure.h"
using namespace std;
#define min(a,b) a < b ? a : b
#define max(a,b) a > b ? a : b
bool ans[110][110];
 int n;




int solve(int x1 , int x2 , int y1 , int y2){
	int p = countTreasure(x1, y1 , x2 , y2);
	int pz = p;
	if(p == 0){
		return p ;
	}
	else{
		if(p == (x2 - x1 + 1)*(y2 - y1 + 1)){
			for(int i = x1 ; i <= x2 ; i++){
				for(int j = y1 ; j <= y2 ; j++) ans[i][j]=1;
			}
			return  p;
		}
		else{
			int midx = (x1+x2)/2 , midy = (y1 + y2)/2;
			if(x1 <= midx){
				if(y1 <= midy ) pz -= solve(x1 , midx , y1 , midy);
				if(y2 > midy && pz)	pz -=solve(x1, midx , midy + 1 , y2);
			}
			if(x2 > midx){
					if(p == (x2 - x1 + 1)*(y2 - y1 + 1)){
						for(int i = midx + 1 ; i <= x2 ; i++){
							for(int j = y1 ; j <= y2 ; j++) ans[i][j]=1;
					}
				return  p;
			}
				if(y1 <= midy && pz) pz -= solve(midx + 1 , x2, y1 , midy);
				if(y2 > midy && pz){
					if(pz == (x2 - midx)*(y2 - midy)){
						for(int i =midx + 1 ;  i<= x2 ; i++)
							for(int j = midy + 1  ; j <= y2; j++) ans[i][j] = true;
							return p;
					}
					pz -= solve(midx + 1 , x2 , midy + 1 , y2);
				}
			}
		}
	}
	return p;
}


void findTreasure (int N) {
	n = N;
	solve(1 , N , 1 , N);
   for(int i = 1 ; i <= N ; i++){
   		for(int j = 1 ; j <= N ; j++){
   			if(ans[i][j]==1) Report(i,j);
   		}
   }
}

Compilation message

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)");
                                  ^

Subtask #1
46.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 248 KB Output is partially correct - N = 5, K = 546, score = 1
2 Partially correct 1 ms 352 KB Output is partially correct - N = 10, K = 8089, score = 1
3 Correct 1 ms 428 KB Output is correct - N = 15, K = 20196, score = 10
4 Correct 1 ms 440 KB Output is correct - N = 16, K = 20170, score = 10
5 Partially correct 2 ms 440 KB Output is partially correct - N = 55, K = 8217381, score = 1
6 Partially correct 2 ms 440 KB Output is partially correct - N = 66, K = 17582026, score = 1
7 Correct 1 ms 440 KB Output is correct - N = 77, K = 7104922, score = 10
8 Correct 2 ms 440 KB Output is correct - N = 88, K = 9131905, score = 10
9 Partially correct 2 ms 440 KB Output is partially correct - N = 99, K = 85323443, score = 1
10 Partially correct 2 ms 476 KB Output is partially correct - N = 100, K = 90325760, score = 1