oj.uz

답안 #4573

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
4573 2013-11-03T06:03:12 Z cki86201 보물 찾기 (CEOI13_treasure2) C++
90 / 100
 0 ms 1228 KB 
#include "treasure.h"

//for 80point

int T[105][105];

void solve(int x,int y,int N)
{
	int m=N>>1;
	if(x>=m&&y>=m)T[x][y]=countTreasure(1,1,x,y);
	if(x>=m&&y<m)T[x][y]=T[x][N]-countTreasure(1,y+1,x,N);
	if(x<m&&y>=m)T[x][y]=T[N][y]-countTreasure(x+1,1,N,y);
	if(x<m&&y<m)T[x][y]=T[x][N]+T[N][y]+countTreasure(x+1,y+1,N,N)-T[N][N];
}

void findTreasure (int N) {
	int i,j;
	for(i=N;i;i--)for(j=N;j;j--)solve(i,j,N);
	for(i=1;i<=N;i++)for(j=1;j<=N;j++)if(T[i][j]-T[i-1][j]-T[i][j-1]+T[i-1][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
90.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 1228 KB Output is partially correct - N = 5, K = 326, score = 8
2 Correct 0 ms 1228 KB Output is correct - N = 10, K = 4475, score = 10
3 Incorrect 0 ms 1228 KB Output is partially correct - N = 15, K = 22626, score = 8
4 Correct 0 ms 1228 KB Output is correct - N = 16, K = 28928, score = 10
5 Incorrect 0 ms 1228 KB Output is partially correct - N = 55, K = 4009826, score = 8
6 Correct 0 ms 1228 KB Output is correct - N = 66, K = 8305803, score = 10
7 Incorrect 0 ms 1228 KB Output is partially correct - N = 77, K = 15392054, score = 8
8 Correct 0 ms 1228 KB Output is correct - N = 88, K = 26244416, score = 10
9 Incorrect 0 ms 1228 KB Output is partially correct - N = 99, K = 42046902, score = 8
10 Correct 0 ms 1228 KB Output is correct - N = 100, K = 43760000, score = 10