Submission #339420

#	Time	Username	Problem	Language	Result	Execution time	Memory
339420		amunduzbaev	Riddick's Cube (IZhO13_riddicks)	C++14	0 / 100	3 ms	364 KiB

riddicks

/** made by amunduzbaev **/

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
#include <ext/rope>

using namespace __gnu_pbds;
using namespace __gnu_cxx;
using namespace std;

#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vll vector<ll>
#define vii vector<int>
#define vpii vector<pii>
#define vpll vector<pll>
#define cnt(a)__builtin_popcount(a)
template<class T> bool umin(T& a, const T& b) {return a > b? a = b, true:false;}
template<class T> bool umax(T& a, const T& b) {return a < b? a = b, true:false;}

typedef tree<pii,null_type,less<pii>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;

const int N = 10;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
ll n, m, ans, a[N][N], tmp[N][N], rmp[N][N], curcost;

void check(){
	bool gok = 1;
	for(int k=0;k<n && gok;k++){
		bool ok = 1;
		for(int l=0;l<m-1 && ok;l++) if(tmp[k][l] != tmp[k][l+1]) ok = 0;
		if(!ok) gok = 0;
	}if(!gok){
		gok = 1;
		for(int k=0;gok && k<m;k++){
			bool ok = 1;
			for(int l=0;ok && l<n-1;l++) if(tmp[l][k] != tmp[l+1][k]) ok = 0;
			if(!ok) gok = 0;
		}
		if(gok) ans = min(ans, curcost);
	}else ans = min(ans, curcost);
}

ll movecol(ll col, ll v){
	vll tt(v);
	for(int i=0;i<v;i++) tt[i] = tmp[i][col]; 
	for(int i=0;i<n;i++){
		if(i+v < n) tmp[i][col] = tmp[i+v][col];
		else tmp[i][col] = tt[(i+v)%n];
	}
	return min(v, m-v);
}

ll moverow(ll row, ll v){
	vll tt(v);
	for(int i=0;i<v;i++) tt[i] = tmp[row][i];
	for(int i=0;i<m;i++){
		if(i+v < m) tmp[row][i] = tmp[row][i+v];
		else tmp[row][i] = tt[(i+v)%m];
	}
	return min(v, n-v);
}

void solve(){
	cin>>n>>m;
	for(int i=0;i<n;i++) for(int j=0;j<m;j++) cin>>a[i][j];
	
	int tn = n, tm = m;
	for(int i=1;i<n;i++) tn *= n;
	for(int i=1;i<m;i++) tm *= m;
	ans = inf;
	vii mm(m, 0), nn(n, 0);
	for(int i=0;i<tm;i++){
		for(int j=0;j<n;j++) for(int l=0;l<m;l++) tmp[j][l] = a[j][l];
		ll	in, tmpp = curcost = 0;
		for(int j=0;j<m;j++) if(mm[j]) curcost += movecol(j, mm[j]);
		
		for(in = 0; in < m; in++){
			if(mm[in] == m-1) { mm[in] = 0; continue; }
			else { mm[in]++; break; }
		}
		for(int j=0;j<n;j++) for(int l=0;l<m;l++) rmp[j][l] = tmp[j][l];
		tmpp = curcost;
		for(int j=0;j<tn;j++){
			curcost = tmpp;
			for(int k=0;k<n;k++) for(int q=0;q<m;q++) tmp[k][q] = rmp[k][q];
			for(int l=0;l<n;l++) if(nn[l]) curcost += moverow(l, nn[l]);
			check();
			for(in = 0; in < n; in++){
				if(nn[in] == n-1) { nn[in] = 0; continue; }
				else { nn[in]++; break; }
			}
		}
		nn.assign(n, 0);
	}
	
	cout<<(ans == inf ? 100500 : ans)<<"\n";
	return;
}

/*

3 3
3 2 2
2 3 2
2 2 3

3 3
1 2 3
1 2 3
2 3 1

5 5
1 1 1 1 1 
1 1 1 1 1 
1 1 1 1 1 
1 1 1 1 1 
1 1 1 1 1 

*/

int main(){
	fastios
	int t = 1;
	if(t) solve();
	else {
		cin>>t;
		while (t--) solve();
	}
	return 0;
}
 

• Subtask 1: 0 / 100