Submission #1229752

#	Time	Username	Problem	Language	Result	Execution time	Memory
1229752		santi3223	Soccer Stadium (IOI23_soccer)	C++20	6 / 100	189 ms	31768 KiB

soccer

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vb vector<bool>
#define pb push_back
#define ff(aa, bb, cc) for(ll aa = bb; aa < cc; aa++)
#define vl vector<ll>
#define pll pair<ll, ll>
#define fi first
#define se second
#define ed "\n"
#define all(aaa) aaa.begin(), aaa.end()
#define rall(aaa) aaa.rbegin(), aaa.rend()
ll MOD = 998244353;

int biggest_stadium(int n, vector<vector<int>> f){
	ll q = 0, xp = 0, yp = 0;
	ff(i, 0, n){
		ff(j, 0, n){
			if(f[i][j] == 1){
				q++;
				yp = i;
				xp = j;
			}
		}
	}
	if(q == 1){
		ll minn = (xp+1)*(yp+1);
		minn = min(minn, (n-xp)*(yp+1));
		minn = min(minn, (xp+1)*(n-yp));
		minn = min(minn, (n-xp)*(n-yp));
		return (n*n)-minn;
	}
	return n*n;
}
/*
int main(){
	int n;
	cin >> n;
	vector<vector<int>> arr(n, vector<int>(n));
	ff(i, 0, n){
		ff(j, 0, n){
			cin >> arr[i][j];
		}
	}
	cout << biggest_stadium(n, arr);
}

*/

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