oj.uz

답안 #546224

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
546224 2022-04-06T16:53:55 Z sidon 보물 찾기 (CEOI13_treasure2) C++17
100 / 100
 1 ms 340 KB 
#include <bits/stdc++.h>
#include "treasure.h"
using namespace std;

void findTreasure(int N) {
	int a[N+1][N+1] {};

	for(int i = N + 1; --i; ) for(int j = N + 1; --j; ) {
		int b[4] = {i * j, j * (N - i), i * (N - j), (N - i) * (N - j)}, k = max_element(b, b + 4) - b;
		if(k == 0) a[i][j] = countTreasure(1, 1, i, j);
		if(k == 1) a[i][j] = a[N][j] - countTreasure(i + 1, 1, N, j);
		if(k == 2) a[i][j] = a[i][N] - countTreasure(1, j + 1, i, N);
		if(k == 3) a[i][j] = countTreasure(i + 1, j + 1, N, N) + a[i][N] + a[N][j] - a[N][N];
	}

	for(int i = N + 1; --i; ) for(int j = N + 1; --j; )
		if(a[i][j] - a[i-1][j] - a[i][j-1] + a[i-1][j-1]) Report(i, j);
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct - N = 5, K = 289, score = 10
2 Correct 1 ms 212 KB Output is correct - N = 10, K = 4475, score = 10
3 Correct 0 ms 212 KB Output is correct - N = 15, K = 22289, score = 10
4 Correct 0 ms 212 KB Output is correct - N = 16, K = 28928, score = 10
5 Correct 1 ms 340 KB Output is correct - N = 55, K = 4005289, score = 10
6 Correct 1 ms 340 KB Output is correct - N = 66, K = 8305803, score = 10
7 Correct 1 ms 340 KB Output is correct - N = 77, K = 15383161, score = 10
8 Correct 1 ms 340 KB Output is correct - N = 88, K = 26244416, score = 10
9 Correct 1 ms 340 KB Output is correct - N = 99, K = 42032201, score = 10
10 Correct 1 ms 340 KB Output is correct - N = 100, K = 43760000, score = 10