Submission #106477

#	Time	Username	Problem	Language	Result	Execution time	Memory
106477		luciocf	Treasure (different grader from official contest) (CEOI13_treasure2)	C++14	44 / 100	3 ms	640 KiB

treasure

#include <bits/stdc++.h>
#include "treasure.h"

const int maxn = 110;

int pref[maxn][maxn];

void findTreasure (int N) 
{
	int n = N;

	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++)
			pref[i][j] = countTreasure(1, 1, i, j);

	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= n; j++)
		{
			int ant = pref[i-1][j]+pref[i][j-1]-pref[i-1][j-1];

			if (pref[i][j] == ant+1) Report(i, j);
		}
	}
}

• Subtask 1: 44 / 100