Submission #1661438


Source Code Expand

// see https://gist.github.com/LumaKernel/ff55d49ee1af69b7388f15b707e75c15
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <complex>
#include <random>

using namespace std;

typedef vector<int> VI;
typedef pair<int, int> P;
typedef long long ll;

#define omajinai ios::sync_with_stdio(false);cin.tie(0)

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,b,a) for(int i=(b)-1;i>=(a);--i)
#define RREP(i,n) RFOR(i,n,0)

#define ALL(a) (a).begin(),(a).end()
#define UNIQUE(a) (a).erase(unique((a).begin(),(a).end()),(a).end())
#define MP make_pair
#define PB push_back
#define EACH(i,c) REP(i,(c).size())
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

#define CLR(a) memset((a), 0 ,sizeof(a))

#define dump(x) cerr << "[L " << __LINE__ << "] " << #x << " = " << (x) << "\n";
#define dump2(x,y) cerr << "[L " << __LINE__ << "] " << #x << " = " << (x)\
			<< " , " << #y << " = " << (y) << "\n";

const int INF = 1e9;
const double EPS = 1e-10;

int n;
string s[500];
bool exist[500];
int cnt[500];
int ans=1e9;

int main() {
	cin>>n;
	REP(i,n){
		cin>>s[i];
	}
	int existC = 0;
	int existA = 0;
	bool flag = 0;
	REP(i,n){
		existC = 0;
		REP(j,n){
			if(s[i][j]=='#'){
				existA++;
				existC++;
				exist[i]=1;
			}
		}
		if(existC == n){
			flag = 1;
		}
	}
	if(existA==0){
		cout<<-1<<endl;
		return 0;
	}
	if(flag){
		int d = 0;
		REP(j,n){
			existC = 0;
			REP(i,n)if(s[i][j]=='#') existC++;
			if(existC==n) d++;
		}
		cout << n - d << endl;
		return 0;
	}

	int M=0;
	REP(j,n)if(exist[j]){
		REP(j2,n){
			if(s[j][j2]=='#')cnt[j]++;
		}
		M=max(M, cnt[j]);
	}

	cout<<n - M + n<<endl;
}

Submission Info

Submission Time
Task B - Row to Column
User luma
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1903 Byte
Status WA
Exec Time 12 ms
Memory 512 KB

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 0 / 300 0 / 1000
Status
AC × 5
AC × 16
WA × 4
AC × 28
WA × 15
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt
Subtask 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 2_00.txt, 2_01.txt, 2_02.txt, 2_03.txt, 2_04.txt, 2_05.txt, 2_06.txt, 2_07.txt, 2_08.txt, 2_09.txt, 2_10.txt, 2_11.txt, 2_12.txt, 2_13.txt, 2_14.txt, 2_15.txt, 2_16.txt, 2_17.txt, 2_18.txt, 2_19.txt, 2_20.txt, 2_21.txt, 2_22.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
0_03.txt AC 1 ms 256 KB
0_04.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 1 ms 256 KB
1_02.txt AC 1 ms 256 KB
1_03.txt WA 1 ms 256 KB
1_04.txt WA 1 ms 256 KB
1_05.txt AC 1 ms 256 KB
1_06.txt WA 1 ms 256 KB
1_07.txt AC 1 ms 256 KB
1_08.txt AC 1 ms 256 KB
1_09.txt AC 1 ms 256 KB
1_10.txt WA 1 ms 256 KB
1_11.txt AC 1 ms 256 KB
1_12.txt AC 1 ms 256 KB
1_13.txt AC 1 ms 256 KB
1_14.txt AC 1 ms 256 KB
2_00.txt AC 10 ms 512 KB
2_01.txt AC 10 ms 512 KB
2_02.txt AC 10 ms 512 KB
2_03.txt WA 10 ms 512 KB
2_04.txt WA 10 ms 512 KB
2_05.txt AC 10 ms 512 KB
2_06.txt WA 10 ms 512 KB
2_07.txt WA 9 ms 512 KB
2_08.txt WA 12 ms 512 KB
2_09.txt WA 11 ms 512 KB
2_10.txt WA 10 ms 512 KB
2_11.txt WA 11 ms 512 KB
2_12.txt WA 11 ms 512 KB
2_13.txt WA 10 ms 512 KB
2_14.txt WA 10 ms 512 KB
2_15.txt AC 8 ms 512 KB
2_16.txt AC 9 ms 512 KB
2_17.txt AC 8 ms 512 KB
2_18.txt AC 7 ms 512 KB
2_19.txt AC 10 ms 512 KB
2_20.txt AC 7 ms 512 KB
2_21.txt AC 7 ms 512 KB
2_22.txt AC 10 ms 512 KB