| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 135415 | 陈家宝 | 封闭面积问题 | C++ | Accepted | 100 | 0 MS | 248 KB | 606 | 2024-03-05 16:15:16 |
#include<bits/stdc++.h> using namespace std; int a [11] [11]; int n , sum = 0; void dfs ( int x , int y ) { if(x > 10 || x < 0 || y > 10 || y < 0 || a [x] [y] == 1)return; a [x] [y] = 1 ; dfs ( x + 1 , y ) ; dfs ( x - 1 , y ) ; dfs ( x , y + 1 ) ; dfs ( x , y - 1 ) ; return ; } int main ( ) { for ( int i = 1 ; i <= 10 ; i ++ ){ for ( int j = 1 ; j <= 10 ; j ++ ) cin >> a [i] [j] ; } dfs ( 0 , 0 ) ; for ( int i = 1 ; i <= 10 ; i ++ ){ for ( int j = 1 ; j <= 10 ; j ++ ) if ( ! a [i] [j] )sum ++ ; } cout << sum; return 0 ; }