oj.uz

답안 #659204

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
659204 2022-11-17T01:38:11 Z as111 보물 찾기 (CEOI13_treasure2) C++14
35 / 100
 1 ms 340 KB 
#include "treasure.h"
#include <iostream>

#define MAXN 100

using namespace std;
int ps[MAXN + 5][MAXN + 5]; // partial sum # treasure
int ans[MAXN + 5][MAXN + 5];
void findTreasure(int N) {
	ps[N][N] = countTreasure(1, 1, N, N);
	for (int r = N; r >= 2; r--) {
		for (int c = N; c >= 2; c--) {
			if (!ps[r][c - 1]) {
				ps[r][c - 1] = countTreasure(1, 1, r, c - 1);
			}
			if (!ps[r - 1][c - 1]) {
				ps[r - 1][c - 1] = countTreasure(1, 1, r - 1, c - 1);
			}
			if (!ps[r - 1][c]) {
				ps[r - 1][c] = countTreasure(1, 1, r - 1, c);
			}
			ans[r][c] = ps[r][c] - ps[r - 1][c] - ps[r][c - 1] + ps[r - 1][c - 1];
		}
	}
	for (int r = N; r >= 1; r--) {
		ans[r][1] = ps[r][2] - ps[r - 1][2] - ans[r][2];
	}
	for (int c = N; c >= 1; c--) {
		ans[1][c] = ps[2][c] - ps[2][c-1] - ans[2][c];
	}

	for (int r = 1; r <= N; r++) {
		for (int c = 1; c <= N; c++) {
			if (ans[r][c]) Report(r, c);
		}
	}
}

Subtask #1
35.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 212 KB Output is partially correct - N = 5, K = 425, score = 8
2 Partially correct 1 ms 340 KB Output is partially correct - N = 10, K = 7075, score = 4
3 Partially correct 0 ms 212 KB Output is partially correct - N = 15, K = 38663, score = 1
4 Partially correct 0 ms 212 KB Output is partially correct - N = 16, K = 64486, score = 1
5 Partially correct 0 ms 340 KB Output is partially correct - N = 55, K = 6782050, score = 4
6 Partially correct 1 ms 340 KB Output is partially correct - N = 66, K = 14094926, score = 4
7 Partially correct 0 ms 340 KB Output is partially correct - N = 77, K = 26630182, score = 1
8 Partially correct 1 ms 340 KB Output is partially correct - N = 88, K = 44642224, score = 4
9 Partially correct 1 ms 340 KB Output is partially correct - N = 99, K = 71566902, score = 4
10 Partially correct 1 ms 340 KB Output is partially correct - N = 100, K = 74507500, score = 4