Submission #1131216


Source Code Expand

#include <iostream>
#include <algorithm>
#include <iomanip>
#include <string>
#include <functional>
#include <utility>
#include <queue>
#include <vector>
#include <string>
#include <cmath>
#include <stack>
#include <climits>
using namespace std;
typedef long long int ll;
const ll  MOD = 1000000007;
typedef pair<ll,ll> P;

int N;
string s[1000];
int f(int depth,string str[]){
  if(depth > 5) return 1001001001;
  int ff = 1;
  for(int i=0;i<N;i++){
    for(int j=0;j<N;j++){
      if(str[i][j] != '#') ff=0;
    }
  }
  if(ff == 1){
    return depth;
  }
  string t[1000];
  int ans = 1001001001;
  for(int i=0;i<N;i++){
    for(int j=0;j<N;j++){
      string tmp = t[i];
      for(int k=0;k<N;k++){
        t[k][j] = tmp[k];
      }
      int tt = f(depth+1,t);
      if(tt < ans) ans = tt;
      for(int k=0;k<N;k++){
        t[k] = str[k];
      }
    }
  }
  return ans;
}
int main(){
  cin >> N;
  if(N>3) return 0;
  for(int i=0;i<N;i++){
    cin >> s[i];
  }
  int ans = f(0,s);
  if(ans == 1001001001){
    cout << "-1" << endl;
  }
  else{
    cout << f(0,s) << endl;
  }
}

Submission Info

Submission Time
Task B - Row to Column
User gamelove765
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1146 Byte
Status WA
Exec Time 313 ms
Memory 256 KB

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 0 / 300 0 / 1000
Status
AC × 5
AC × 13
WA × 7
AC × 13
WA × 30
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 4 ms 256 KB
0_01.txt AC 3 ms 256 KB
0_02.txt AC 1 ms 256 KB
0_03.txt AC 271 ms 256 KB
0_04.txt AC 307 ms 256 KB
1_00.txt AC 153 ms 256 KB
1_01.txt AC 1 ms 256 KB
1_02.txt WA 153 ms 256 KB
1_03.txt WA 153 ms 256 KB
1_04.txt WA 153 ms 256 KB
1_05.txt AC 305 ms 256 KB
1_06.txt WA 154 ms 256 KB
1_07.txt AC 303 ms 256 KB
1_08.txt AC 302 ms 256 KB
1_09.txt WA 313 ms 256 KB
1_10.txt WA 153 ms 256 KB
1_11.txt WA 303 ms 256 KB
1_12.txt AC 153 ms 256 KB
1_13.txt AC 248 ms 256 KB
1_14.txt AC 304 ms 256 KB
2_00.txt WA 1 ms 256 KB
2_01.txt WA 1 ms 256 KB
2_02.txt WA 1 ms 256 KB
2_03.txt WA 1 ms 256 KB
2_04.txt WA 1 ms 256 KB
2_05.txt WA 1 ms 256 KB
2_06.txt WA 1 ms 256 KB
2_07.txt WA 1 ms 256 KB
2_08.txt WA 1 ms 256 KB
2_09.txt WA 1 ms 256 KB
2_10.txt WA 1 ms 256 KB
2_11.txt WA 1 ms 256 KB
2_12.txt WA 1 ms 256 KB
2_13.txt WA 1 ms 256 KB
2_14.txt WA 1 ms 256 KB
2_15.txt WA 1 ms 256 KB
2_16.txt WA 1 ms 256 KB
2_17.txt WA 1 ms 256 KB
2_18.txt WA 1 ms 256 KB
2_19.txt WA 1 ms 256 KB
2_20.txt WA 1 ms 256 KB
2_21.txt WA 1 ms 256 KB
2_22.txt WA 1 ms 256 KB