Submission #1233736

#	Time	Username	Problem	Language	Result	Execution time	Memory
1233736		nikulid	축구 경기장 (IOI23_soccer)	C++20	1.50 / 100	182 ms	31756 KiB

soccer

#include "soccer.h"

using namespace std;

#define pb push_back
#define mp make_pair

// (y,x)

int biggest_stadium(int n, vector<vector<int>> f){
	pair<int, int> tree = mp(-1,-1);
	for(int y=0; y<n; y++){
		for(int x=0; x<n; x++){
			if(f[y][x]){
				tree = mp(y,x);
			}
		}
	}
	if(tree.first==-1){
		return n*n;
	}
	int dy,dx;
	dy = min(tree.first, n-1-tree.first)+1;
	dx = min(tree.second, n-1-tree.second)+1;
	return n*n - min(dy,dx)*min(dy,dx);
}

• Subtask 0: 0 / 0
• Subtask 1: 1.5 / 6
• Subtask 2: 0 / 8
• Subtask 3: 0 / 22
• Subtask 4: 0 / 18
• Subtask 5: 0 / 16
• Subtask 6: 0 / 30