USACO Section 2.1

好久没补坑了， 擦...

The Castle

城堡里有一些房间， 问房间数，最大的房间， 拆掉一面墙后最大的房间， 拆哪个墙。

简单的地图处理和dfs

#include <bits/stdc++.h>

using namespace std;

int w[55][55][4];
int c[55][55];
int v[10000];
int dx[] = {0, -1, 0, 1}, dy[] = {-1, 0, 1, 0};
char dr[] = "WNES";
int n, m, t;

int dfs(int x, int y, int t) {
  if (c[x][y]) return 0;
  int ans = 1;
  c[x][y] = t;
  for (int i = 0; i < 4; i++) {
    if (w[x][y][i])
      ans += dfs(x + dx[i], y + dy[i], t);
  }
  return ans;
}

int main() {
  freopen("castle.in", "r", stdin);
  freopen("castle.out", "w", stdout);
  scanf("%d %d", &m, &n);
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      int x;
      scanf("%d", &x);
      for (int k = 0; k < 4; k++) {
        w[i][j][k] = !(x & 1 << k);
      }
    }
  }
  int mx = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (c[i][j]) continue;
      t++;
      v[t] = dfs(i, j, t);
      mx = max(mx, v[t]);
    }
  }
  printf("%d\n%d\n", t, mx);
  mx = 0;
  int x, y, d;
  for (int j = 0; j < m; j++) {
    for (int i = n - 1; ~ i; i--) {
      for (int k = 1; k < 3; k++) {
        if (w[i][j][k])
          continue;
        int a = c[i][j], b = c[i + dx[k]][j + dy[k]];
        if (a ^ b && v[a] + v[b] > mx) {
          mx = v[a] + v[b];
          x = i;
          y = j;
          d = k;
        }
      }
    }
  }
  printf("%d\n%d %d %c\n", mx, x + 1, y + 1, dr[d]);
}

Ordered Fractions

从小到大输出分子和分母是由0~N组成的分数，需要化简输出。

写个分数的struct sort一下。

#include <bits/stdc++.h>

using namespace std;

const int N = 165 * 90;

struct Fraction {
  int n, d;

  Fraction() {}

  Fraction(int n, int d) : n(n), d(d) {}

  bool operator == (const Fraction & a) const {
    return n * a.d == a.n * d;
  }

  bool operator < (const Fraction & a) const {
    return n * a.d == a.n * d ? d < a.d : n * a.d < a.n * d;
  }

  void print() {
    printf("%d/%d\n", n, d);
  }

} f[N];

int main() {
  freopen("frac1.in", "r", stdin);
  freopen("frac1.out", "w", stdout);
  int n, m = 0;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j <= i; j++) {
      f[m++] = Fraction(j, i);
    }
  }
  sort(f, f + m);
  f[0].print();
  for (int i = 1; i < m; i++) {
    if (i && !(f[i] == f[i - 1])) {
      f[i].print();
    }
  }
}

Sorting a Three-Valued Sequence

有N个数，值为1，2，3，求最少的两两交换次数使他们有序。

水题...

#include <bits/stdc++.h>

using namespace std;

int a[1005], b[4], d[4][4];

int main() {
  freopen("sort3.in", "r", stdin);
  freopen("sort3.out", "w", stdout);
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", a + i);
    b[a[i]]++;
  }
  b[2] += b[1]; b[3] += b[2];
  for (int i = 0, p = 1; i < n; i++) {
    if (i == b[p]) p++;
    d[p][a[i]]++;
  }
  int ans = d[1][2] + d[1][3] + d[2][3] + max(0, d[2][1] - d[1][2]);
  printf("%d\n", ans);
}

Healthy Holsteins

奶牛每天需要vi量的i型维生素，每种饲料包含Gi量的i型维生素，问最少需要吃多少种饲料。

状压dp

#include <bits/stdc++.h>

using namespace std;

int m, n;

struct node {
  int w[25];
  node() {
    memset(w, 0, sizeof w);
  }
  void inline read() {
    for (int i = 0; i < m; i++) scanf("%d", w + i);
  }
  void inline operator += (node a) {
    for (int i = 0; i < m; i++) w[i] += a.w[i];
  }
};

node need, g[16], dp[1 << 16];

bool ok(node a) {
  for (int i = 0; i < m; i++) if (a.w[i] < need.w[i]) return 0;
  return 1;
}

void print(int p) {
  for (int t = 0, k = 1; t <= n; t++, k <<= 1) {
    if (p & k) printf(" %d", t);
  }
  puts("");
}

int main() {
  freopen("holstein.in", "r", stdin);
  freopen("holstein.out", "w", stdout);
  scanf("%d", &m);
  need.read();
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) g[i].read();
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < (1 << n); j++) {
      if (__builtin_popcount(j) != i - 1) continue;
      for (int k = 1; k <= n; k++) {
        if (1 << k & j) continue;
        int p = 1 << k | j;
        dp[p] = dp[j];
        dp[p] += g[k];
        if (ok(dp[p])) {
          printf("%d", i);
          print(p);
          return 0;
        }
      }
    }
  }
}

Hamming Codes

求N个B bit的数，他们之间两两的Hamming distance ≥ D (Hamming distance 是指不同位的个数)

数据很小， 暴力就好

#include <bits/stdc++.h>

using namespace std;

int n, m, d, a[66], b, c;

bool dis(int a, int b) {
  int ans = 0;
  for (int i = 0; i < m; i++) {
    ans += (a ^ b) & 1;
    a >>= 1; b >>= 1;
  }
  return ans >= d;
}

int main() {
  freopen("hamming.in", "r", stdin);
  freopen("hamming.out", "w", stdout);
  scanf("%d %d %d", &n, &m, &d);
  a[b++] = c++;
  for (int i = 1; i < n; i++) {
    for (; c < 256; c++) {
      int flag = 1;
      for (int j = 0; j < b; j++) {
        if (!dis(c, a[j])) {
          flag = 0; break;
        }
      }
      if (flag) {
        a[b++] = c++; break;
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    printf("%d", a[i - 1]);
    putchar(i == n || i % 10 == 0 ? '\n' : ' ');
  }
}