# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
339525 | beksultan04 | Riddick's Cube (IZhO13_riddicks) | C++14 | 1 ms | 364 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>
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-12
const int N = 3e5+12,INF=100500;
int n,m,q[20][20],pom[20],mn=INF;
bool is_row(){
int i,j;
for (i=0;i<n;++i){
for (j=1;j<m;++j){
if (q[i][j] != q[i][j-1])ret 0;
}
}
ret 1;
}
bool is_col(){
int i,j;
for (i=1;i<n;++i){
for (j=0;j<m;++j){
if (q[i][j] != q[i-1][j])ret 0;
}
}
ret 1;
}
void fun2(int j,int ans);
void fun2(int i,int ans){
int j;
if (i >= n){
if (is_row() || is_col()){
mn = min(ans,mn);
}
ret;
}
for (int x = 0;x<m;++x){
for (j=0;j<m;++j){
pom[j]=q[i][j];
}
for (j=0;j<m;++j){
q[i][j] = pom[(j+x)%m];
}
fun2(i+1,ans+min(m-x,x));
}
}
void fun1(int j,int ans){
int i;
if (j >= m){
fun2(0ll,ans);
ret ;
}
for (int x = 0;x<n;++x){
for (i=0;i<n;++i){
pom[i]=q[i][j];
}
for (i=0;i<n;++i){
q[i][j] = pom[(i+x)%n];
}
fun1(j+1,ans+min(n-x,x));
}
}
main(){
int i,j;
scan2(n,m)
for (i=0;i<n;++i){
for (j=0;j<m;++j){
scan1(q[i][j])
}
}
fun1(0,0);
cout <<mn;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |