oj.uz

Submission #43543

# Submission time Handle Problem Language Result Execution time Memory
43543 2018-03-17T13:18:49 Z wxh010910 Snake Escaping (JOI18_snake_escaping) C++14
100 / 100
 1311 ms 65536 KB 
#include <bits/stdc++.h>

using namespace std;

#define X first
#define Y second
#define mp make_pair
#define pb push_back
#define Debug(...) fprintf(stderr, __VA_ARGS__)

typedef long long LL;
typedef long double LD;
typedef unsigned int uint;
typedef pair <int, int> pii;
typedef unsigned long long uLL;

template <typename T> inline void Read(T &x) {
  char c = getchar();
  bool f = false;
  for (x = 0; !isdigit(c); c = getchar()) {
    if (c == '-') {
      f = true;
    }
  }
  for (; isdigit(c); c = getchar()) {
    x = x * 10 + c - '0';
  }
  if (f) {
    x = -x;
  }
}

template <typename T> inline bool CheckMax(T &a, const T &b) {
  return a < b ? a = b, true : false;
}

template <typename T> inline bool CheckMin(T &a, const T &b) {
  return a > b ? a = b, true : false;
}

const int N = 1048580;

int n, m, a[N], b[N];
char s[N], t[N];

int main() {
#ifdef wxh010910
  freopen("d.in", "r", stdin);
#endif
  Read(n), Read(m);
  scanf("%s", s);
  for (int i = 0; i < 1 << n; ++i) {
    a[i] = b[i] = s[i] - '0';
  }
  for (int i = 1; i < 1 << n; i <<= 1) {
    for (int j = 0; j < 1 << n; j += i << 1) {
      for (int k = 0; k < i; ++k) {
        a[j + k] += a[j + k + i], b[j + k + i] += b[j + k];
      }
    }
  }
  while (m--) {
    int x = 0, y = 0, z = 0, ans = 0;
    scanf("%s", t);
    for (int i = 0; i < n; ++i) {
      if (t[i] == '0') {
        x |= 1 << n - i - 1;
      } else if (t[i] == '1') {
        y |= 1 << n - i - 1;
      } else {
        z |= 1 << n - i - 1;
      }
    }
    if (__builtin_popcount(x) <= 6) {
      for (int i = x; ; i = i - 1 & x) {
        if (__builtin_popcount(i) & 1) {
          ans -= a[y | i];
        } else {
          ans += a[y | i];
        }
        if (!i) {
          break;
        }
      }
    } else if (__builtin_popcount(y) <= 6) {
      for (int i = y; ; i = i - 1 & y) {
        if (__builtin_popcount(i ^ y) & 1) {
          ans -= b[z | i];
        } else {
          ans += b[z | i];
        }
        if (!i) {
          break;
        }
      }
    } else {
      for (int i = z; ; i = i - 1 & z) {
        ans += s[y | i] - '0';
        if (!i) {
          break;
        }
      }
    }
    printf("%d\n", ans);
  }
#ifdef wxh010910
  Debug("My Time: %.3lfms\n", (double)clock() / CLOCKS_PER_SEC);
#endif
  return 0;
}

Compilation message

snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:67:25: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
         x |= 1 << n - i - 1;
                         ^
snake_escaping.cpp:69:25: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
         y |= 1 << n - i - 1;
                         ^
snake_escaping.cpp:71:25: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
         z |= 1 << n - i - 1;
                         ^
snake_escaping.cpp:75:31: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
       for (int i = x; ; i = i - 1 & x) {
                               ^
snake_escaping.cpp:86:31: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
       for (int i = y; ; i = i - 1 & y) {
                               ^
snake_escaping.cpp:97:31: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
       for (int i = z; ; i = i - 1 & z) {
                               ^
snake_escaping.cpp:51:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s", s);
                 ^
snake_escaping.cpp:64:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%s", t);
                   ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 568 KB Output is correct
4 Correct 2 ms 568 KB Output is correct
5 Correct 2 ms 600 KB Output is correct
6 Correct 2 ms 692 KB Output is correct
7 Correct 2 ms 692 KB Output is correct
8 Correct 2 ms 692 KB Output is correct
9 Correct 2 ms 700 KB Output is correct
10 Correct 2 ms 712 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 568 KB Output is correct
4 Correct 2 ms 568 KB Output is correct
5 Correct 2 ms 600 KB Output is correct
6 Correct 2 ms 692 KB Output is correct
7 Correct 2 ms 692 KB Output is correct
8 Correct 2 ms 692 KB Output is correct
9 Correct 2 ms 700 KB Output is correct
10 Correct 2 ms 712 KB Output is correct
11 Correct 276 ms 15428 KB Output is correct
12 Correct 423 ms 25832 KB Output is correct
13 Correct 474 ms 35948 KB Output is correct
14 Correct 381 ms 46716 KB Output is correct
15 Correct 374 ms 58428 KB Output is correct
16 Correct 362 ms 65536 KB Output is correct
17 Correct 408 ms 65536 KB Output is correct
18 Correct 246 ms 65536 KB Output is correct
19 Correct 425 ms 65536 KB Output is correct
20 Correct 306 ms 65536 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 568 KB Output is correct
4 Correct 2 ms 568 KB Output is correct
5 Correct 2 ms 600 KB Output is correct
6 Correct 2 ms 692 KB Output is correct
7 Correct 2 ms 692 KB Output is correct
8 Correct 2 ms 692 KB Output is correct
9 Correct 2 ms 700 KB Output is correct
10 Correct 2 ms 712 KB Output is correct
11 Correct 276 ms 15428 KB Output is correct
12 Correct 423 ms 25832 KB Output is correct
13 Correct 474 ms 35948 KB Output is correct
14 Correct 381 ms 46716 KB Output is correct
15 Correct 374 ms 58428 KB Output is correct
16 Correct 362 ms 65536 KB Output is correct
17 Correct 408 ms 65536 KB Output is correct
18 Correct 246 ms 65536 KB Output is correct
19 Correct 425 ms 65536 KB Output is correct
20 Correct 306 ms 65536 KB Output is correct
21 Correct 339 ms 65536 KB Output is correct
22 Correct 464 ms 65536 KB Output is correct
23 Correct 688 ms 65536 KB Output is correct
24 Correct 579 ms 65536 KB Output is correct
25 Correct 435 ms 65536 KB Output is correct
26 Correct 493 ms 65536 KB Output is correct
27 Correct 510 ms 65536 KB Output is correct
28 Correct 276 ms 65536 KB Output is correct
29 Correct 668 ms 65536 KB Output is correct
30 Correct 380 ms 65536 KB Output is correct
31 Correct 473 ms 65536 KB Output is correct
32 Correct 462 ms 65536 KB Output is correct
33 Correct 418 ms 65536 KB Output is correct
34 Correct 508 ms 65536 KB Output is correct
35 Correct 529 ms 65536 KB Output is correct
36 Correct 249 ms 65536 KB Output is correct
37 Correct 345 ms 65536 KB Output is correct
38 Correct 576 ms 65536 KB Output is correct
39 Correct 488 ms 65536 KB Output is correct
40 Correct 439 ms 65536 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 568 KB Output is correct
4 Correct 2 ms 568 KB Output is correct
5 Correct 2 ms 600 KB Output is correct
6 Correct 2 ms 692 KB Output is correct
7 Correct 2 ms 692 KB Output is correct
8 Correct 2 ms 692 KB Output is correct
9 Correct 2 ms 700 KB Output is correct
10 Correct 2 ms 712 KB Output is correct
11 Correct 56 ms 65536 KB Output is correct
12 Correct 54 ms 65536 KB Output is correct
13 Correct 66 ms 65536 KB Output is correct
14 Correct 74 ms 65536 KB Output is correct
15 Correct 58 ms 65536 KB Output is correct
16 Correct 80 ms 65536 KB Output is correct
17 Correct 84 ms 65536 KB Output is correct
18 Correct 70 ms 65536 KB Output is correct
19 Correct 54 ms 65536 KB Output is correct
20 Correct 63 ms 65536 KB Output is correct
21 Correct 66 ms 65536 KB Output is correct
22 Correct 77 ms 65536 KB Output is correct
23 Correct 57 ms 65536 KB Output is correct
24 Correct 83 ms 65536 KB Output is correct
25 Correct 86 ms 65536 KB Output is correct
26 Correct 46 ms 65536 KB Output is correct
27 Correct 52 ms 65536 KB Output is correct
28 Correct 56 ms 65536 KB Output is correct
29 Correct 67 ms 65536 KB Output is correct
30 Correct 61 ms 65536 KB Output is correct
31 Correct 55 ms 65536 KB Output is correct
32 Correct 85 ms 65536 KB Output is correct
33 Correct 82 ms 65536 KB Output is correct
34 Correct 46 ms 65536 KB Output is correct
35 Correct 80 ms 65536 KB Output is correct
36 Correct 74 ms 65536 KB Output is correct
37 Correct 71 ms 65536 KB Output is correct
38 Correct 71 ms 65536 KB Output is correct
39 Correct 68 ms 65536 KB Output is correct
40 Correct 80 ms 65536 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 568 KB Output is correct
4 Correct 2 ms 568 KB Output is correct
5 Correct 2 ms 600 KB Output is correct
6 Correct 2 ms 692 KB Output is correct
7 Correct 2 ms 692 KB Output is correct
8 Correct 2 ms 692 KB Output is correct
9 Correct 2 ms 700 KB Output is correct
10 Correct 2 ms 712 KB Output is correct
11 Correct 276 ms 15428 KB Output is correct
12 Correct 423 ms 25832 KB Output is correct
13 Correct 474 ms 35948 KB Output is correct
14 Correct 381 ms 46716 KB Output is correct
15 Correct 374 ms 58428 KB Output is correct
16 Correct 362 ms 65536 KB Output is correct
17 Correct 408 ms 65536 KB Output is correct
18 Correct 246 ms 65536 KB Output is correct
19 Correct 425 ms 65536 KB Output is correct
20 Correct 306 ms 65536 KB Output is correct
21 Correct 339 ms 65536 KB Output is correct
22 Correct 464 ms 65536 KB Output is correct
23 Correct 688 ms 65536 KB Output is correct
24 Correct 579 ms 65536 KB Output is correct
25 Correct 435 ms 65536 KB Output is correct
26 Correct 493 ms 65536 KB Output is correct
27 Correct 510 ms 65536 KB Output is correct
28 Correct 276 ms 65536 KB Output is correct
29 Correct 668 ms 65536 KB Output is correct
30 Correct 380 ms 65536 KB Output is correct
31 Correct 473 ms 65536 KB Output is correct
32 Correct 462 ms 65536 KB Output is correct
33 Correct 418 ms 65536 KB Output is correct
34 Correct 508 ms 65536 KB Output is correct
35 Correct 529 ms 65536 KB Output is correct
36 Correct 249 ms 65536 KB Output is correct
37 Correct 345 ms 65536 KB Output is correct
38 Correct 576 ms 65536 KB Output is correct
39 Correct 488 ms 65536 KB Output is correct
40 Correct 439 ms 65536 KB Output is correct
41 Correct 56 ms 65536 KB Output is correct
42 Correct 54 ms 65536 KB Output is correct
43 Correct 66 ms 65536 KB Output is correct
44 Correct 74 ms 65536 KB Output is correct
45 Correct 58 ms 65536 KB Output is correct
46 Correct 80 ms 65536 KB Output is correct
47 Correct 84 ms 65536 KB Output is correct
48 Correct 70 ms 65536 KB Output is correct
49 Correct 54 ms 65536 KB Output is correct
50 Correct 63 ms 65536 KB Output is correct
51 Correct 66 ms 65536 KB Output is correct
52 Correct 77 ms 65536 KB Output is correct
53 Correct 57 ms 65536 KB Output is correct
54 Correct 83 ms 65536 KB Output is correct
55 Correct 86 ms 65536 KB Output is correct
56 Correct 46 ms 65536 KB Output is correct
57 Correct 52 ms 65536 KB Output is correct
58 Correct 56 ms 65536 KB Output is correct
59 Correct 67 ms 65536 KB Output is correct
60 Correct 61 ms 65536 KB Output is correct
61 Correct 55 ms 65536 KB Output is correct
62 Correct 85 ms 65536 KB Output is correct
63 Correct 82 ms 65536 KB Output is correct
64 Correct 46 ms 65536 KB Output is correct
65 Correct 80 ms 65536 KB Output is correct
66 Correct 74 ms 65536 KB Output is correct
67 Correct 71 ms 65536 KB Output is correct
68 Correct 71 ms 65536 KB Output is correct
69 Correct 68 ms 65536 KB Output is correct
70 Correct 80 ms 65536 KB Output is correct
71 Correct 539 ms 65536 KB Output is correct
72 Correct 599 ms 65536 KB Output is correct
73 Correct 766 ms 65536 KB Output is correct
74 Correct 904 ms 65536 KB Output is correct
75 Correct 540 ms 65536 KB Output is correct
76 Correct 946 ms 65536 KB Output is correct
77 Correct 1033 ms 65536 KB Output is correct
78 Correct 380 ms 65536 KB Output is correct
79 Correct 472 ms 65536 KB Output is correct
80 Correct 545 ms 65536 KB Output is correct
81 Correct 756 ms 65536 KB Output is correct
82 Correct 1020 ms 65536 KB Output is correct
83 Correct 609 ms 65536 KB Output is correct
84 Correct 1133 ms 65536 KB Output is correct
85 Correct 1111 ms 65536 KB Output is correct
86 Correct 335 ms 65536 KB Output is correct
87 Correct 545 ms 65536 KB Output is correct
88 Correct 568 ms 65536 KB Output is correct
89 Correct 782 ms 65536 KB Output is correct
90 Correct 681 ms 65536 KB Output is correct
91 Correct 634 ms 65536 KB Output is correct
92 Correct 1311 ms 65536 KB Output is correct
93 Correct 1127 ms 65536 KB Output is correct
94 Correct 345 ms 65536 KB Output is correct
95 Correct 1053 ms 65536 KB Output is correct
96 Correct 993 ms 65536 KB Output is correct
97 Correct 994 ms 65536 KB Output is correct
98 Correct 1014 ms 65536 KB Output is correct
99 Correct 986 ms 65536 KB Output is correct
100 Correct 1008 ms 65536 KB Output is correct