Initial commit

Author: WEGFan

.clang-format

@@ -0,0 +1,14 @@
+BasedOnStyle: LLVM
+UseTab: Never
+IndentWidth: 4
+TabWidth: 4
+BreakBeforeBraces: Allman
+AllowShortIfStatementsOnASingleLine: false
+ColumnLimit: 0
+AccessModifierOffset: -2
+AlignEscapedNewlines: DontAlign
+FixNamespaceComments: false
+IndentCaseLabels: true
+NamespaceIndentation: All
+SortIncludes: false
+AlignTrailingComments: false

.gitignore

@@ -0,0 +1,5 @@
+*.exe
+*.class
+*.txt
+!problems.txt
+.vscode

contests/2009-6th-Zhejiang-Provincial/ZOJ 3202 A.cpp

@@ -0,0 +1,33 @@
+#include <iostream>
+#include <algorithm>
+using namespace std;
+
+struct Node
+{
+    int idx, val;
+};
+
+int cmp(Node &a, Node &b)
+{
+    return a.val > b.val;
+}
+
+int main()
+{
+    int t;
+    cin >> t;
+    while (t--)
+    {
+        int n;
+        Node arr[105];
+        cin >> n;
+        for (int i = 0; i < n; i++)
+        {
+            cin >> arr[i].val;
+            arr[i].idx = i + 1;
+        }
+        sort(arr, arr + n, cmp);
+        cout << arr[0].idx << ' ' << arr[1].val << endl;
+    }
+    return 0;
+}

contests/2009-6th-Zhejiang-Provincial/ZOJ 3203 B.cpp

@@ -0,0 +1,31 @@
+#include <iostream>
+#include <cstdio>
+#include <cmath>
+using namespace std;
+
+int main()
+{
+    int t;
+    cin >> t;
+    while (t--)
+    {
+        double H, h, D;
+        scanf("%lf %lf %lf", &H, &h, &D);
+        double ans = sqrt((H - h) * D);
+        double sum = (H - h) * D / H;
+        if (ans >= D)
+        {
+            printf("%.3lf\n", h);
+        }
+        else if (ans < sum)
+        {
+            printf("%.3lf\n", h * D / H);
+        }
+        else
+        {
+            double q = H + D - ans - (H - h) * D / ans;
+            printf("%.3lf\n", q);
+        }
+    }
+    return 0;
+}

contests/2009-6th-Zhejiang-Provincial/ZOJ 3207 F.cpp

@@ -0,0 +1,35 @@
+#include <iostream>
+#include <string>
+#include <map>
+using namespace std;
+
+int main()
+{
+    int t;
+    cin >> t;
+    map<string, int> m;
+    while (t--)
+    {
+        string s;
+        cin >> s;
+        m[s]++;
+    }
+    int k;
+    cin >> k;
+    while (k--)
+    {
+        int n, cnt = 0;
+        cin >> n;
+        while (n--)
+        {
+            string ss;
+            cin >> ss;
+            if (m[ss] > 0)
+            {
+                cnt++;
+            }
+        }
+        cout << cnt << endl;
+    }
+    return 0;
+}

contests/2009-6th-Zhejiang-Provincial/ZOJ 3210 I.cpp

@@ -0,0 +1,64 @@
+#include <iostream>
+#include <algorithm>
+using namespace std;
+
+int main()
+{
+    int t;
+    cin >> t;
+    while (t--)
+    {
+        int n;
+        cin >> n;
+        int in[150], out[150];
+        for (int i = 0; i < n; i++)
+        {
+            cin >> in[i];
+        }
+        for (int i = 0; i < n; i++)
+        {
+            cin >> out[i];
+        }
+        int flag1 = 1, flag2 = 1;
+        for (int i = 0; i < n; i++)
+        {
+            if (in[i] != out[i])
+            {
+                flag1 = 0;
+                break;
+            }
+        }
+        reverse(out, out + n);
+        for (int i = 0; i < n; i++)
+        {
+            if (in[i] != out[i])
+            {
+                flag2 = 0;
+                break;
+            }
+        }
+        if (flag1)
+        {
+            if (flag2)
+            {
+                cout << "both" << endl;
+            }
+            else
+            {
+                cout << "queue" << endl;
+            }
+        }
+        else
+        {
+            if (flag2)
+            {
+                cout << "stack" << endl;
+            }
+            else
+            {
+                cout << "neither" << endl;
+            }
+        }
+    }
+    return 0;
+}

contests/2009-6th-Zhejiang-Provincial/ZOJ 3211 J.cpp

@@ -0,0 +1,45 @@
+#include <iostream>
+#include <algorithm>
+using namespace std;
+
+int dp[300][300];
+
+struct Node
+{
+    int a, b;
+};
+
+bool cmp(Node &x, Node &y)
+{
+    return x.b < y.b;
+}
+
+int main()
+{
+    int t;
+    cin >> t;
+    while (t--)
+    {
+        Node tree[300];
+        int n, m;
+        cin >> n >> m;
+        for (int i = 1; i <= n; i++)
+        {
+            cin >> tree[i].a;
+        }
+        for (int i = 1; i <= n; i++)
+        {
+            cin >> tree[i].b;
+        }
+        sort(tree + 1, tree + n + 1, cmp);
+        for (int i = 1; i <= n; i++)
+        {
+            for (int j = 1; j <= m; j++)
+            {
+                dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - 1] + tree[i].b * (j - 1) + tree[i].a);
+            }
+        }
+        cout << dp[n][m] << endl;
+    }
+    return 0;
+}

contests/2009-6th-Zhejiang-Provincial/ZOJ 3212 K.cpp

@@ -0,0 +1,51 @@
+#include <iostream>
+#include <cstdio>
+using namespace std;
+
+int main()
+{
+    int t;
+    scanf("%d", &t);
+    while (t--)
+    {
+        int area[20][20];
+        for (int i = 0; i < 20; i++)
+        {
+            for (int j = 0; j < 20; j++)
+            {
+                area[i][j] = 1;
+            }
+        }
+        int n, m, k;
+        scanf("%d %d %d", &n, &m, &k);
+        for (int i = 1; i < n - 1; i++)
+        {
+            for (int j = 1; j < m - 1; j++)
+            {
+                if (k == 0)
+                {
+                    break;
+                }
+                area[i][j] = 0;
+                area[i - 1][j] = 0;
+                area[i + 1][j] = 0;
+                area[i][j - 1] = 0;
+                area[i][j + 1] = 0;
+                k--;
+            }
+        }
+        for (int i = 0; i < n; i++)
+        {
+            for (int j = 0; j < m; j++)
+            {
+                printf("%d", area[i][j]);
+                if (j != m - 1)
+                {
+                    printf(" ");
+                }
+            }
+            printf("\n");
+        }
+    }
+    return 0;
+}

contests/2010-Chengdu-Regional/UVALive 5006 C.cpp

@@ -0,0 +1,51 @@
+#include <iostream>
+#include <algorithm>
+
+using namespace std;
+
+int arr[107], brr[107];
+
+int solve(int a, int b)
+{
+    int cnt = 0;
+    for (int i = 1; i <= max(a, b); i <<= 1)
+    {
+        cnt += ((a & i) != (b & i)) ? 1 : 0;
+    }
+    return cnt;
+}
+
+int main()
+{
+    int t;
+    cin >> t;
+    while (t--)
+    {
+        int m, n;
+        cin >> m >> n;
+        for (int i = 0; i < m; i++)
+        {
+            cin >> arr[i];
+        }
+        for (int i = 0; i < n; i++)
+        {
+            cin >> brr[i];
+        }
+        sort(arr, arr + m);
+        for (int i = 0; i < n; i++)
+        {
+            int ans = 0x3f3f3f3f, pos = -1;
+            for (int j = 0; j < m; j++)
+            {
+                int tmp = solve(arr[j], brr[i]);
+                if (tmp < ans)
+                {
+                    ans = tmp;
+                    pos = j;
+                }
+            }
+            cout << arr[pos] << endl;
+        }
+    }
+    return 0;
+}

contests/2010-Chengdu-Regional/UVALive 5009 F.cpp

@@ -0,0 +1,55 @@
+#include <iostream>
+#include <cstdio>
+#include <algorithm>
+
+using namespace std;
+
+const double eps = 1e-15;
+const double INF = 1e15;
+
+int arr[100007], brr[100007], crr[100007];
+int n;
+
+double calc(double x)
+{
+    double ans = -INF;
+    for (int i = 0; i < n; i++)
+    {
+        ans = max(ans, arr[i] * x * x + brr[i] * x + crr[i]);
+    }
+    return ans;
+}
+
+double search()
+{
+    double l = 0, r = 1000;
+    while (l + eps < r)
+    {
+        double mid1 = l + (r - l) / 3, mid2 = r - (r - l) / 3;
+        if (calc(mid1) > calc(mid2))
+        {
+            l = mid1;
+        }
+        else
+        {
+            r = mid2;
+        }
+    }
+    return l;
+}
+
+int main()
+{
+    int t;
+    scanf("%d", &t);
+    while (t--)
+    {
+        scanf("%d", &n);
+        for (int i = 0; i < n; i++)
+        {
+            scanf("%d %d %d", &arr[i], &brr[i], &crr[i]);
+        }
+        printf("%.4f\n", calc(search()));
+    }
+    return 0;
+}