Submission #1131268


Source Code Expand

/**
 *    author:  [itmo] enot.1.10
 *    created: 25.02.2017 15:14:55       
**/
#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>

#define F first
#define S second
#define pb push_back
#define forn(i, n) for(int i = 0 ; (i) < (n) ; ++i)
#define eprintf(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define sz(a) ((int)(a).size())
#define all(a) (a).begin(),a.end()
#define pw(x) (1LL<<(x))

using namespace std;

typedef long long ll;
typedef double dbl;
typedef vector<int> vi;
typedef pair<int, int> pi;

const int inf = 1.01e9;
const dbl eps = 1e-9;

/* --- main part --- */

const int N = 510;

char s[N][N];
int cnt[N];

int main()
{
    #ifdef home
        assert(freopen("1.in", "r", stdin));
        assert(freopen("1.out", "w", stdout));
    #endif
    int n;
    scanf("%d", &n);
    forn(i, n) scanf("%s", s[i]);
    forn(i, n)
    {
        forn(j, n) if (s[i][j] == '#') cnt[i]++;
    }
    int mn = inf;
    forn(i, n)
    {
        if (cnt[i] == n) mn = 0;
        forn(j, n) if (s[i][j] == '#') mn = min(mn, n - cnt[j]);
    }
    int full =0;
    forn(j, n)
    {
        int ok = 1;
        forn(i, n) if (s[i][j] == '.') ok = 0;
        full += ok;
    }

    int res = mn + n - full;

    if (res >= inf) res = -1;
    printf("%d\n", res);
    #ifdef home
        eprintf("time = %d ms\n", (int)(clock() * 1000. / CLOCKS_PER_SEC));
    #endif
    return 0;
}

Submission Info

Submission Time
Task B - Row to Column
User enot
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1462 Byte
Status WA
Exec Time 4 ms
Memory 512 KB

Compile Error

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

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 0 / 300 0 / 1000
Status
AC × 5
AC × 19
WA × 1
AC × 40
WA × 3
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 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
0_03.txt AC 1 ms 256 KB
0_04.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 1 ms 256 KB
1_02.txt AC 1 ms 256 KB
1_03.txt AC 1 ms 256 KB
1_04.txt AC 1 ms 256 KB
1_05.txt AC 1 ms 256 KB
1_06.txt WA 1 ms 256 KB
1_07.txt AC 1 ms 256 KB
1_08.txt AC 1 ms 256 KB
1_09.txt AC 1 ms 256 KB
1_10.txt AC 1 ms 256 KB
1_11.txt AC 1 ms 256 KB
1_12.txt AC 1 ms 256 KB
1_13.txt AC 1 ms 256 KB
1_14.txt AC 1 ms 256 KB
2_00.txt AC 2 ms 512 KB
2_01.txt AC 3 ms 512 KB
2_02.txt AC 2 ms 512 KB
2_03.txt AC 2 ms 512 KB
2_04.txt AC 2 ms 512 KB
2_05.txt AC 2 ms 512 KB
2_06.txt WA 2 ms 512 KB
2_07.txt AC 3 ms 512 KB
2_08.txt AC 4 ms 512 KB
2_09.txt AC 3 ms 512 KB
2_10.txt AC 2 ms 512 KB
2_11.txt AC 4 ms 512 KB
2_12.txt AC 3 ms 512 KB
2_13.txt AC 3 ms 512 KB
2_14.txt WA 3 ms 512 KB
2_15.txt AC 2 ms 512 KB
2_16.txt AC 2 ms 512 KB
2_17.txt AC 2 ms 512 KB
2_18.txt AC 2 ms 384 KB
2_19.txt AC 3 ms 512 KB
2_20.txt AC 2 ms 384 KB
2_21.txt AC 2 ms 384 KB
2_22.txt AC 3 ms 512 KB