Submission #73131314

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1e2 + 10;

int n, val[MAXN << 1]; char s[MAXN][MAXN];

int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) scanf("%s", s[i] + 1);
	memset(val, 0xff, sizeof val);
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			int k = i + j;
			if (s[i][j] == '?') continue;
			if (val[k] == -1) val[k] = s[i][j] - '0';
			else if (val[k] != s[i][j] - '0') return puts("-1"), 0;
		}
	}
	for (int i = 1; i <= n * 2; i++) if (val[i] == -1) val[i] = 0;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			int k = i + j;
			if (s[i][j] == '?') s[i][j] = val[k] + '0';
		}
	}
	for (int i = 1; i <= n; i++) printf("%s\n", s[i] + 1);
}

Submission Info

Judge Result