Submission #2632274


Source Code Expand

#include <string>
#include <vector>
#include <iostream>
using namespace std;
int main(){
    int i,e,n,min=100000,c,max=0;
    cin>>n;
    bool t = false;
    char m[n][n];
    for(i=0;i<n;i++){
        for(e=0;e<n;e++){
            cin>>m[i][e];
        }
    }
    for(i=0;i<n;i++){
        for(e=0;e<n;e++){
            if(m[i][e]=='#'){
                t=true;
            };
        }
    }
    if(t==false){
        cout<<-1;
        return 0;
    }
    for(i=0;i<n;i++){
        c=0;
        for(e=0;e<n;e++){
            if(m[i][e]=='#'){
                c++;
            }
        }
        if(c>=max){
            max=c;
        }
        t=false;
        for(e=0;e<n;e++){
            if(m[e][i]=='#'){
                t=true;
            }
        }
        if(t==true){
            c=n-c;
        }
        else{
            c=n-(c)+1;
        }
        if(c<min){
            min=c;
        }
    }
    min=min+n;
    for(i=0;i<n;i++){
        c=0;
        for(e=0;e<n;e++){
            if(m[e][i]=='#'){
                c++;
            }
        }
        if(c==n){
            min--;
        }
    }
    cout<<min;
}

Submission Info

Submission Time
Task A - Robot Racing
User NCT
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1197 Byte
Status RE
Exec Time 104 ms
Memory 256 KB

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 0 / 500 0 / 400
Status
WA × 4
WA × 14
WA × 15
RE × 13
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt
Subtask 0_00.txt, 0_01.txt, 0_02.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
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.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, 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
Case Name Status Exec Time Memory
0_00.txt WA 1 ms 256 KB
0_01.txt WA 1 ms 256 KB
0_02.txt WA 1 ms 256 KB
0_03.txt WA 1 ms 256 KB
1_00.txt WA 1 ms 256 KB
1_01.txt WA 1 ms 256 KB
1_02.txt WA 1 ms 256 KB
1_03.txt WA 1 ms 256 KB
1_04.txt WA 1 ms 256 KB
1_05.txt WA 1 ms 256 KB
1_06.txt WA 1 ms 256 KB
1_07.txt WA 1 ms 256 KB
1_08.txt WA 1 ms 256 KB
1_09.txt WA 1 ms 256 KB
1_10.txt WA 1 ms 256 KB
2_00.txt RE 97 ms 256 KB
2_01.txt RE 98 ms 256 KB
2_02.txt RE 98 ms 256 KB
2_03.txt RE 104 ms 256 KB
2_04.txt RE 97 ms 256 KB
2_05.txt RE 96 ms 256 KB
2_06.txt RE 97 ms 256 KB
2_07.txt RE 97 ms 256 KB
2_08.txt RE 96 ms 256 KB
2_09.txt RE 99 ms 256 KB
2_10.txt RE 98 ms 256 KB
2_11.txt RE 98 ms 256 KB
2_12.txt RE 99 ms 256 KB