1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstdlib>
 4 #include <cstring>
 5 #include <algorithm>
 6 #include <vector>
 7 #define max(a, b) ((a) > (b) ? (a) : (b))
 8
 9 const int point[9][9] = {{6,6,6,6,6,6,6,6,6},
10                          {6,7,7,7,7,7,7,7,6},
11                          {6,7,8,8,8,8,8,7,6},
12                          {6,7,8,9,9,9,8,7,6},
13                          {6,7,8,9,10,9,8,7,6},
14                          {6,7,8,9,9,9,8,7,6},
15                          {6,7,8,8,8,8,8,7,6},
16                          {6,7,7,7,7,7,7,7,6},
17                          {6,6,6,6,6,6,6,6,6}};
18 const int yu[10][10] = {{0,0,0,0,0,0,0,0,0,0},
19                         {0,1,1,1,2,2,2,3,3,3},
20                         {0,1,1,1,2,2,2,3,3,3},
21                         {0,1,1,1,2,2,2,3,3,3},
22                         {0,4,4,4,5,5,5,6,6,6},
23                         {0,4,4,4,5,5,5,6,6,6},
24                         {0,4,4,4,5,5,5,6,6,6},
25                         {0,7,7,7,8,8,8,9,9,9},
26                         {0,7,7,7,8,8,8,9,9,9},
27                         {0,7,7,7,8,8,8,9,9,9}};
28
29 inline void read(int &x)
30 {
31     x = 0;char ch = getchar(), c = ch;
32     while(ch < '0' || ch > '9')c = ch, ch = getchar();
33     while(ch <= '9' && ch >= '0')x = x * 10 + ch - '0', ch = getchar();
34     if(c == '-')x = -x;
35 }
36
37 struct Node
38 {
39     int x, y;
40     Node(int _x, int _y){x = _x;y = _y;}
41     Node(){};
42 }tian[85];
43
44 int num[10][10],ge[10][10],col[10][10],row[10][10],cnt,ans,sum;
45 int ok[10][10][10];//存每个方格可以填的数
46
47 bool cmp(Node a, Node b)
48 {
49     return a.x == b.x ? a.y > b.y :a.x > b.x;
50 }
51
52 void dfs(int now)
53 {
54     if((cnt - now + 1) * 90 + sum <= ans)return;
55     if(now == cnt + 1)
56     {
57         ans = max(ans, sum);
58         return;
59     }
60     register int x = tian[now].x, y = tian[now].y;
61     for(register int i = ok[x][y][0];i >= 1;-- i)
62     {
63         int shu = ok[x][y][i];
64         if(num[x][y] || row[x][shu] || col[y][shu] || ge[yu[x][y]][shu])continue;
65         row[x][shu] = col[y][shu] = ge[yu[x][y]][shu] = 1;num[x][y] = shu,sum += shu * point[x - 1][y - 1];
66         dfs(now + 1);
67         sum -= shu * point[x - 1][y - 1],row[x][shu] = col[y][shu] = ge[yu[x][y]][shu] = num[x][y] = 0;
68     }
69     return;
70 }
71
72 int main()
73 {
74     for(register int i = 1;i <= 9;++ i)for(register int j = 1;j <= 9;++ j)
75     {
76         read(num[i][j]);
77         if(num[i][j])
78             ge[yu[i][j]][num[i][j]] = row[i][num[i][j]] = col[j][num[i][j]] = 1, sum += num[i][j] * point[i - 1][j - 1];
79     }
80     for(register int i = 1;i <= 9;++ i)for(register int j = 1;j <= 9;++ j)
81         if(!num[i][j])
82         {
83             for(register int k = 1;k <= 9;++ k)
84                 if(!col[j][k] && !row[i][k] && !ge[yu[i][j]][k])
85                     ok[i][j][++ok[i][j][0]] = k;
86             tian[++cnt] = Node(i,j);
87         }
88     std::sort(tian + 1, tian + 1 + cnt, cmp);
89     ans = -1;
90     dfs(1);
91     printf("%d", ans);
92     return 0;
93 }