backup some contests and reorginize folders

Author: wiwitrifai

.gitignore

@@ -6,3 +6,4 @@
 *.in
 *.out
 /topcoder/*.txt
+/12unning

a2oj/acpc2016/a.cpp

@@ -0,0 +1,30 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int main() {
+  int t;
+  scanf("%d", &t);
+  while (t--) {
+    int n, q;
+    scanf("%d %d", &n, &q);
+    int l, r;
+    scanf("%d %d", &r, &l);
+    if (l < r)
+      swap(l, r);
+    for (int i= 1; i < n; i++) {
+      int a, b;
+      scanf("%d %d", &a, &b);
+      if (a > b)
+        swap(a, b);
+      l = min(b, l);
+      r = max(a, r);
+    }
+    while (q--) {
+      int a;
+      scanf("%d", &a);
+      puts((a <= r && a >= l) ? "YES" : "NOT SURE");
+    }
+  }
+  return 0;
+}

a2oj/acpc2016/c.cpp

@@ -0,0 +1,15 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int main() {
+  int t;
+  scanf("%d", &t);
+  while (t--) {
+    int g, c, e;
+    scanf("%d %d %d", &g, &c, &e);
+    int need = max(e-c, 0);
+    printf("%d\n", need * (2 * g - 1));
+  }
+  return 0;
+}

a2oj/acpc2016/e.cpp

@@ -0,0 +1,41 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int x[3], mx[3], ax[3];
+
+int main() {
+  int t;
+  scanf("%d", &t);
+  while (t--) {
+    for (int i = 0; i < 3; i++)
+      scanf("%d", x+i);
+    int n;
+    scanf("%d", &n);
+    if (n == 0) {
+      int ans  = 0;
+      for (int i = 0; i < 3; i++)
+        ans ^= (x[i]-1);
+      puts(ans ? "Alice" : "Bob");
+      continue;
+    }
+    for (int i= 0; i < 3; i++) {
+      scanf("%d", mx+i);
+      ax[i] = mx[i];
+    }
+    for (int i = 1; i < n; i++) {
+      int v[3];
+      for (int j = 0; j < 3; j++) {
+        scanf("%d", v+j);
+        mx[j] = min(mx[j], v[j]);
+        ax[j] = max(ax[j], v[j]);
+      }
+    }
+    int ans = 0;
+    for (int i = 0; i < 3; i++)
+      ans ^= (mx[i]-1) ^ (x[i] - ax[i]);
+    puts(ans ? "Alice" : "Bob");
+  }
+
+  return 0;
+}

a2oj/acpc2016/g.cpp

@@ -0,0 +1,62 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+const int inf = 1e7;
+int dp[2][4];
+
+int main() {
+  int t;
+  scanf("%d", &t);
+  while (t--) {
+    int n;
+    scanf("%d", &n);
+    memset(dp, 0, sizeof dp);
+    int last = 0;
+    char s[2][10];
+    scanf("%s", s[0]);
+    for (int i = 0; i < 4; i++)
+      dp[0][i] = inf;
+    dp[0][0] = 0;
+    for (int i = 1; i < n; i++) {  
+      int c = i & 1, b = !c;
+      scanf("%s", s[c]);
+      for (int j = 0; j < 4; j++) {
+        dp[c][j] = inf;
+        for (int k = 0; k < 4; k++) {
+          if (j == 3 && s[c][0] == s[b][0] && s[c][1] == s[b][1]) {
+            dp[c][j] = min(dp[c][j], dp[b][k]);
+          }
+          if (j == 2 && s[c][0] == s[b][0]) {
+            if ((k & 1) == 1)
+              dp[c][j] = min(dp[c][j], dp[b][k]);
+            else
+              dp[c][j] = min(dp[c][j], dp[b][k]+1);
+          }
+          if (j == 1 && s[c][1] == s[b][1]) {
+            if ((k & 2)== 2)
+              dp[c][j] = min(dp[c][j], dp[b][k]);
+            else
+              dp[c][j] = min(dp[c][j], dp[b][k]+1);
+          }
+          if (j == 0 && k == 0  && s[b][0] == s[b][1])
+            dp[c][j] = min(dp[c][j], dp[b][k]);
+          if (j == 0) {
+            dp[c][j] = min(dp[c][j], dp[b][k] + 2 - __builtin_popcount(k));
+          }
+        }
+        // cerr << dp[c][j] << " " ;
+      }
+      // cerr << i << endl;
+    }
+    int ans = inf, c = !(n & 1);
+    for (int i = 0; i < 4; i++) {
+      int tmp = dp[c][i] + 2 - __builtin_popcount(i);
+      if (i == 0 && s[c][0] == s[c][1])
+        tmp -= 2;
+      ans = min(ans, tmp);
+    }
+    printf("%d\n", ans);
+  }
+  return 0;
+}

a2oj/acpc2016/i.cpp

@@ -0,0 +1,72 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+const int N = 1024;
+
+pair< pair< int, int>, int > p[N];
+int vy[N], m, k;
+int cnt[N][105], dif[N], mid;
+
+bool add(int y, int z) {
+  for (int i = 0; i < m; i++) if (vy[i] <= y && y <= vy[i]+mid) {
+    cnt[i][z]++;
+    if (cnt[i][z] == 1) {
+      dif[i]++;
+      if (dif[i] == k)
+        return true;
+    }
+  }
+  return false;
+}
+void del(int y, int z) {
+  for (int i = 0; i < m; i++) if (vy[i] <= y && y <= vy[i]+mid) {
+    cnt[i][z]--;
+    if (cnt[i][z] == 0)
+      dif[i]--;
+  }
+}
+
+int main() {
+  int t;
+  scanf("%d", &t);
+  while (t--) {
+    int n;
+    scanf("%d %d", &n, &k);
+    for (int i = 0; i < n; i++) {
+      int x, y, z;
+      scanf("%d %d %d", &x, &y, &z);
+      p[i] = make_pair(make_pair(x, y), z);
+      vy[i] = y;
+    }
+    sort(vy, vy+n);
+    m = unique(vy, vy+n) - vy;
+    sort(p, p+n);
+
+    int l = 1, r = 2e8 + 5;
+    while (l < r) {
+      memset(cnt, 0, sizeof cnt);
+      memset(dif, 0, sizeof dif);
+      int id = 0;
+      mid = (l + r) >> 1;
+      bool ok = false;
+      for (int i = 0; i < n; i++) {
+        int x = p[i].first.first, y = p[i].first.second, z = p[i].second;
+        while (id < i && x - p[id].first.first > mid) {
+          del(p[id].first.second, p[id].second);
+          id++;
+        }
+        if (add(y, z)) {
+          ok = true;
+          break;
+        }
+      }
+      if (ok)
+        r = mid;
+      else
+        l = mid+1;
+    }
+    printf("%d\n", l);
+  }
+  return 0;
+}

a2oj/acpc2016/k.cpp

@@ -0,0 +1,14 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int main() {
+  int t;
+  cin >> t;
+  while (t--) {
+    long long n, k;
+    cin >> n >> k;
+    cout << n - (n+k)/(k+1) << endl;
+  }
+  return 0;
+}

a2oj/acpc2016/l.cpp

@@ -0,0 +1,21 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+const double pi = acos(-1);
+
+int main() {
+  int t;
+  cin >> t;
+  cout << fixed << setprecision(4);
+  while (t--) {
+    double n, s, r;
+    cin >> n >> s >> r;
+    double ans = (double)1 - (double)2.0 * r * tan(pi/n) / s;
+    if (ans < 0)
+      ans = 0;
+    ans = (double)1 - ans * ans;
+    cout << ans << endl;
+  }
+  return 0;
+}

codeforces/ainge-wf/E.cpp codeforces/Petrozavodsk_Summer_2011_2012/E.cpp

@@ -0,0 +1,39 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+pair< long long, long long> get(long long n) {
+  if (n == 1)
+    return make_pair(0, 0);
+  long long l = 0, r = 31000;
+  while (l < r) {
+    long long mid = (l + r + 1) >> 1;
+    long long k = mid * 2 + 1;
+    if (k * k < n)
+      l = mid;
+    else
+      r = mid - 1;
+  }
+  long long k = l + l + 1;
+  n -= k * k;
+  if (n <= k+1)
+    return make_pair(-(k+1)/2 + n, (k+1)/2);
+  n -= k+1;
+  if (n <= k+1)
+    return make_pair((k+1)/2, (k+1)/2-n);
+  n -= k+1;
+  if (n <= k+1)
+    return make_pair((k+1)/2-n, -(k+1)/2);
+  n -= k+1;
+  assert(n <= k+1);
+  return make_pair(-(k+1)/2, -(k+1)/2+n);
+}
+
+int main() {
+  long long a, b;
+  cin >> a >> b;
+  pair< long long, long long> aa = get(a), bb = get(b);
+  cout << abs(aa.first - bb.first) + abs(aa.second - bb.second) << endl;
+
+  return 0;
+}

codeforces/ainge-wf/b.cpp codeforces/Petrozavodsk_Summer_2011_2012/b.cpp

@@ -0,0 +1,32 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+const int N = 1e6 + 5;
+
+vector<pair<int, int>> edge[N];   // ke, id
+vector<int> ans;
+
+void dfs(int now, int st) {
+  for (auto it : edge[now]) {
+    if (it.second <= st) break;
+    ans.push_back(it.first);
+    if (ans.size() > N) break;
+    dfs(it.first, it.second);
+  }
+}
+
+int main() {
+  int n, l, r;
+  scanf("%d %d %d", &n, &l, &r);
+  for (int i = 0; i < n; i++) {
+    int u, v;
+    scanf("%d %d", &u, &v);
+    edge[u].emplace_back(v, i);
+  }
+  for (int i = 0; i < N; i++) reverse(edge[i].begin(), edge[i].end());
+  ans.push_back(0);
+  dfs(0, -1);
+  for (int i = l; i < r; i++) printf("%d ", ans[i % ans.size()]);
+  return 0;
+}