oj.uz

Submission #342889

# Submission time Handle Problem Language Result Execution time Memory
342889 2021-01-03T07:03:55 Z chon Treasure (different grader from official contest) (CEOI13_treasure2) C++14
100 / 100
 38 ms 1004 KB 
#include "treasure.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ii pair<int,int>
 
int ans[105][105];
int HOR[105], VER[105];
int area, included, line, ri, le;
 
map< tuple<int, int, int, int>, int > dp;
 
int askit(int r1, int c1, int r2, int c2){
	tuple<int,int,int,int> tup(r1, c1, r2, c2);
	if (dp.find(tup) != dp.end() ) return dp[tup];
	return dp[tup] = countTreasure(r1, c1, r2, c2);
}
 
int f(vector< pair<int,int> > v, int r, int c, int N){
	int result = 0, knew = 0, red = 0, want = 0;
	if (v[3].second == 'A'){
		for (int i=1; i<=r-1; i++){
			for (int j=1; j<=c; j++){
				knew += ans[i][j];
			}
		}
		red = askit(1, 1, r, c);
		want = red - knew;
 
		knew = 0;
		for (int j=1; j<=c - 1; j++) knew += ans[r][j];
		result = want - knew;
	}else if (v[3].second == 'B'){
		for (int i=1; i<=r-1; i++){
			for (int j=c+1; j<=N; j++){
				knew += ans[i][j];
			}
		}
		if (c+1 <= N) red = askit(1, c+1, r, N);
		want = red - knew;
 
	    result = included - want;
	}else if (v[3].second == 'C'){
		for (int i=1; i<=r-1; i++){
			for (int j=c+1; j<=N; j++){
				knew += ans[i][j];
			}
		}
		knew = ri - knew;
		if (c+1 <= N && r+1 <= N) red = askit(r+1, c+1, N, N);
 
		want = knew - red;
		result = included - want;
	}else{ // D
		for (int i=1; i<=r-1; i++){
			for (int j=1; j<=c; j++){
				knew += ans[i][j];
			}
		}
		knew = le - knew;
		if (r+1 <= N) red = askit(r+1, 1, N, c);
 
		want = knew - red;
		knew = 0;
		for (int j=1; j<=c - 1; j++) knew += ans[r][j];
		result = want - knew;
	}
	return result;
}
 
void findTreasure (int N) {
    //int cnt = countTreasure(1, 1, N, N);
    //if(cnt > 0) Report (1, 1);
	area = askit(1, 1, N, N);
	for (int i=1; i<=N - 1; i++){
		if ( i > (N-i) ) VER[i] = askit(1, 1, i, N);
		else VER[i] = area - askit(i+1, 1, N, N);
	}
	for (int i=1; i<=N - 1; i++){
		if ( i > (N-i) ) HOR[i] = askit(1, 1, N, i);
		else HOR[i] = area - askit(1, i+1, N, N);
	}
	VER[N] = HOR[N] = area;
	
	for (int i=1; i<=N; i++){
		for (int j=1; j<=N; j++){
			int below = VER[N] - VER[i];
			int sup = VER[i-1];
			line = area - sup - below;
			
			included = line;
			for (int k=1; k<j; k++) included -= ans[i][k];
			
			ri = HOR[N] - HOR[j];
			le = HOR[j];
 
			vector< pair<int, int> > srt;
			int dx, dy;
			dx = j, dy = i;
			srt.pb(ii(dx*dy, 'A'));
			dx = N - j, dy = i;
			srt.pb(ii(dx*dy, 'B'));
			dx = N - j, dy = N - i;
			srt.pb(ii(dx*dy, 'C'));
			dx = j, dy = N - i;
			srt.pb(ii(dx*dy, 'D'));
 
			sort(srt.begin(), srt.end());
		    ans[i][j] = f(srt, i, j, N);
		}
	}
 
	for (int i=1; i<=N; i++){
		for (int j=1; j<=N; j++){
			if (ans[i][j]) Report(i,j);
		}
	}
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct - N = 5, K = 289, score = 10
2 Correct 1 ms 364 KB Output is correct - N = 10, K = 4475, score = 10
3 Correct 1 ms 364 KB Output is correct - N = 15, K = 22289, score = 10
4 Correct 1 ms 364 KB Output is correct - N = 16, K = 28928, score = 10
5 Correct 6 ms 640 KB Output is correct - N = 55, K = 4005289, score = 10
6 Correct 8 ms 620 KB Output is correct - N = 66, K = 8305803, score = 10
7 Correct 14 ms 768 KB Output is correct - N = 77, K = 15383161, score = 10
8 Correct 22 ms 876 KB Output is correct - N = 88, K = 26244416, score = 10
9 Correct 32 ms 1004 KB Output is correct - N = 99, K = 42032201, score = 10
10 Correct 38 ms 1004 KB Output is correct - N = 100, K = 43760000, score = 10