oj.uz

Submission #1104381

# Submission time Handle Problem Language Result Execution time Memory
1104381 2024-10-23T14:22:57 Z zephyrion Snake Escaping (JOI18_snake_escaping) C++17
5 / 100
 2000 ms 10084 KB 
#include <bits/stdc++.h>
using namespace std;

int n, q;
string s;

int solve(const string& t, int qm) {
    int sum = 0;
    for (int i = 0; i < (1 << qm); i++) {
        int c = 0;
        int idx = 0;
        for (int j = 0; j < n; j++) {
            if (t[j] == '1') {
                c += 1 << j;
            }
            if (t[j] == '?') {
                if (i & (1 << idx)) {
                    c += 1 << j;
                }
                idx++;
            }
        }
        sum += (s[c] - '0');
    }
    return sum;
}

int main() {
    cin >> n >> q;
    cin >> s;
    while (q--) {
        string t;
        cin >> t;
        reverse(t.begin(), t.end());
        cout << solve(t, count(t.begin(), t.end(), '?')) << endl;
    }
}

Subtask #1
5.0 / 5.0

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

Subtask #2
0 / 7.0

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

Subtask #3
0 / 10.0

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

Subtask #4
0 / 53.0

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

Subtask #5
0 / 25.0

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