e2hang/Data-Structure
1
1
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Altered Algorithm

Browse Source
This commit is contained in:
e2hang
2025-09-01 19:49:15 +08:00
parent e162486df1
commit 9c30eb42e2
15 changed files with 954 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

109
Algorithm/Enumerate/HuaRongDao-or-Eight-Number-BFS-YES.cpp Normal file
View File

@@ -0,0 +1,109 @@
#include <iostream>
#include <vector>
#include <deque>
#include <set>
#include <utility>
using namespace std;
set<vector<int>> visited;
//<2F><><EFBFBD><EFBFBD>Ĭ<EFBFBD>ϾŹ<CFBE><C5B9><EFBFBD>
void swapUp(vector<int>& _v, int _i){
if(_i == 0 || _i == 1 || _i ==2 ) return;
swap(_v[_i], _v[_i - 3]);
}
void swapDown(vector<int>& _v, int _i){
if(_i == 6 || _i == 7 || _i ==8 ) return;
swap(_v[_i], _v[_i + 3]);
}
void swapLeft(vector<int>& _v, int _i){
if(_i == 0 || _i == 3 || _i ==6 ) return;
swap(_v[_i], _v[_i - 1]);
}
void swapRight(vector<int>& _v, int _i){
if(_i == 2 || _i == 5 || _i ==8 ) return;
swap(_v[_i], _v[_i + 1]);
}
//pos -> <20>׸<EFBFBD>λ<EFBFBD><CEBB>
int bfs(vector<int> _aim, vector<int> _v){
deque<pair<vector<int>, int>> q;
q.push_back({_v, 0});
visited.insert(_v);
while(!q.empty()){
auto tmp = q.front(); q.pop_front();
vector<int> tmpv = tmp.first;
int step = tmp.second;
if(tmpv == _aim) return step;
int x;
for(int i = 0; i < tmpv.size(); i++){
if(tmpv[i] == 0) {
x = i;
break;
}
}
// <20><>
if(x >= 3){
vector<int> tmps = tmpv;
swapUp(tmps, x);
if(!visited.count(tmps)){
visited.insert(tmps);
q.push_back({tmps, step + 1});
}
}
// <20><>
if(x <= 5){
vector<int> tmps = tmpv;
swapDown(tmps, x);
if(!visited.count(tmps)){
visited.insert(tmps);
q.push_back({tmps, step + 1});
}
}
// <20><>
if(x % 3 != 0){
vector<int> tmps = tmpv;
swapLeft(tmps, x);
if(!visited.count(tmps)){
visited.insert(tmps);
q.push_back({tmps, step + 1});
}
}
// <20><>
if(x % 3 != 2){
vector<int> tmps = tmpv;
swapRight(tmps, x);
if(!visited.count(tmps)){
visited.insert(tmps);
q.push_back({tmps, step + 1});
}
}
}
return -1; // <20>޽<EFBFBD>
}
int main(){
int n;
cin >> n;
vector<int> arr(n, -1);
vector<int> aim(n, -1);
int pos;
for(int i = 0; i < n; i++){
cin >> arr[i];
if(arr[i] == 0) pos = i;
}
for(int i = 0; i < n; i++){
cin >> aim[i];
}
cout << bfs(aim, arr) << endl;
return 0;
}
/*
9
2 6 4 1 3 7 0 5 8
8 1 5 7 3 6 4 0 2
*/

83
Algorithm/Enumerate/HuaRongDao-or-Eight-Number-DFS-NO.cpp Normal file
View File

@@ -0,0 +1,83 @@
#include <iostream>
#include <vector>
#include <set>
using namespace std;
set<vector<int>> visited;
//<2F><><EFBFBD><EFBFBD>Ĭ<EFBFBD>ϾŹ<CFBE><C5B9><EFBFBD>
void swapUp(vector<int>& _v, int _i){
if(_i == 0 || _i == 1 || _i ==2 ) return;
swap(_v[_i], _v[_i - 3]);
}
void swapDown(vector<int>& _v, int _i){
if(_i == 6 || _i == 7 || _i ==8 ) return;
swap(_v[_i], _v[_i + 3]);
}
void swapLeft(vector<int>& _v, int _i){
if(_i == 0 || _i == 3 || _i ==6 ) return;
swap(_v[_i], _v[_i - 1]);
}
void swapRight(vector<int>& _v, int _i){
if(_i == 2 || _i == 5 || _i ==8 ) return;
swap(_v[_i], _v[_i + 1]);
}
//x -> <20>׸<EFBFBD>λ<EFBFBD><CEBB>
void dfs(vector<int> _aim, vector<int> _v, int step, int x){
if(visited.count(_v)) return; // <20><><EFBFBD><EFBFBD><EFBFBD>ظ<EFBFBD>״̬
visited.insert(_v);
// <20><>
if(x >= 3){
vector<int> tmp = _v;
swapUp(tmp, x);
dfs(_aim, tmp, step + 1, x - 3);
}
// <20><>
if(x <= 5){
vector<int> tmp = _v;
swapDown(tmp, x);
dfs(_aim, tmp, step + 1, x + 3);
}
// <20><>
if(x % 3 != 0){
vector<int> tmp = _v;
swapLeft(tmp, x);
dfs(_aim, tmp, step + 1, x - 1);
}
// <20><>
if(x % 3 != 2){
vector<int> tmp = _v;
swapRight(tmp, x);
dfs(_aim, tmp, step + 1, x + 1);
}
//<2F>Ƚ<EFBFBD>
if(_aim == _v){
cout << step << " ";
return;
}
}
int main(){
int n;
cin >> n;
vector<int> arr(n, -1);
vector<int> aim(n, -1);
int pos;
for(int i = 0; i < n; i++){
cin >> arr[i];
if(arr[i] == 0) pos = i;
}
for(int i = 0; i < n; i++){
cin >> aim[i];
}
dfs(aim, arr, 0, pos);
return 0;
}
/*
9
2 6 4 1 3 7 0 5 8
8 1 5 7 3 6 4 0 2
*/

30
Algorithm/Enumerate/all_permutation_dfs.cpp Normal file
View File

@@ -0,0 +1,30 @@
#include <iostream>
#include <vector>
using namespace std;
template <class T>
void dfs(vector<T>& _path, vector<bool>& _used, int n) {
if(_path.size() == n){
for(auto x : _path) cout << x << " ";
cout << endl;
return;
}
for(int i = 0; i < n; i++){
if(!_used[i]) {
_used[i] = true;
_path.push_back(i + 1);
dfs(_path, _used, n);
_path.pop_back();
_used[i] = false;
}
}
}
int main(){
int n;
cin >> n;
vector<int> path;
vector<bool> used(n, false);
dfs(path, used, n);
return 0;
}

25
Algorithm/Enumerate/all_permutation_dfs_all_used.cpp Normal file
View File

@@ -0,0 +1,25 @@
#include <iostream>
#include <vector>
using namespace std;
template <class T>
void dfs(vector<T>& _path, int n) {
if(_path.size() == n){
for(auto x : _path) cout << x << " ";
cout << endl;
return;
}
for(int i = 0; i < n; i++){
_path.push_back(i + 1);
dfs(_path, n);
_path.pop_back();
}
}
int main(){
int n;
cin >> n;
vector<int> path;
dfs(path, n);
return 0;
}

32
Algorithm/Enumerate/all_subset.cpp Normal file
View File

@@ -0,0 +1,32 @@
#include <iostream>
#include <vector>
using namespace std;
template <class T>
void dfs(vector<T>& _path, vector<bool>& _used, int n) {
if(_path.size() == n){
for(auto x : _path) cout << x << " ";
cout << endl;
return;
}
for(int i = 0; i < n; i++){
if(!_used[i]) {
_used[i] = true;
_path.push_back(i + 1);
dfs(_path, _used, n);
_path.pop_back();
_used[i] = false;
}
}
for(auto x : _path) cout << x << " ";
cout << endl;
}
int main(){
int n;
cin >> n;
vector<int> path;
vector<bool> used(n, false);
dfs(path, used, n);
return 0;
}