제출 #852014

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
852014		denniskim	축구 경기장 (IOI23_soccer)	C++17	1.50 / 100	235 ms	47440 KiB

soccer

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

using namespace std;
typedef int ll;
typedef __int128 lll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pld;
#define MAX 9223372036854775807LL
#define MIN -9223372036854775807LL
#define INF 987654321
#define fi first
#define se second
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cout << fixed; cout.precision(10);
#define sp << " "
#define en << "\n"
#define compress(v) sort(v.begin(), v.end()), v.erase(unique(v.begin(), v.end()), v.end())

ll n;
ll a[2010][2010];

ll biggest_stadium(ll N, vector<vector<ll> > F)
{
	n = N;
	
	for(ll i = 1 ; i <= n ; i++)
	{
		for(ll j = 1 ; j <= n ; j++)
			a[i][j] = F[i - 1][j - 1];
	}
	
	ll ans = 0;
	
	for(ll i = 1 ; i <= n ; i++)
	{
		for(ll j = 1 ; j <= n ; j++)
		{
			if(a[i][j] == 0)
				ans++;
		}
	}
	
	for(ll i = 1 ; i <= n ; i++)
	{
		ll minn = INF, maxx = -INF;
		
		for(ll j = 1 ; j <= n ; j++)
		{
			if(a[i][j] == 0)
			{
				minn = min(minn, j);
				maxx = max(maxx, j);
			}
		}
		
		if(minn == INF)
			continue;
		
		for(ll j = minn + 1 ; j < maxx ; j++)
		{
			if(a[i][j] == 1)
				return 5000 - ans;
		}
	}
	
	for(ll j = 1 ; j <= n ; j++)
	{
		ll minn = INF, maxx = -INF;
		
		for(ll i = 1 ; i <= n ; i++)
		{
			if(a[i][j] == 0)
			{
				minn = min(minn, i);
				maxx = max(maxx, i);
			}
		}
		
		if(minn == INF)
			continue;
		
		for(ll i = minn + 1 ; i < maxx ; i++)
		{
			if(a[i][j] == 1)
				return 5000 - ans;
		}
	}
	
	return ans;
}

• 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