oj.uz

Submission #1027364

# Submission time Handle Problem Language Result Execution time Memory
1027364 2024-07-19T04:32:25 Z vjudge1 Riddick's Cube (IZhO13_riddicks) C++17
100 / 100
 350 ms 600 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
 
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("Ofast,unroll-loops")
 
using namespace std;
using namespace __gnu_pbds;
 
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define f first
#define s second
#define int long long
#define pii pair<int,int>
 
template<class T>bool umax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<class T>bool umin(T &a,T b){if(b<a){a=b;return true;}return false;}
 
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
 tree_order_statistics_node_update> ordered_set;
 
const int inf = 1e17 + 7;
const int mod = 1e9 + 7;
const int N = 3e5 + 5;
const int md = 998244353;

int binpow(int a, int b){
	if(b == 0)return 1;
	if(b % 2 == 0){
		int c = binpow(a,b/2);
		return (c*c)%mod;
	}
	return (binpow(a,b-1)*a)%mod;
}

int divi(int a, int b){
	return (a*(binpow(b,mod-2)))%mod;
}

int n,m,k;
vector<vector<int>>v(6);
int ans = inf;

void dfy(int y, int cnt){
	if(y == n)return;
	
	for(int i = 0;i<m;i++){
		int h = cnt;
		v[y].insert(v[y].begin(), v[y][m-1]);
		v[y].erase(v[y].begin()+m, v[y].begin()+m+1);
		
		h += min(m-i-1, i+1);
		
		if(y == n-1){
			bool flag = true;
			for(int i = 0;i<n;i++)
				for(int j = 0;j<m;j++)
					if(v[i][j] != v[i][0])flag = false;
				
			
			if(flag){
				umin(ans, h);
				//~ for(int i = 0;i<n;i++){
					//~ for(int j = 0;j<m;j++){
						//~ cout << v[i][j] << " ";
					//~ }
					//~ cout << "\n";
				//~ }
				//~ cout << "\n";
			}
			flag = true;
			for(int j = 0;j<m;j++)
				for(int i = 0;i<n;i++)
					if(v[i][j] != v[0][j])flag = false;
				
			
			if(flag){
				umin(ans, h);
				//~ for(int i = 0;i<n;i++){
					//~ for(int j = 0;j<m;j++){
						//~ cout << v[i][j] << " ";
					//~ }
					//~ cout << "\n";
				//~ }
				//~ cout << "\n";
			}
		}
		else dfy(y+1, h);
		
	}
}

void dfs(int x, int cnt){
	
	if(x == m)return;
	
	for(int i = 0;i<n;i++){
		int h = cnt;
		int val = v[n-1][x];
		
		for(int j = n-2;j>=0;j--){
			v[j+1][x] = v[j][x];
		}
		v[0][x] = val;
		
		h += min(n-i-1, i+1);
		
		if(x == m-1){
			//~ vector<vector<int>>arr = v;
			dfy(0, h);
			//~ v = arr;
		}
		else dfs(x+1, h);
	}
	
}

void solve(){
	
	cin >> n >> m;
	
	for(int i = 0;i<n;i++){
		for(int j = 0;j<m;j++){
			int a;
			cin >> a;
			v[i].pb(a);
		}
	}
	dfs(0, 0);
	
	if(ans == inf)ans = 100500;
	cout << ans << "\n";
	
}
 /*
 3 3
1 1 3
2 2 2
3 3 1
 */
 signed main()
{
//	freopen("seq.in", "r", stdin);
//  freopen("seq.out", "w", stdout);
	ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
	int tt=1;//cin>>tt;
	while(tt--)solve();
 
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 19 ms 348 KB Output is correct
10 Correct 19 ms 348 KB Output is correct
11 Correct 19 ms 344 KB Output is correct
12 Correct 27 ms 348 KB Output is correct
13 Correct 324 ms 600 KB Output is correct
14 Correct 330 ms 432 KB Output is correct
15 Correct 335 ms 428 KB Output is correct
16 Correct 350 ms 348 KB Output is correct
17 Correct 340 ms 432 KB Output is correct
18 Correct 346 ms 348 KB Output is correct
19 Correct 337 ms 444 KB Output is correct
20 Correct 312 ms 344 KB Output is correct