Submission #1131548


Source Code Expand

#include <cstdio>
#include <algorithm>
#include <numeric>
using namespace std;
char ss[500][501];
bool s[500][500];
int row[500], col[500];
int main() {
    int n;
    scanf("%d", &n);
    for(int i = 0; i < n; i++) {
        scanf("%s", ss[i]);
        for(int j = 0; j < n; j++) {
            s[i][j] = ss[i][j] != '.';
            row[i] += s[i][j];
            col[j] += s[i][j];
        }
    }
    if(accumulate(row, row + n, 0) == 0) {
        puts("-1");
        return 0;
    }
    int ans = 999999;
    for(int i = 0; i < n; i++) {
        if(row[i] == n) {
            ans = 0;
            break;
        }
        ans = min(ans, n - row[i] + !col[i]);
    }
    ans += n - count(col, col + n, n);
    printf("%d\n", ans);
}

Submission Info

Submission Time
Task B - Row to Column
User johnchen902
Language C++14 (GCC 5.4.1)
Score 1300
Code Size 769 Byte
Status AC
Exec Time 2 ms
Memory 640 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:10:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
                    ^
./Main.cpp:12:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%s", ss[i]);
                           ^

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 300 / 300 1000 / 1000
Status
AC × 5
AC × 20
AC × 43
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt
Subtask 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 2_00.txt, 2_01.txt, 2_02.txt, 2_03.txt, 2_04.txt, 2_05.txt, 2_06.txt, 2_07.txt, 2_08.txt, 2_09.txt, 2_10.txt, 2_11.txt, 2_12.txt, 2_13.txt, 2_14.txt, 2_15.txt, 2_16.txt, 2_17.txt, 2_18.txt, 2_19.txt, 2_20.txt, 2_21.txt, 2_22.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 128 KB
0_01.txt AC 1 ms 128 KB
0_02.txt AC 1 ms 128 KB
0_03.txt AC 1 ms 128 KB
0_04.txt AC 1 ms 128 KB
1_00.txt AC 1 ms 128 KB
1_01.txt AC 1 ms 128 KB
1_02.txt AC 1 ms 128 KB
1_03.txt AC 1 ms 128 KB
1_04.txt AC 1 ms 128 KB
1_05.txt AC 1 ms 128 KB
1_06.txt AC 1 ms 128 KB
1_07.txt AC 1 ms 128 KB
1_08.txt AC 1 ms 128 KB
1_09.txt AC 1 ms 128 KB
1_10.txt AC 1 ms 128 KB
1_11.txt AC 1 ms 128 KB
1_12.txt AC 1 ms 128 KB
1_13.txt AC 1 ms 128 KB
1_14.txt AC 1 ms 128 KB
2_00.txt AC 2 ms 640 KB
2_01.txt AC 2 ms 640 KB
2_02.txt AC 2 ms 640 KB
2_03.txt AC 2 ms 640 KB
2_04.txt AC 2 ms 640 KB
2_05.txt AC 2 ms 640 KB
2_06.txt AC 2 ms 640 KB
2_07.txt AC 1 ms 640 KB
2_08.txt AC 2 ms 640 KB
2_09.txt AC 2 ms 640 KB
2_10.txt AC 2 ms 640 KB
2_11.txt AC 2 ms 640 KB
2_12.txt AC 2 ms 640 KB
2_13.txt AC 1 ms 640 KB
2_14.txt AC 2 ms 640 KB
2_15.txt AC 1 ms 640 KB
2_16.txt AC 1 ms 640 KB
2_17.txt AC 1 ms 640 KB
2_18.txt AC 1 ms 512 KB
2_19.txt AC 2 ms 640 KB
2_20.txt AC 1 ms 512 KB
2_21.txt AC 1 ms 512 KB
2_22.txt AC 2 ms 640 KB