Done CodeForces Round 630(div2) 2 questions

Author: zh-plus

Codeforces/CMakeLists.txt

@@ -1,6 +1,7 @@
-set(FOLDER_NAME Round629_div3)
+set(FOLDER_NAME Round630_div2)
 
 add_executable(A ${FOLDER_NAME}/A.cpp)
 add_executable(B ${FOLDER_NAME}/B.cpp)
 add_executable(C ${FOLDER_NAME}/C.cpp)
+add_executable(D ${FOLDER_NAME}/D.cpp)
 add_executable(solving ${FOLDER_NAME}/solving.cpp)

Codeforces/Round630_div2/A.cpp

@@ -0,0 +1,59 @@
+//
+// Created by 10578 on 3/31/2020.
+//
+
+#include <vector>
+#include <iostream>
+#include <fstream>
+#include <sstream>
+#include <algorithm>
+
+#define BOOST_IO ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
+#define ALTER_IN(name) fstream _in(name); cin.rdbuf(_in.rdbuf());
+//#define LOCAL
+
+using namespace std;
+
+
+int main() {
+    BOOST_IO;
+
+#ifdef LOCAL
+    ALTER_IN("../in.txt");
+#endif
+
+    int T;
+    cin >> T;
+    int a, b, c, d;
+    int x, y, x1, y1, x2, y2;
+    while (T--) {
+        cin >> a >> b >> c >> d;
+        cin >> x >> y >> x1 >> y1 >> x2 >> y2;
+
+        int horizontal = b - a;
+        int vertical = d - c;
+
+        if (y2 - y == 0 && vertical > 0 ||
+            y1 - y == 0 && vertical < 0 ||
+            x2 - x == 0 && horizontal > 0 ||
+            x1 - x == 0 && horizontal < 0) {
+            cout << "NO" << endl;
+            continue;
+        }
+
+        int result_x = x + horizontal;
+        int result_y = y + vertical;
+        bool result = !(result_x > x2 || result_x < x1 || result_y > y2 || result_y < y1);
+
+        if (result) {
+            if (y2 - y == 0 && y1 - y == 0 && c != 0 && d != 0 ||
+                x2 - x == 0 && x1 - x == 0 && a != 0 && b != 0) {
+                    result = false;
+            }
+        }
+
+        cout << (result ? "YES" : "NO") << endl;
+    }
+
+    return 0;
+}

Codeforces/Round630_div2/B.cpp

@@ -0,0 +1,81 @@
+//
+// Created by 10578 on 3/31/2020.
+//
+
+#include <vector>
+#include <iostream>
+#include <fstream>
+#include <numeric>
+#include <algorithm>
+#include <iterator>
+#include <set>
+#include <map>
+
+#define BOOST_IO ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
+#define ALTER_IN(name) fstream _in(name); cin.rdbuf(_in.rdbuf());
+//#define LOCAL
+
+using namespace std;
+
+
+int get_divisor(int n) {
+    for (int i = 2; i <= (n >> 1); ++i) {
+        if (n % i == 0) {
+            return i;
+        }
+    }
+
+    return 1;
+}
+
+void solve(int n, vector<int> &v) {
+    set<int> color_set;
+    vector<int> dividers(v.size());
+
+    for (int i = 0; i < v.size(); ++i) {
+        dividers[i] = get_divisor(v[i]);
+        color_set.insert(dividers[i]);
+    }
+
+    map<int, int> divider_to_color;
+    int color = 1;
+    for (auto &&divider : dividers) {
+        if (divider_to_color.find(divider) == divider_to_color.end()) {
+            divider_to_color[divider] = color++; // color from 1 - size
+        }
+    }
+
+    cout << divider_to_color.size() << endl;
+
+    for (auto &&x: dividers) {
+        cout << divider_to_color[x] << " ";
+    }
+    cout << endl;
+
+//    copy(colors.begin(), colors.end(), ostream_iterator<int>(cout, " "));
+}
+
+
+int main() {
+    BOOST_IO;
+
+#ifdef LOCAL
+    ALTER_IN("../in.txt");
+#endif
+
+    int T = 0;
+    cin >> T;
+    int n;
+    vector<int> v;
+    while (T--) {
+        cin >> n;
+        v.resize(n);
+        for (int i = 0; i < n; ++i) {
+            cin >> v[i];
+        }
+
+        solve(n, v);
+    }
+
+    return 0;
+}

Codeforces/Round630_div2/solving.cpp

@@ -0,0 +1,58 @@
+//
+// Created by 10578 on 3/31/2020.
+//
+
+#include <vector>
+#include <iostream>
+#include <fstream>
+#include <algorithm>
+
+#define BOOST_IO ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
+#define ALTER_IN(name) fstream _in(name); cin.rdbuf(_in.rdbuf());
+#define LOCAL
+
+using namespace std;
+
+int solve(vector<int> &A, vector<int> &B) {
+    for (int i = 0; i < B.size(); ++i) {
+        A[i] -= B[i];
+    }
+
+    int count = 0;
+    int sz = A.size();
+    for (int i = 0; i < sz; ++i) {
+        for (int j = i + 1; j < sz; ++j) {
+            if (A[i] + A[j] > 0) {
+                ++count;
+            }
+        }
+    }
+
+    return count;
+}
+
+
+int main() {
+    BOOST_IO;
+
+#ifdef LOCAL
+    ALTER_IN("../in.txt");
+#endif
+
+    int n = 0;
+    cin >> n;
+    vector<int> A(n);
+    vector<int> B(n);
+
+    for (int i = 0; i < n; ++i) {
+        cin >> A[i];
+    }
+
+    for (int i = 0; i < n; ++i) {
+        cin >> B[i];
+    }
+
+    cout << solve(A, B) << endl;
+
+    return 0;
+}