Adding & Formatting

Checkpoints & Answers of V-Ball, MagicCircle and FlingLikFullOfVim added

Author: hnrobert

Answers/FlingLikFullOfVim.cpp

@@ -0,0 +1,75 @@
+//
+//  main.cpp
+//  FlingLikFullOfVim
+//
+//  Created by Robert He on 2024/11/13.
+//
+
+#include<cstdio>
+#include<cstring>
+#include<algorithm>
+
+const int M=77777,K=11;
+const int inf=1e9+7;
+
+void gmin(int &A,int B){A=std::min(A,B);}
+
+int n,len,cnt_e,s[M];
+char str[M];
+bool key[M];
+
+int f[M][K],g[M][K][K];
+
+int main(){
+    scanf("%d",&len);
+    scanf(" %s",str+1);
+    
+    bool flag=true;
+    for(int i=1;i<=len;i++){
+        if(str[i]=='e'){
+            flag=true;
+            cnt_e++;
+        } else {
+            key[++n]=flag;
+            s[n]=str[i]-'a';
+            flag=false;
+        }
+    }
+    for(int i=0;i<=n;i++)
+        for(int x=0;x<K;x++) f[i][x]=inf;
+    for(int i=0;i<=n;i++)
+        for(int x=0;x<K;x++)
+            for(int y=0;y<K;y++) g[i][x][y]=inf;
+    f[0][s[1]]=0;
+    for(int i=1;i<=n;i++){
+        // f -> f
+        for(int x=0;x<K;x++){
+            if(!key[i]&&x!=s[i]) gmin(f[i][x],f[i-1][x]);
+            gmin(f[i][x],f[i-1][s[i]]+2);
+        }
+        
+        // f -> g
+        for(int x=0;x<K;x++)
+            for(int y=0;y<K;y++){
+                if(x!=s[i]) gmin(g[i][x][y],f[i-1][x]+3);
+                gmin(g[i][x][y],f[i-1][s[i]]+5);
+            }
+        
+        // g -> f
+        for(int x=0;x<K;x++){
+            if(x!=s[i]) gmin(f[i][x],g[i-1][s[i]][x]);
+            gmin(f[i][x],g[i-1][s[i]][s[i]]+2);
+        }
+        
+        // g -> g
+        for(int x=0;x<K;x++)
+            for(int y=0;y<K;y++){
+                if(x!=s[i]&&y!=s[i]) gmin(g[i][x][y],g[i-1][x][y]+1);
+                if(y!=s[i]) gmin(g[i][x][y],g[i-1][s[i]][y]+3);
+                if(x!=s[i]) gmin(g[i][x][y],g[i-1][x][s[i]]+3);
+                gmin(g[i][x][y],g[i-1][s[i]][s[i]]+5);
+            }
+    }
+    printf("%d\n",f[n][10]-2+2*cnt_e);
+    return 0;
+}

Answers/MagicCircle.cpp

@@ -0,0 +1,79 @@
+//
+//  MagicCircle.cpp
+//  AngryCodeProposition2024
+//
+//  Created by Robert He on 2024/11/16.
+//
+
+#include <algorithm>
+#include <iostream>
+using namespace std;
+#define il inline
+#define re register
+#define D double
+
+il int read() {
+    re int x = 0, f = 1;
+    re char c = getchar();
+    while (c < '0' || c > '9') {
+        if (c == '-')
+            f = -1;
+        c = getchar();
+    }
+    while (c >= '0' && c <= '9') {
+        x = x * 10 + c - 48;
+        c = getchar();
+    }
+    return x * f;
+}
+
+#define rep(i, s, t) for (re int i = s; i <= t; ++i)
+#define eps 1e-12
+#define maxn 100005
+#define ff(x) (x) * (x)
+int n, m;
+D r;
+
+struct node {
+    D x, y;
+} o, e[maxn];
+il D dis(node a, node b) { return sqrt(ff(a.x - b.x) + ff(a.y - b.y)); }
+
+il void get(node a, node b, node c) {
+    D a1 = b.x - a.x, a2 = c.x - a.x, b1 = b.y - a.y, b2 = c.y - a.y;
+    D c1 = (ff(b.x) - ff(a.x) + ff(b.y) - ff(a.y));
+    D c2 = (ff(c.x) - ff(a.x) + ff(c.y) - ff(a.y));
+    o = (node){(b2 * c1 - b1 * c2) / (b2 * a1 * 2 - b1 * a2 * 2),
+               (a2 * c1 - a1 * c2) / (a2 * b1 * 2 - a1 * b2 * 2)};
+    r = dis(a, o);
+}
+
+il void work() {
+    o = e[1];
+    r = 0;
+    rep(i, 2, n) {
+        if (dis(o, e[i]) > r + eps) {
+            o = e[i];
+            r = 0;
+            rep(j, 1, i - 1) {
+                if (dis(o, e[j]) > r + eps) {
+                    o.x = (e[i].x + e[j].x) / 2;
+                    o.y = (e[i].y + e[j].y) / 2;
+                    r = dis(o, e[j]);
+                    rep(k, 1, j - 1) if (dis(o, e[k]) > r + eps) get(e[i], e[j], e[k]);
+                }
+            }
+        }
+        //    printf("%.10lf\n%.10lf %.10lf\n", r, o.x, o.y);
+    }
+}
+
+int main() {
+    n = read();
+    rep(i, 1, n) scanf("%lf%lf", &e[i].x, &e[i].y);
+    random_shuffle(e + 1, e + n + 1);
+    work();
+    printf("%.10lf\n%.10lf %.10lf", r, o.x, o.y);
+
+    return 0;
+}

Answers/V-Ball.cpp

@@ -0,0 +1,109 @@
+//
+//  main.cpp
+//  V-Ball
+//
+//  Created by Robert He on 2024/11/12.
+//
+
+#include <cstdio>
+#include <cstring>
+#include <iostream>
+using namespace std;
+using namespace chrono;
+
+const double Maxn = 1e9;
+const int N = 205, M = 8e4 + 5;
+const double eps = 1e-8;
+int pre[N], nxt[M], to[M], lst[N], fr[M], flw[M], Q[M];
+int n, s, t, T;
+bool vis[N];
+double a[N][N], b[N][N], cst[M], Ans, dis[N];
+
+template <class T>
+inline void CkMin(T &a, const T b) {
+    if (a > b)
+        a = b;
+}
+inline void Add(const int x, const int y, const int z, const double g) {
+    nxt[++T] = lst[x];
+    lst[x] = T;
+    to[T] = y;
+    fr[T] = x;
+    flw[T] = z;
+    cst[T] = g;
+    nxt[++T] = lst[y];
+    lst[y] = T;
+    to[T] = x;
+    fr[T] = y;
+    flw[T] = 0;
+    cst[T] = -g;
+}
+inline bool Bul() {
+    for (int i = s; i <= t; ++i)
+        dis[i] = -Maxn;
+    int te = 0, we = 1, x, y;
+    dis[Q[1] = s] = 0.0;
+    while (te < we) {
+        x = Q[++te];
+        vis[x] = false;
+        for (int i = lst[x]; i; i = nxt[i])
+            if (dis[y = to[i]] < dis[x] + cst[i] && flw[i]) {
+                dis[y] = dis[x] + cst[i];
+                pre[y] = i;
+                if (!vis[y]) {
+                    vis[y] = true;
+                    Q[++we] = y;
+                }
+            }
+    }
+    return dis[t] > -Maxn;
+}
+inline void Deal() {
+    int Mif = Maxn;
+    for (int i = pre[t]; i; i = pre[fr[i]])
+        CkMin(Mif, flw[i]);
+    for (int i = pre[t]; i; i = pre[fr[i]]) {
+        flw[i] -= Mif;
+        flw[i ^ 1] += Mif;
+        Ans += (double)Mif * cst[i];
+    }
+}
+inline bool check(const double mi) {
+    T = 1;
+    memset(lst, 0, sizeof(lst));
+    for (int i = 1; i <= n; ++i)
+        Add(s, i, 1, 0), Add(i + n, t, 1, 0);
+    for (int i = 1; i <= n; ++i)
+        for (int j = 1; j <= n; ++j)
+            Add(i, j + n, 1, a[i][j] - mi * b[i][j]);
+    Ans = 0.0;
+    while (Bul())
+        Deal();
+    return (Ans <= 0);
+}
+
+int main() {
+    scanf("%d", &n);
+    s = 0;
+    t = (n << 1) + 1;
+
+    for (int i = 1; i <= n; ++i)
+        for (int j = 1; j <= n; ++j)
+            scanf("%lf", &a[i][j]);
+
+    for (int i = 1; i <= n; ++i)
+        for (int j = 1; j <= n; ++j)
+            scanf("%lf", &b[i][j]);
+
+    double l = 0, r = 1e4;
+    while (r - l >= eps) {
+        double mid = (l + r) / 2;
+        (check(mid) ? r : l) = mid;
+    }
+
+
+
+    printf("%.6lf\n", l);
+
+    return 0;
+}

Checkpoints/FlingLikFullOfVim/1.in

@@ -0,0 +1,2 @@
+10
+decedbeeea

Checkpoints/FlingLikFullOfVim/1.out

@@ -0,0 +1 @@
+15

Checkpoints/FlingLikFullOfVim/10.in

@@ -0,0 +1 @@
+36423

Checkpoints/FlingLikFullOfVim/10.out

@@ -0,0 +1,2 @@
+50
+fdeeebcedefegegefbegeiagaedejejaceeegejebdaecbjeeh

Checkpoints/FlingLikFullOfVim/2.in

@@ -0,0 +1 @@
+67

Checkpoints/FlingLikFullOfVim/2.out

@@ -0,0 +1,2 @@
+100
+ccbdficdcaeaecgejchceeedcgfjchediaefjfdaechfjagcighadjeajhffdjeiedbafeaacjbihffgggdbacajbcggcfaaeidb