# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
339188 | Kerim | Riddick's Cube (IZhO13_riddicks) | C++17 | 628 ms | 492 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x) cerr<< #x <<" = "<< x<<endl;
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
int arr[5][5],n,m;
void lrow(int x){
int tmp=arr[x][0];
for(int i=0;i+1<m;i++)
arr[x][i]=arr[x][i+1];
arr[x][m-1]=tmp;
}
void rrow(int x){
int tmp=arr[x][m-1];
for(int i=m-1;i>0;i--)
arr[x][i]=arr[x][i-1];
arr[x][0]=tmp;
}
void lcol(int x){
int tmp=arr[0][x];
for(int i=0;i+1<n;i++)
arr[i][x]=arr[i+1][x];
arr[n-1][x]=tmp;
}
void rcol(int x){
int tmp=arr[n-1][x];
for(int i=n-1;i>0;i--)
arr[i][x]=arr[i-1][x];
arr[0][x]=tmp;
}
int ans=100500;
bool son(){
int ok=1;
for(int i=0;i<n;i++)
for(int j=0;j<m;j++)
ok&=(arr[i][j]==arr[i][0]);
if(ok)return 1;ok=1;
for(int j=0;j<m;j++)
for(int i=0;i<n;i++)
ok&=(arr[i][j]==arr[0][j]);
return ok;
}
void print(){
for(int i=0;i<n;i++){
for(int j=0;j<m;j++)
printf("%d ",arr[i][j]);
puts("");
}wr
}
void g(int x,int cur){
if(x==n){
if(son())
ans=min(ans,cur);
return;
}
for(int i=0;i<m;i++){
g(x+1,cur+min(i,m-i));
rrow(x);
}
}
void f(int x,int cur){
if(x==m){
g(0,cur);
return;
}
for(int i=0;i<n;i++){
f(x+1,cur+min(i,n-i));
rcol(x);
}
}
int main(){
//freopen("file.in","r",stdin);
scanf("%d%d",&n,&m);
for(int i=0;i<n;i++)
for(int j=0;j<m;j++)
scanf("%d",&arr[i][j]);
f(0,0);printf("%d\n",ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |