oj.uz

Submission #78747

# Submission time Handle Problem Language Result Execution time Memory
78747 2018-10-08T10:32:26 Z Plurm Treasure (different grader from official contest) (CEOI13_treasure2) C++11
100 / 100
 3 ms 672 KB 
#include <bits/stdc++.h>
#include "treasure.h"
using namespace std;
int dp[128][128];
int query(int a,int b,int c,int d,int N){
	if(a > c || b > d || a == 0 || b == 0 || c == 0 || d == 0 || a == N+1 || b == N+1 || c == N+1 || d == N+1) return 0;
	return countTreasure(a,b,c,d);
}
void findTreasure(int N){
	for(int i = N; i > 0; i--){
		for(int j = N; j > 0; j--){
			if(i > N/2 && j > N/2){
				dp[i][j] = query(1,1,i,j,N);
			}else if(i > N/2 && j <= N/2){
				dp[i][j] = dp[i][N] - query(1,j+1,i,N,N);
			}else if(i <= N/2 && j > N/2){
				dp[i][j] = dp[N][j] - query(i+1,1,N,j,N);
			}else{
				dp[i][j] = query(i+1,j+1,N,N,N) + dp[N][j] + dp[i][N] - dp[N][N];
			}
		}
	}
	for(int i = 1; i <= N; i++){
		for(int j = 1; j <= N; j++){
			if(dp[i][j] - dp[i-1][j] - dp[i][j-1] + dp[i-1][j-1] == 1){
				Report(i,j);
			}
		}
	}
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct - N = 5, K = 289, score = 10
2 Correct 2 ms 456 KB Output is correct - N = 10, K = 4475, score = 10
3 Correct 2 ms 456 KB Output is correct - N = 15, K = 22289, score = 10
4 Correct 2 ms 456 KB Output is correct - N = 16, K = 28928, score = 10
5 Correct 2 ms 552 KB Output is correct - N = 55, K = 4005289, score = 10
6 Correct 3 ms 604 KB Output is correct - N = 66, K = 8305803, score = 10
7 Correct 2 ms 672 KB Output is correct - N = 77, K = 15383161, score = 10
8 Correct 2 ms 672 KB Output is correct - N = 88, K = 26244416, score = 10
9 Correct 2 ms 672 KB Output is correct - N = 99, K = 42032201, score = 10
10 Correct 2 ms 672 KB Output is correct - N = 100, K = 43760000, score = 10