Submission #73131379

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN=105,inf=2e9;
int read() {
	static int f=1,c=getchar(),x=0;
	for(f=1; c<=47||c>=58; c=getchar())f=f&&(c!=45);
	for(x=0; c>=48&&c<=57; c=getchar())x=(x<<3)+(x<<1)+(c&15);
	return f?x:-x;
}
void print(int x) {
	if(x>9)print(x/10);
	putchar((x%10)|48);
}
int n,a[MAXN][MAXN];
char c[1];
void solve() {
	scanf("%d",&n);
	for(int i=1; i<=n; ++i)
		for(int j=1; j<=n; ++j)
			scanf("%1s",c),a[i][j]=c[0]=='?'?-1:c[0]-'0';
	for(int s=2; s<=n+n; ++s) {
		int id=-1;
		for(int j=max(s-n,1); j<=n&&j<s; ++j) {
			int i=s-j;
			if(~a[i][j]&&a[i][j]!=id) {
				if(~id) {
					printf("-1\n");
					return;
				} else id=a[i][j];
			}
		}
		id=max(id,0);
		for(int j=max(s-n,1); j<=n&&j<s; ++j)a[s-j][j]=id;
	}
	for(int i=1; i<=n; ++i,putchar(10))
		for(int j=1; j<=n; ++j)
			putchar(a[i][j]|48);
}
int main() {
	int t=1;
	while(t--)solve();
	return 0;
}

Submission Info

Judge Result