제출 #88280

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
88280		Scayre	Bomb (IZhO17_bomb)	C++14	24 / 100	95 ms	110380 KiB

bomb

///////////////////////////
//         INFO          //
//                       //
//    Handle -> Scayre   //
//                       //
//   Template vers. 1.1  //
//                       //
//   It'll be accepted   //
//                       //
///////////////////////////

//████╗████████╗██╗███████╗══███╗═══███╗████████╗════//
//═██╔╝═══██╔══╝╚█║██╔════╝══████╗═████║██╔═════╝═══//
//═██║════██║════╚╝███████╗══██╔████╔██║█████╗══════//
//═██║════██║══════╚════██║══██║╚██╔╝██║██╔══╝══════//
//████╗═══██║══════███████║══██║═╚═╝═██║███████╗═════//


#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <complex>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <algorithm>

#define ll long long
#define ld long double
#define ull unsigned ll
#define ioi exit(0);

#define f first
#define s second

#define inf (int)1e9 + 7

#define NFS ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);

#define mp(x,y) make_pair(x,y)

#define lb(x) lower_bound(x)
#define ub(x) upper_bound(x)

#define pb push_back
#define ppb pop_back

#define bitcoin __builtin_popcount

#define endl "\n"

#define in(x) insert(x)

#define sz(x) (int)x.size()

#define all(x) x.begin(),x.end()

#define pw2(x) (1<<x) //2^x

#define forit(it,v) for (typeof(v.begin()) it = v.begin(); it != v.end(); ++it)

#define sqr(x) ((x) * 1ll * (x))

#define UpdateRandom srand (time(NULL));

using namespace std;

const int N = (int)5e5 + 7, MOD = (int)1e9 + 7;

int n,m;

string s[N];

int cntv[N],cntd[N];

int l=inf,r=inf;

int main(){

	#ifdef IOI2019
		freopen ("in.txt", "r", stdin);
	#endif

	NFS

	cin >> n >> m;

	for(int i=1;i<=n;i++){
		cin >> s[i];
	}

	for(int j=0;j<sz(s[1]);j++){
		int cur=0;
		cntv[j]=inf;
		for(int i=1;i<=n;i++){
			if(s[i][j]=='0'){
				continue;
			}
			if(s[i+1][j]=='0'){
				cntv[j]=min(cur+1,cntv[j]);
				cur=0;
				continue;
			}
			cur++;
		}
		if(cur!=0)cntv[j]=min(cur,cntv[j]);
	}

	for(int i=1;i<=n;i++){
		int cur=0;
		cntd[i]=inf;
		for(int j=0;j<sz(s[i]);j++){
			if(s[i][j]=='0'){
				continue;
			}
			if(s[i][j+1]=='0'){
				cntd[i]=min(cur+1,cntd[i]);
				cur=0;
				continue;
			}
			cur++;
		}
		if(cur!=0)cntd[i]=min(cur,cntd[i]);
	}

	for(int i=1;i<=n;i++){
		if(cntd[i]==0){
			continue;
		}
		l=min(cntd[i],l);
	}

	if(l==inf)l=0;

	for(int i=0;i<sz(s[1]);i++){
		if(cntv[i]==0){
			continue;
		}
		r=min(cntv[i],r);
	}

	if(r==inf)r=0;

	cout << l*r << endl;

	#ifdef IOI2019
		cout << "\nTime Elapsed : " << clock () * 1.0 / CLOCKS_PER_SEC << endl;
	#endif

	ioi
}

• Subtask 1: 24 / 100