제출 #847179

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
847179		iskhakkutbilim	축구 경기장 (IOI23_soccer)	C++17	13.50 / 100	4562 ms	79700 KiB

soccer

#include "soccer.h"
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second

int n;
vector< vector<int> > a;
vector<vector<int> > R, C;
/*
5
1 1 1 1 1
1 1 1 1 1
1 0 0 0 1
1 0 0 0 1
1 0 1 0 1
*/

/*
5
1 0 0 0 0
1 0 0 0 0
0 0 0 0 0
0 0 0 0 0
1 1 1 0 0

*/

int counter(int i, int j, int x, int y){
	int c = 0;
	while(i >= 0 && i < n && j < n && j >= 0){
		c+= (a[i][j] == 0);
		i+= x, j+= y;
	}
	return c;
}


int row_ones(int row, int i, int j){
	if(i > j) swap(i, j);
	return R[row][j] - (i == 0 ? 0 : R[row][i-1]);
}

int col_ones(int col, int i, int j){
	if(i > j) swap(i, j);
	return C[col][j] - (i == 0 ? 0 : C[col][i-1]);
}

int check(int i, int j, int r, int c){
	int ok = 0;
	if(row_ones(i, j, c) + col_ones(c, i, r) > 0) ok++;
	if(col_ones(j, i, r) + row_ones(r, j, c) > 0) ok++;
	if(ok != 2) return 1;
	return 0;
}

int biggest_stadium(int N, vector<vector<int>> F){
	n = N;
	a = F;
	R.resize(N);
	C.resize(N);
	int ans = 0;
	for(int i = 0;i < n; i++){
		for(int j = 0;j < n; j++){
			ans+= (a[i][j] == 0);
		}
	}
	for(int i = 0;i < n; i++){
		for(int j = 0;j < n; j++){
			R[i].push_back((R[i].empty() ? 0 : R[i].back()) + (a[i][j] == 1));
		}
//		cout << i+1 << " = ";
//		for(auto x : R[i]) cout << x << ' ';
//		cout << '\n';
	}
	for(int j = 0;j < n; j++){
		for(int i = 0;i < n; i++){
			C[j].push_back((C[j].empty() ? 0 : C[j].back()) + (a[i][j] == 1));
		}
	}
	if(ans == n * n) return ans;
	if(n * n - ans == 1){
		int mx = 0;
		for(int i = 0;i < n; i++){
			for(int j = 0;j < n; j++){
				if(a[i][j] == 0) continue;
				int west = counter(i, j, -1, 0);
				int east = counter(i, j, 1, 0);
				int north = counter(i, j, 0, -1);
				int south = counter(i, j, 0, 1);
				return ans - min(west, east)* min(north, south);
				
			}
		}
		return mx;
	}
	for(int i = 0;i < n; i++){
		for(int j = 0;j < n; j++){
			for(int r = 0; r < n; r++){
				for(int c = 0; c < n; c++){
					if(a[i][j] == 0 and a[r][c] == 0){
						if(!check(i, j, r, c)){
							return 0;
						}
					}
				}
			}
		}
	}
	return ans;
}


//main(){
//	int N; cin >> N;
//	vector< vector<int> > F(N, vector<int>(N));
//	for(int i = 0;i < N; i++){
//		for(int j = 0;j < N; j++){
//			cin >> F[i][j];
//		}
//	}
//	cout << biggest_stadium(N, F);
//}

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