Competetive Programming and Contest course homeworks

Author: azecoder

Codeforces/1058A.cpp

@@ -0,0 +1,44 @@
+#include <bits/stdc++.h> // all c++ libraries
+
+#define faster_io ios_base::sync_with_stdio(false);cin.tie()
+#define MX 400005
+
+using namespace std;
+
+int N, x;
+string answer = "EASY";
+
+inline void read()
+{
+
+    cin >> N;
+    for( int i = 0; i < N; i++ ) {
+
+        cin >> x;
+        if(x)
+            answer = "HARD";
+
+    }
+
+}
+
+
+inline void solve()
+{
+
+    cout << answer;
+
+}
+
+
+
+int main()
+{
+
+	faster_io;
+
+	read();
+	solve();
+
+	return 0;
+}

Codeforces/1058B.cpp

@@ -0,0 +1,70 @@
+#include <bits/stdc++.h> // all c++ libraries
+
+#define faster_io ios_base::sync_with_stdio(false);cin.tie()
+#define MX 400005
+
+using namespace std;
+
+int N, D, M;
+struct {
+    int x, y;
+} CORD[105];
+
+inline void read()
+{
+
+    cin >> N >> D >> M;
+
+    for( int i = 1; i <= M; i++ ) {
+
+        cin >> CORD[i].x >> CORD[i].y;
+
+    }
+
+}
+
+
+inline void solve()
+{
+
+    int area = 2 * D * (N - D);
+//    cerr << "Area of the full area : " << area;
+
+    for ( int i = 1; i <= M; i++ ) {
+
+        int x = CORD[i].x;
+        int y = CORD[i].y;
+
+        int newArea =
+            abs(x * D - y * 0 + 0 * 0 - D * D + D * y - 0 * x) +
+            abs(x * 0 - y * D + D * (N-D) - N * 0 + N * y - (N-D) * x) +
+            abs(x * (N-D) - N * y + N * N - (N-D) * (N-D) + (N-D) * y - x * N) +
+            abs(x * N - y * (N-D) + (N-D) * D - N * 0 + 0 * y - D * x);
+
+        newArea /= 2;
+
+        if( area == newArea ) {
+            cout << "YES";
+        } else {
+            cout << "NO";
+        }
+        cout << "\n";
+
+//        cerr << "\n\t For grasshopper " << i << " : " << newArea;
+
+    }
+
+}
+
+
+
+int main()
+{
+
+	faster_io;
+
+	read();
+	solve();
+
+	return 0;
+}

Codeforces/1058C.cpp

@@ -0,0 +1,98 @@
+#include <bits/stdc++.h> // all c++ libraries
+
+// defines
+#define faster_io       ios_base::sync_with_stdio(false);cin.tie()
+#define range(i,a,b)    for(int i=a;i<=b;i++)
+#define rrange(i,a,b)   for(int i=a;i>=b;i--)
+#define MX              400005
+
+
+using namespace std;
+
+int N;
+string ticket_number;
+int sumArr[105][105];
+int answer = 0;
+
+inline void read()
+{
+
+    cin >> N >> ticket_number;
+
+}
+
+
+void dfs(int index, int value)
+{
+
+    cerr << index << "   ---  " << value << "\n\n";
+
+    if(sumArr[index][index] == value) {
+        if(index == N-1)
+            answer = 1;
+        dfs(index + 1, value);
+    }
+
+    range(i, index+1, N-1) {
+
+        cerr << "value : " << sumArr[index][i] << "\n";
+        if(sumArr[index][i] == value) {
+            if(i == N-1) {
+                answer = 1;
+                return;
+            } else {
+                dfs(i+1, value);
+            }
+        }
+
+    }
+    return;
+
+}
+
+
+inline void solve()
+{
+
+    range(i, 0, N-1) {
+
+        sumArr[i][i] = (int)ticket_number[i] - 48;
+        range(j, i+1, N-1) {
+
+            sumArr[i][j] = sumArr[i][j - 1] + (int)ticket_number[j] - 48;
+
+        }
+
+    }
+
+    if(N == 2) {
+        if(ticket_number[0] == ticket_number[1])
+            cout << "YES";
+        else
+            cout << "NO";
+        return;
+    }
+
+    range(i, 1, N-2) {
+        dfs(i, sumArr[0][i-1]);
+        if(answer) {
+            cout << "YES";
+            return;
+        }
+    }
+    cout << "NO";
+
+}
+
+
+
+int main()
+{
+
+	faster_io;
+
+	read();
+	solve();
+
+	return 0;
+}

Codeforces/1058D.cpp

@@ -0,0 +1,69 @@
+#include <bits/stdc++.h> // all c++ libraries
+
+// defines
+#define faster_io       ios_base::sync_with_stdio(false);cin.tie()
+#define range(i,a,b)    for(int i=a;i<=b;i++)
+#define rrange(i,a,b)   for(int i=a;i>=b;i--)
+#define MX              400005
+
+
+using namespace std;
+
+int N, M, K;
+
+inline void read()
+{
+
+    cin >> N >> M >> K;
+
+}
+
+
+inline void solve()
+{
+
+    if( (N * M * 2) % K ) {
+        cout << "NO";
+        return;
+    }
+    int area = N * M / K;
+    int double_area = 2 * area;
+    int sqrt_double_area = int(sqrt(double_area));
+
+    if(sqrt_double_area < 2) {
+        cout << "NO";
+        return;
+    }
+
+    int height = 0, width = 0;
+    range(i, 2, sqrt_double_area) {
+        if(double_area%i == 0) {
+            height = i;
+            width = double_area / i;
+            break;
+        }
+    }
+
+    if(height == 0 || width == 0) {
+        cout << "NO";
+        return;
+    }
+
+    cout << "YES\n0 0\n";
+    cout << "0 " << width << "\n";
+    cout << height << " 0\n";
+
+}
+
+
+
+int main()
+{
+
+	faster_io;
+
+	read();
+	solve();
+
+	return 0;
+}

Codeforces/141C.cpp

@@ -0,0 +1,80 @@
+#include <bits/stdc++.h> // all c++ libraries
+
+// defines
+#define faster_io       ios_base::sync_with_stdio(false);cin.tie()
+#define range(i,a,b)    for(int i=a;i<=b;i++)
+#define rrange(i,a,b)   for(int i=a;i>=b;i--)
+#define rangev(i,a)     for(int i=0;i<a.size();i++)
+#define rrangev(i,a)    for(int i=a.size()-1;i>=0;i--)
+#define clr(a)          memset(a, 0, sizeof(a))
+#define all(a)          a.begin(), a.end()
+#define mp              make_pair
+#define pb              push_back
+#define st              first
+#define nd              second
+#define MX              100005
+
+
+using namespace std;
+
+typedef long long ll;
+typedef vector <int> vi;
+typedef pair <int, int> pii;
+typedef vector <pii> vii;
+typedef pair <int, pii> pip;
+
+const ll INF = 1e9 + 100;
+const ll MOD = 1e9 + 7;
+
+
+int N;
+struct People {
+    string name;
+    int pos, height, new_height;
+    People(string _n, int _p, int _h) {
+        name = _n, pos = _p, height = _h;
+    }
+};
+
+bool comp(People A, People B) {
+    return A.height < B.height;
+}
+
+int main() {
+
+    faster_io;
+
+    cin >> N;
+    vector <People> arr;
+    range(i, 1, N) {
+        string n;
+        int h;
+        cin >> n >> h;
+        arr.pb( People(n, i, h) );
+    }
+    sort(all(arr), comp);
+
+    vi por;
+    rangev(i, arr) {
+        if(arr[i].height > i) {
+            cout << "-1";
+            return 0;
+        }
+        por.pb(i);
+        int x = por.size() - 1;
+        while(x > por.size() - 1 - arr[i].height) {
+            swap(por[x], por[x - 1]);
+            x--;
+        }
+    }
+
+    rangev(i, por) {
+        arr[por[i]].new_height = i + 1;
+    }
+
+    rangev(i, arr) {
+        cout << arr[i].name << " " << arr[i].new_height << "\n";
+    }
+
+    return 0;
+}