제출 #634587

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
634587		LittleCube	Team Contest (JOI22_team)	C++14	27 / 100	278 ms	108204 KiB

team

#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define F first
#define S second
using namespace std;

int N, arr[303][303][303], ans = -1;



signed main()
{
	cin >> N;
	for(int i = 1; i <= N; i++)
	{
		int x, y, z;
		cin >> x >> y >> z;
		arr[x][y][z] = 1;
	}
	const int C = 300;
	for(int i = 1; i <= C; i++)
	   	for(int j = 1; j <= C; j++)
	   		for(int k = 1; k <= C; k++)
		 		arr[i][j][k] = arr[i][j][k] +
							   arr[i - 1][j][k] + arr[i][j - 1][k] + arr[i][j][k - 1] +
						   	  -arr[i - 1][j - 1][k] - arr[i - 1][j][k - 1] - arr[i][j - 1][k - 1] +
					   		   arr[i - 1][j - 1][k - 1];
	for(int i = 1; i <= C; i++)
	   	for(int j = 1; j <= C; j++)
	   		for(int k = 1; k <= C; k++)
				if(arr[i][j - 1][k - 1] - arr[i - 1][j - 1][k - 1] > 0 &&
				   arr[i - 1][j][k - 1] - arr[i - 1][j - 1][k - 1] > 0 &&
				   arr[i - 1][j - 1][k] - arr[i - 1][j - 1][k - 1] > 0)
					ans = max(ans, i + j + k);


	cout << ans << '\n';
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 29
• Subtask 3: 9 / 9
• Subtask 4: 9 / 9
• Subtask 5: 9 / 9
• Subtask 6: 0 / 9
• Subtask 7: 0 / 27