oj.uz

Submission #321257

# Submission time Handle Problem Language Result Execution time Memory
321257 2020-11-11T18:19:47 Z monus1042 Treasure (different grader from official contest) (CEOI13_treasure2) C++17
80 / 100
 29 ms 512 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;

int askit(int r1, int c1, int r2, int c2){
	return 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
80.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 512 KB Output is partially correct - N = 5, K = 358, score = 8
2 Partially correct 1 ms 364 KB Output is partially correct - N = 10, K = 4994, score = 8
3 Partially correct 1 ms 364 KB Output is partially correct - N = 15, K = 23998, score = 8
4 Partially correct 1 ms 364 KB Output is partially correct - N = 16, K = 31007, score = 8
5 Partially correct 4 ms 364 KB Output is partially correct - N = 55, K = 4088558, score = 8
6 Partially correct 7 ms 364 KB Output is partially correct - N = 66, K = 8449682, score = 8
7 Partially correct 12 ms 364 KB Output is partially correct - N = 77, K = 15611542, score = 8
8 Partially correct 19 ms 364 KB Output is partially correct - N = 88, K = 26585327, score = 8
9 Partially correct 29 ms 492 KB Output is partially correct - N = 99, K = 42517498, score = 8
10 Partially correct 29 ms 492 KB Output is partially correct - N = 100, K = 44260199, score = 8