feat: 添加两个算法题目解决方案

添加P8187.cpp和P7297.cpp两个算法题目的解决方案代码。P8187实现了一个简单的点比较算法，P7297实现了一个基于优先队列的图搜索算法。

src/11/13/P7297.cpp

@@ -0,0 +1,69 @@
+#include <algorithm>
+#include <bitset>
+#include <cstdint>
+#include <cstdio>
+#include <cstdlib>
+#include <iostream>
+#include <istream>
+#include <queue>
+#include <vector>
+using ll = int;
+
+const ll maxn=5e4+5,maxk=51,inf=1e9+7;
+ll n,k,b[maxn];
+std::vector<std::vector<int>> edg;
+std::vector<std::vector<int>> classp;
+ll vis[maxn];
+
+struct P{
+    ll now,step;
+    inline bool operator<(const P&o)const{
+        return step>o.step;
+    }
+};
+#define printf
+int main(){
+    std::iostream::sync_with_stdio(false);
+    std::cin.tie(nullptr);
+
+    std::cin>>n>>k;
+    edg.resize(k+1);
+    classp.resize(k+1);
+    for(ll i=1;i<=n;i++){
+        std::cin>>b[i];
+        classp[b[i]].emplace_back(i);
+        vis[i]=inf;
+    }
+    for(ll i=1;i<=k;i++){
+        for(ll j=1;j<=k;j++){
+            char tmp;
+            std::cin>>tmp;
+            if(tmp=='1'){
+                edg[i].emplace_back(j);
+            }
+        }
+    }
+    std::priority_queue<P> pq;
+    pq.emplace(1,0);
+    while(pq.size()){
+        auto[now,step]=pq.top();
+        pq.pop();
+        if(vis[now]!=inf)continue;
+        vis[now]=std::min(step,vis[now]);
+        printf("dij now=%lld, step=%lld\n",now,step);
+        if(now==n){
+            std::cout<<step<<"\n";
+            return 0;
+        }
+        for(ll i:edg[b[now]]){
+            for(ll p:classp[i]){
+                if(p==now)continue;
+                printf("%lld goto %lld\n",b[now],i);
+                ll nstep=step+std::abs(p-now);
+                if(nstep>vis[p])continue;
+                pq.emplace(p,step+std::abs(p-now));
+            }
+        }
+    }
+    std::cout<<"-1\n";
+}

src/11/13/P8187.cpp

@@ -0,0 +1,41 @@
+#include <algorithm>
+#include <cstdint>
+#include <iostream>
+#include <istream>
+#include <vector>
+using ll = int64_t;
+
+ll n,b;
+struct P{
+    ll x,y;
+    inline bool operator<(const P&o)const{
+        return x<o.x;
+    }
+    inline bool operator==(const P&o)const{
+        return x==o.x&&y==o.y;
+    }
+}g;
+std::vector<P> a;
+
+int main(){
+    std::iostream::sync_with_stdio(false);
+    std::cin.tie(nullptr);
+
+    std::cin>>n;
+    a.resize(n+1);
+    for(ll i=1;i<=n;i++){
+        std::cin>>a[i].x>>a[i].y;
+    }
+    std::cin>>g.x>>g.y;
+    std::sort(a.data()+1,a.data()+1+n);
+    if(n==1){
+        if(a[1]==g){
+            std::cout<<"1\n";
+        }else{
+            std::cout<<"0\n";
+        }
+        return 0;
+    }
+    b=(n+1)/2;
+    
+}