oj.uz

답안 #41036

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
41036 2018-02-12T06:44:03 Z haro199 보물 찾기 (CEOI13_treasure2) C
44 / 100
 2 ms 564 KB 
int myMap[105][105];

void findTreasure(int N) {
	//countTreasure(1, 1, N, N);	SEARCH
	//Report(2, 1);					REPORT
	for (int i = 1; i <= N; i++) {
		for (int j = 1; j <= N; j++) {
			myMap[i][j] = countTreasure(1, 1, i, j);
		}
	}
	for (int i = 1; i <= N; i++) {
		for (int j = 1; j <= N; j++) {
			if (myMap[i-1][j]+myMap[i][j-1] - myMap[i-1][j-1] + 1 == myMap[i][j]) 
				Report(i, j);
		}
	}
}

Compilation message

treasure.c: In function 'findTreasure':
treasure.c:8:18: warning: implicit declaration of function 'countTreasure' [-Wimplicit-function-declaration]
    myMap[i][j] = countTreasure(1, 1, i, j);
                  ^
treasure.c:14:5: warning: implicit declaration of function 'Report' [-Wimplicit-function-declaration]
     Report(i, j);
     ^

Subtask #1
44.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 2 ms 252 KB Output is partially correct - N = 5, K = 425, score = 8
2 Partially correct 2 ms 352 KB Output is partially correct - N = 10, K = 7075, score = 4
3 Partially correct 1 ms 468 KB Output is partially correct - N = 15, K = 36450, score = 4
4 Partially correct 2 ms 468 KB Output is partially correct - N = 16, K = 47296, score = 4
5 Partially correct 1 ms 468 KB Output is partially correct - N = 55, K = 6782050, score = 4
6 Partially correct 2 ms 496 KB Output is partially correct - N = 66, K = 14090571, score = 4
7 Partially correct 2 ms 564 KB Output is partially correct - N = 77, K = 26140961, score = 4
8 Partially correct 2 ms 564 KB Output is partially correct - N = 88, K = 44642224, score = 4
9 Partially correct 2 ms 564 KB Output is partially correct - N = 99, K = 71566902, score = 4
10 Partially correct 2 ms 564 KB Output is partially correct - N = 100, K = 74507500, score = 4