Submission #974723

#	Time	Username	Problem	Language	Result	Execution time	Memory
974723		Nika533	축구 경기장 (IOI23_soccer)	C++17	18 / 100	4533 ms	31764 KiB

soccer

#pragma GCC diagnostic warning "-std=c++11"
#include <bits/stdc++.h>
#include "soccer.h"
#define pb push_back
#define f first
#define s second
#define MOD 1000000007
#define flush fflush(stdout)
#define all(x) (x).begin(),(x).end()
#define allr(x) (x).rbegin(), (x).rend()
#define pii pair<int,int>
using namespace std;
int m,T,k;

int biggest_stadium(int N, vector<vector<int>> F) {
	int ans=0;
	for (int i=0; i<N; i++) {
		for (int j=0; j<N; j++) {
			if (!F[i][j]) ans++;
		}
	}
	
	if (ans==N*N-1) {
		int x=0,y=0;
		for (int i=0; i<N; i++) {
			for (int j=0; j<N; j++) {
				if (F[i][j]) {
					x=i; y=j;
				}
			}
		}
		return N*N-min(x+1,N-x)*min(y+1,N-y);
	}
	
	for (int i=1; i<N-1; i++) {
		for (int j=0; j<N; j++) {
			if (F[i][j]) {
				if (F[i-1][j]==0 && F[i+1][j]==0) ans=0;
			}
		}
	}
	for (int i=0; i<N; i++) {
		for (int j=1; j<N-1; j++) {
			if (F[i][j]) {
				if (F[i][j-1]==0 && F[i][j+1]==0) ans=0;
			}
		}
	}
	
	for (int i=0; i<N; i++) {
		for (int j=0; j<N; j++) {
			for (int i1=0; i1<N; i1++) {
				for (int j1=0; j1<N; j1++) {
					if (!F[i][j] && !F[i1][j1]) {
						if (F[i][j1] && F[i1][j]) ans=0;
					}
				}
			}
		}
	}
	
	return ans;
}

Compilation message (stderr)

soccer.cpp:1:32: warning: '-std=c++11' is not an option that controls warnings [-Wpragmas]
    1 | #pragma GCC diagnostic warning "-std=c++11"
      |                                ^~~~~~~~~~~~

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