#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scan1(a) scanf("%lld",&a);
#define scan2(a,b) scanf("%lld %lld",&a, &b);
#define scan3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
#define eps 1e-15
const int N = 1e5+12,INF=1e9+7;
int n,m;
map <pair <int, vector <vector <int> > > ,int> mp;
deque <pair <int, vector <vector <int> > > >q;
bool is_row(vector <vector <int> >v){
int i,j;
for (i=0;i<v.size();++i){
for (j=1;j<v[i].size();++j){
if (v[i][j] != v[i][j-1])ret 0;
}
}
ret 1;
}
bool is_columm(vector <vector <int> >v){
int i,j;
for (i=1;i<v.size();++i){
for (j=0;j<v[i].size();++j){
if (v[i][j] != v[i-1][j])ret 0;
}
}
ret 1;
}
void fun1 (vector <int> &v){
vector <int> p;
for (int j=0;j<m;++j){
p.pb(v[j]);
}
for (int j=0;j<m;++j){
v[j] = p[(j+1)%m];
}
}
void fun2 (vector <int> &v){
vector <int> p;
for (int j=0;j<m;++j){
p.pb(v[j]);
}
for (int j=0;j<m;++j){
v[j] = p[((j-1)+m)%m];
}
}
pair <int,vector <vector <int> >>fun3 (pair <int,vector <vector <int> >>v,int j){
vector <int> p;
for (int i=0;i<n;++i){
p.pb(v.sc[i][j]);
}
for (int i=0;i<n;++i){
v.sc[i][j] = p[((i+1)+n)%n];
}
ret v;
}
pair <int,vector <vector <int> >> fun4(pair <int,vector <vector <int> >>v,int j){
vector <int> p;
for (int i=0;i<n;++i){
p.pb(v.sc[i][j]);
}
for (int i=0;i<n;++i){
v.sc[i][j] = p[((i-1)+n)%n];
}
ret v;
}
main(){
vector <vector <int > >v;
cin>>n>>m;
v.resize(n);
int i,j;
for (i=0;i<n;++i){
v[i].resize(m);
for (j=0;j<m;++j){
cin>>v[i][j];
}
}
mp[{1,v}]=1;
q.pb({1,v});
int h=0;
while (!q.empty()){
pair <int,vector <vector <int> >> t = q[0];
q.pop_front();
if (mp[t] == 100500)break;
if (is_row(t.sc) || is_columm(t.sc)){
cout <<mp[t]-1;
ret 0;
}
if (t.fr == 1){
for (i=0;i<m;++i){
{
pair <int,vector <vector <int> >> to = fun3(t,i);
if (!mp[to]){
mp[to] = mp[t]+1;
q.pb(to);
}
}
{
pair <int,vector <vector <int> >> to = fun4(t,i);
if (!mp[to]){
mp[to] = mp[t]+1;
q.pb(to);
}
}
}
}
for (i=0;i<t.sc.size();++i){
{
pair <int,vector <vector <int> >> to = t;
fun1(to.sc[i]);
to.fr = 2;
if (!mp[to] && !mp[{1,to.sc}]){
mp[to] = mp[t]+1;
q.pb(to);
}
}
{
pair <int,vector <vector <int> >> to = t;
fun2(to.sc[i]);
to.fr = 2;
if ( !mp[to] && !mp[{1,to.sc}]){
mp[to] = mp[t]+1;
q.pb(to);
}
}
}
}
cout <<100500;
}
Compilation message
riddicks.cpp: In function 'bool is_row(std::vector<std::vector<int> >)':
riddicks.cpp:27:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
27 | for (i=0;i<v.size();++i){
| ~^~~~~~~~~
riddicks.cpp:28:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
28 | for (j=1;j<v[i].size();++j){
| ~^~~~~~~~~~~~
riddicks.cpp: In function 'bool is_columm(std::vector<std::vector<int> >)':
riddicks.cpp:36:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
36 | for (i=1;i<v.size();++i){
| ~^~~~~~~~~
riddicks.cpp:37:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
37 | for (j=0;j<v[i].size();++j){
| ~^~~~~~~~~~~~
riddicks.cpp: At global scope:
riddicks.cpp:88:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
88 | main(){
| ^
riddicks.cpp: In function 'int main()':
riddicks.cpp:128:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
128 | for (i=0;i<t.sc.size();++i){
| ~^~~~~~~~~~~~
riddicks.cpp:101:9: warning: unused variable 'h' [-Wunused-variable]
101 | int h=0;
| ^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Correct |
0 ms |
364 KB |
Output is correct |
| 3 |
Correct |
1 ms |
364 KB |
Output is correct |
| 4 |
Correct |
1 ms |
364 KB |
Output is correct |
| 5 |
Correct |
1 ms |
364 KB |
Output is correct |
| 6 |
Correct |
2 ms |
620 KB |
Output is correct |
| 7 |
Correct |
1 ms |
364 KB |
Output is correct |
| 8 |
Correct |
3 ms |
876 KB |
Output is correct |
| 9 |
Correct |
97 ms |
12652 KB |
Output is correct |
| 10 |
Correct |
99 ms |
12268 KB |
Output is correct |
| 11 |
Correct |
24 ms |
3820 KB |
Output is correct |
| 12 |
Correct |
4 ms |
1024 KB |
Output is correct |
| 13 |
Correct |
249 ms |
30964 KB |
Output is correct |
| 14 |
Runtime error |
465 ms |
65540 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
| 15 |
Halted |
0 ms |
0 KB |
- |
