oj.uz

Submission #330178

# Submission time Handle Problem Language Result Execution time Memory
330178 2020-11-24T05:57:35 Z casperwang Snake Escaping (JOI18_snake_escaping) C++14
5 / 100
 2000 ms 5648 KB 
#include <bits/stdc++.h>
using namespace std;

const int L = 20;
int n, q;
string str;
int val[1<<L];
int ans;

signed main() {
  ios_base::sync_with_stdio(0), cin.tie(0);
  cin >> n >> q;
  cin >> str;
  for (int i = 0; i < (1<<n); i++)
    val[i] = str[i] - '0';
  for (int i = 0; i < q; i++) {
    cin >> str;
    ans = 0;
    for (int j = 0; j < (1<<n); j++) {
      bool tf = 1;
      for (int k = 0; k < n && tf; k++) {
        if (str[n-1-k] == '?') continue;
        if (str[n-1-k]-'0' != ((1<<k)&(j))>0) tf = 0;
      }
      if (tf) ans += val[j];
    }
    cout << ans << "\n";
  }
}

Compilation message

snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:23:43: warning: suggest parentheses around comparison in operand of '!=' [-Wparentheses]
   23 |         if (str[n-1-k]-'0' != ((1<<k)&(j))>0) tf = 0;
      |                               ~~~~~~~~~~~~^~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 364 KB Output is correct
2 Correct 8 ms 364 KB Output is correct
3 Correct 8 ms 364 KB Output is correct
4 Correct 6 ms 364 KB Output is correct
5 Correct 9 ms 364 KB Output is correct
6 Correct 7 ms 364 KB Output is correct
7 Correct 7 ms 364 KB Output is correct
8 Correct 10 ms 364 KB Output is correct
9 Correct 4 ms 364 KB Output is correct
10 Correct 8 ms 364 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 364 KB Output is correct
2 Correct 8 ms 364 KB Output is correct
3 Correct 8 ms 364 KB Output is correct
4 Correct 6 ms 364 KB Output is correct
5 Correct 9 ms 364 KB Output is correct
6 Correct 7 ms 364 KB Output is correct
7 Correct 7 ms 364 KB Output is correct
8 Correct 10 ms 364 KB Output is correct
9 Correct 4 ms 364 KB Output is correct
10 Correct 8 ms 364 KB Output is correct
11 Execution timed out 2090 ms 2492 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 364 KB Output is correct
2 Correct 8 ms 364 KB Output is correct
3 Correct 8 ms 364 KB Output is correct
4 Correct 6 ms 364 KB Output is correct
5 Correct 9 ms 364 KB Output is correct
6 Correct 7 ms 364 KB Output is correct
7 Correct 7 ms 364 KB Output is correct
8 Correct 10 ms 364 KB Output is correct
9 Correct 4 ms 364 KB Output is correct
10 Correct 8 ms 364 KB Output is correct
11 Execution timed out 2090 ms 2492 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 364 KB Output is correct
2 Correct 8 ms 364 KB Output is correct
3 Correct 8 ms 364 KB Output is correct
4 Correct 6 ms 364 KB Output is correct
5 Correct 9 ms 364 KB Output is correct
6 Correct 7 ms 364 KB Output is correct
7 Correct 7 ms 364 KB Output is correct
8 Correct 10 ms 364 KB Output is correct
9 Correct 4 ms 364 KB Output is correct
10 Correct 8 ms 364 KB Output is correct
11 Execution timed out 2073 ms 5648 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 364 KB Output is correct
2 Correct 8 ms 364 KB Output is correct
3 Correct 8 ms 364 KB Output is correct
4 Correct 6 ms 364 KB Output is correct
5 Correct 9 ms 364 KB Output is correct
6 Correct 7 ms 364 KB Output is correct
7 Correct 7 ms 364 KB Output is correct
8 Correct 10 ms 364 KB Output is correct
9 Correct 4 ms 364 KB Output is correct
10 Correct 8 ms 364 KB Output is correct
11 Execution timed out 2090 ms 2492 KB Time limit exceeded
12 Halted 0 ms 0 KB -