Add round 379 from CF

Author: jhonber

codeforces/Codeforces Round #379 (Div. 2)/A.cpp

@@ -0,0 +1,26 @@
+// http://codeforces.com/contest/734/problem/A
+
+#include<bits/stdc++.h>
+using namespace std;
+
+#define endl '\n'
+#define D(x) cout << #x << " = " << (x) << endl;
+
+int main() {
+  int n;
+  cin >> n;
+
+  string s;
+  cin >> s;
+
+  int cnt = 0;
+  for (int i = 0; i < s.size(); ++i) {
+    if (s[i] == 'D') cnt ++;
+  }
+
+  if (cnt > s.size() - cnt) cout << "Danik" << endl;
+  else if ( cnt < s.size() - cnt) cout << "Anton" << endl;
+  else cout << "Friendship" << endl;
+
+  return 0;
+}

codeforces/Codeforces Round #379 (Div. 2)/B.cpp

@@ -0,0 +1,25 @@
+// http://codeforces.com/contest/734/problem/B
+
+#include<bits/stdc++.h>
+using namespace std;
+
+#define endl '\n'
+#define D(x) cout << #x << " = " << (x) << endl;
+
+int main() {
+  int a, b, c, d;
+  cin >> a >> b >> c >> d;
+
+  long long mm = min(a, min(c, d));
+  long long sum = mm * 256LL;
+  a -= mm;
+  c -= mm;
+  d -= mm;
+
+  mm = min(a, b);
+  sum += mm * 32LL;
+
+  cout << sum << endl;
+
+  return 0;
+}

codeforces/Codeforces Round #379 (Div. 2)/D.cpp

@@ -0,0 +1,107 @@
+// http://codeforces.com/contest/734/problem/D
+
+#include<bits/stdc++.h>
+using namespace std;
+
+#define endl '\n'
+#define D(x) cout << #x << " = " << (x) << endl;
+
+const long long inf = LLONG_MAX;
+
+struct Piece {
+  long long x, y, t;
+  Piece () {}
+  Piece (long long a, long long b, long long c) {
+    x = a;
+    y = b;
+    t = c;
+  }
+};
+
+long long dist (long long x1, long long y1, long long x2, long long y2) {
+  return (x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1);
+}
+
+long long f (long long x, long long y, long long x2, long long y2, long long type, long long k) {
+  long long d = dist (x, y, x2, y2);
+
+  if (type == 1) if (x + k == x2 && y + k == y2) return d;
+  if (type == 2) if (x - k == x2 && y - k == y2) return d;
+  if (type == 3) if (x + k == x2 && y - k == y2) return d;
+  if (type == 4) if (x - k == x2 && y + k == y2) return d;
+
+  if (type == 5) if (x - k == x2 && y == y2) return d;
+  if (type == 6) if (x + k == x2 && y == y2) return d;
+  if (type == 7) if (x == x2 && y - k == y2) return d;
+  if (type == 8) if (x == x2 && y + k == y2) return d;
+
+  return inf;
+}
+
+int main() {
+  int n;
+  cin >> n;
+
+  long long x, y;
+  cin >> x >> y;
+
+  vector<Piece> v;
+  for (int  i = 0; i < n; ++i) {
+    char op;
+    cin >> op;
+
+    long long x2, y2;
+    cin >> x2 >> y2;
+    if (op == 'Q') {
+      v.push_back(Piece(x2, y2, 0));
+    }
+    else if (op == 'B') {
+      v.push_back(Piece(x2, y2, 1));
+    }
+    else {
+      v.push_back(Piece(x2, y2, 2));
+    }
+  }
+
+  for (int j = 1; j <= 8; ++j) {
+    long long mm = inf;
+    bool found = false;
+    Piece p;
+    for (int i = 0; i < n; ++i) {
+      long long a = f(x, y, v[i].x, v[i].y, j, abs(v[i].y - y));
+      long long b = f(x, y, v[i].x, v[i].y, j, abs(v[i].x - x));
+      long long tmp = min(a, b);
+
+      if (tmp < mm) {
+        mm = tmp;
+        p = v[i];
+        found = true;
+      }
+    }
+
+    bool paila = false;
+    if (found) {
+      for (int i = 1; i <= 8; ++i) {
+        if (p.t == 1 && i > 4) continue;
+        if (p.t == 2 && i < 5) continue;
+
+        long long a = f(p.x, p.y, x, y, i, abs(p.y - y));
+        long long b = f(p.x, p.y, x, y, i, abs(p.x - x));
+        long long tmp = min(a, b);
+        if (tmp != inf) {
+          paila = true;
+          break;
+        }
+      }
+    }
+
+    if (paila) {
+      cout << "YES" << endl;
+      return 0;
+    }
+  }
+
+  cout << "NO" << endl;
+
+  return 0;
+}

codeforces/data.db

@@ -928,4 +928,8 @@
 24357587
 24539441
 24537637
-24537148
+24537148
+24577323
+24578678
+24577407
+24578991