oj.uz

답안 #59242

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
59242 2018-07-21T10:05:42 Z zadrga 보물 찾기 (CEOI13_treasure2) C++14
100 / 100
 4 ms 708 KB 
// 12.00
#include "treasure.h"
#include <bits/stdc++.h>
 
using namespace std;
 
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF (1LL << 55)
#define MOD (1000 * 1000 * 1000 + 7)
#define maxn 111

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pii;

int pre[maxn][maxn];


void findTreasure(int N){
	int n = N;
	int mid = n / 2;

	for(int i = n; i >= 1; i--){
		for(int j = n; j >= 1; j--){
			if(i > mid && j > mid)
				pre[i][j] = countTreasure(1, 1, i, j);

			if(i <= mid && j > mid)
				pre[i][j] = pre[n][j] - countTreasure(i + 1, 1, n, j);
			
			if(i > mid && j <= mid)
				pre[i][j] = pre[i][n] - countTreasure(1, j + 1, i, n);
			
			if(i <= mid && j <= mid)
				pre[i][j] = -pre[n][n] + pre[n][j] + pre[i][n] + countTreasure(i + 1, j + 1, n, n);
		}
	}

	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= n; j++){
			if(pre[i][j] - pre[i - 1][j] - pre[i][j - 1] + pre[i - 1][j - 1] == 1)
				Report(i, j);
		}
	}   		
}

Subtask #1
100.0 / 100.0

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