Submission #1131185


Source Code Expand

#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
#include <tuple>
#include <utility>
using namespace std;

namespace {
  using Integer = long long; //__int128;
  template<class T, class S> istream& operator >> (istream& is, pair<T,S>& p){return is >> p.first >> p.second;}
  template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
  template<class T> istream& operator ,  (istream& is, T& val){ return is >> val;}
  template<class T, class S> ostream& operator << (ostream& os, const pair<T,S>& p){return os << p.first << " " << p.second;}
  template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(size_t i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}
  template<class T> ostream& operator ,  (ostream& os, const T& val){ return os << " " << val;}

  template<class H> void print(const H& head){ cout << head; }
  template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }
  template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }

  template<class H> void eprint(const H& head){ cerr << head; }
  template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }
  template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }

  class range{ Integer start_, end_, step_; public: struct range_iterator{ Integer val, step_; range_iterator(Integer v, Integer step) : val(v), step_(step) {} Integer operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;} }; range(Integer len) : start_(0), end_(len), step_(1) {} range(Integer start, Integer end) : start_(start), end_(end), step_(1) {} range(Integer start, Integer end, Integer step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ return range_iterator(start_, step_); } range_iterator   end(){ return range_iterator(  end_, step_); } };

  inline string operator "" _s (const char* str, size_t size){ return move(string(str)); }
  constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}
  constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}
  constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }

  inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed

  mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());

  template<class T> string join(const vector<T>& v, const string& sep){ stringstream ss; for(size_t i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str(); }

  inline string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }
}
constexpr long long mod = 9_ten + 7;

int main(){
  int n;
  cin >> n;

  assert( n<=3 );

  vector<string> v(n);
  cin >> v;

  map< vector<string>, int > dp;
  dp[v] = 0;
  queue< vector<string> > s;
  s.push( v );

  while(s.size()){
    auto vv = s.front();
    s.pop();

    int t = dp[vv];

    for(int i=0; i<n; i++){
      for(int j=0; j<n; j++){
        auto vvv = vv;
        for(int k=0; k<n; k++){
          vvv[ k ][ j ] = vv[i][k];
        }
        if( dp.count( vvv ) == 0 ){
          dp[ vvv ] = t + 1;
          s.push( vvv );
        }
      }
    }
  }

  vector<string> res(n, string(n, '#'));
  if( dp.count(res) == 0 ){
    println(-1);
  }else{
    println( dp[res] );
  }
  return 0;
}

Submission Info

Submission Time
Task B - Row to Column
User koyumeishi
Language C++14 (GCC 5.4.1)
Score 300
Code Size 4112 Byte
Status RE
Exec Time 287 ms
Memory 764 KB

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 300 / 300 0 / 1000
Status
AC × 5
AC × 20
AC × 20
RE × 23
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 9 ms 764 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
0_03.txt AC 4 ms 384 KB
0_04.txt AC 4 ms 384 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 1 ms 256 KB
1_02.txt AC 4 ms 384 KB
1_03.txt AC 5 ms 384 KB
1_04.txt AC 4 ms 384 KB
1_05.txt AC 4 ms 384 KB
1_06.txt AC 4 ms 384 KB
1_07.txt AC 4 ms 384 KB
1_08.txt AC 4 ms 384 KB
1_09.txt AC 4 ms 384 KB
1_10.txt AC 4 ms 384 KB
1_11.txt AC 5 ms 384 KB
1_12.txt AC 1 ms 256 KB
1_13.txt AC 4 ms 384 KB
1_14.txt AC 4 ms 384 KB
2_00.txt RE 287 ms 256 KB
2_01.txt RE 99 ms 256 KB
2_02.txt RE 105 ms 256 KB
2_03.txt RE 100 ms 256 KB
2_04.txt RE 101 ms 256 KB
2_05.txt RE 103 ms 256 KB
2_06.txt RE 103 ms 256 KB
2_07.txt RE 105 ms 256 KB
2_08.txt RE 106 ms 256 KB
2_09.txt RE 98 ms 256 KB
2_10.txt RE 97 ms 256 KB
2_11.txt RE 97 ms 256 KB
2_12.txt RE 100 ms 256 KB
2_13.txt RE 100 ms 256 KB
2_14.txt RE 100 ms 256 KB
2_15.txt RE 98 ms 256 KB
2_16.txt RE 105 ms 256 KB
2_17.txt RE 98 ms 256 KB
2_18.txt RE 97 ms 256 KB
2_19.txt RE 97 ms 256 KB
2_20.txt RE 104 ms 256 KB
2_21.txt RE 98 ms 256 KB
2_22.txt RE 98 ms 256 KB