记录编号 444957 评测结果 AAAAAAAAAAAAAAAAAAAA
题目名称 [NOIP 2016]愤怒的小鸟 最终得分 100
用户昵称 GravatarkZime 是否通过 通过
代码语言 C++ 运行时间 0.395 s
提交时间 2017-09-04 19:36:19 内存使用 1.31 MiB
显示代码纯文本
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. const int MAXN = 18, INF = 0x3f3f3f3f;
  5.  
  6. int n, m, dp[1 << MAXN], ss[MAXN][MAXN];
  7. double x[MAXN], y[MAXN];
  8.  
  9. inline void cal(int i, int j, double &a, double &b) {
  10. a = (y[i] - y[j] * (x[i] / x[j])) / (x[i] * x[i] - x[i] * x[j]);
  11. b = (y[i] - a * x[i] * x[i]) / x[i];
  12. }
  13.  
  14. inline int dcmp(const double &a, const double &b) {
  15. return fabs(a - b) < 1e-8 ? 0 : (a < b ? -1 : 1);
  16. }
  17.  
  18. void process() {
  19. double a, b;
  20. for(int i = 0; i < n; ++i) {
  21. for(int j = i + 1; j < n; ++j) {
  22. cal(i, j, a, b);
  23. if(dcmp(a, 0) != -1) { // a >= 0
  24. ss[i][j] = (1 << n) - 1; // ss[i][j] = 111...111;
  25. continue;
  26. }
  27. ss[i][j] = 0; // a < 0
  28. for(int k = 0; k < n; ++k) {
  29. if(dcmp(a * x[k] * x[k] + b * x[k], y[k]) != 0) { // a, b can't shoot the pig k
  30. ss[i][j] |= (1 << k);
  31. }
  32. }
  33. }
  34.  
  35. }
  36. }
  37.  
  38. inline void tension(int &a, const int &b) { if (b < a) a = b; } // a = min(a, b);
  39.  
  40. void solve() {
  41. dp[0] = 0;
  42. for(register int s = 1, i, j; s < (1 << n); ++s) {
  43. dp[s] = INF;
  44. i = __builtin_ctz(s); // __builtin_ctz(10011000) = 3 the place of first 1 - 1
  45. tension(dp[s], dp[s ^ (1 << i)] + 1);
  46. for(j = i + 1; j < n; ++j) {
  47. if((s >> j) & 1)
  48. tension(dp[s], dp[s & ss[i][j]] + 1);
  49. }
  50. }
  51. printf("%d\n", dp[(1 << n) - 1]);
  52. }
  53.  
  54. int main() {
  55. #ifndef LOCAL
  56. freopen("angrybirds.in", "r", stdin);
  57. freopen("angrybirds.out", "w", stdout);
  58. #endif
  59. int casenum;
  60. scanf("%d", &casenum);
  61. for(int t = 0; t < casenum; ++t) {
  62. scanf("%d%d", &n, &m);
  63. for(int i = 0; i < n; ++i) {
  64. scanf("%lf%lf", x + i, y + i);
  65. }
  66. process();
  67. solve();
  68. }
  69. }
  70.