Submission #3179542

---

Source Code Expand

using System;
using System.Collections.Generic;
class Program
{
	static void Main(string[] args)
	{
		string str = Console.ReadLine();
		long N = long.Parse(str);
		long[,] A = new long[N,N];
		for(var i=0;i<N;i++){
			string str2 = Console.ReadLine();
			for(var j=0;j<str2.Length;j++){
				if(str2.Substring(j,1) == "#"){
					A[i,j] = 1;
				}
			}
		}
		long ans = 0;
		long[] C1 = new long[N];
		long[] C2 = new long[N];
		long c1max = 0;
		long c1min = N;
		for(var i=0;i<N;i++){
			for(var j=0;j<N;j++){
				if(A[i,j] == 1){
					C1[i] += 1;
				}
			}
			c1max = Math.Max(c1max,C1[i]);
			c1min = Math.Min(c1min,C1[i]);
		}
		long c2max = 0;
		long c2min = N;
		long c2maxct = 0;
		for(var i=0;i<N;i++){
			for(var j=0;j<N;j++){
				if(A[j,i] == 1){
					C2[i] += 1;
				}
			}
			if(C2[i] == N){
				c2maxct += 1;
			}
			c2max = Math.Max(c2max,C2[i]);
			c2min = Math.Min(c2min,C2[i]);
		}
		if(c1max == 0){
			ans = -1;
		} else {
			if(c1max == N){
				ans += N - c2maxct;
			} else {
				long ctmin = N;
				for(var i=0;i<N;i++){
					if(C1[i] > 0){
						for(var j=0;j<N;j++){
							if(A[i,j] == 1){
								long ct = N - C1[j];
								ctmin = Math.Min(ctmin,ct);
							}
						}
					}
				}
				ans += ctmin;
				ans += N - c2maxct;
			}
			if(c1max == N-1 && c2min == 0){
				ans = Math.Min(ans,N - c2maxct + 2);
			}
		}
		Console.WriteLine(ans);
	}
}

Submission Info

Judge Result