oj.uz

Submission #1050027

# Submission time Handle Problem Language Result Execution time Memory
1050027 2024-08-09T06:56:28 Z vjudge1 Snake Escaping (JOI18_snake_escaping) C++17
5 / 100
 2000 ms 10072 KB 
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math,inline")
#include <bits/stdc++.h>
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,lzcnt,mmx,abm,avx,avx2,fma")
using namespace std;
// using namespace __gnu_pbds;
// typedef tree<pair<int,int>,null_type,less<pair<int,int>>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
#define static_assert(...);
#include <tr2/dynamic_bitset>
using custom_bitset = tr2::dynamic_bitset<__uint128_t>;
#define speed ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long
#define bigInt __int128
#define dl double long
#define fl float
#define all(s) s.begin(), s.end()
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pob_front
#define ins insert
#define F first
#define S second
#define len length
const int N = 100010;
const int M = 1010;
const int LN = 131072;
const int INF = 1000000000000000000;
const int MOD = 1e9 + 7;
const int BLOCK = 500;
int binpow(int a, int b, int MOD) {
    int res = 1;
    while (b > 0) {
        if (b & 1) {
            res = res * a;
            res %= MOD;
        }
        a = a * a;
        a %= MOD;
        b >>= 1;
    }
    return res;
}
int MMI(int a, int MOD) {
    int ret = binpow(a, MOD - 2, MOD);
    return ret;
}
// int mdiv(int a, int b) {
//     int ret = a*MMI(b);
//     ret %= MOD;
//     return ret;
// }
int mmul(int a, int b) {
    int ret = (a % MOD) * (b % MOD);
    ret %= MOD;
    return ret;
}
int madd(int a, int b) {
    int ret = (a % MOD) + (b % MOD);
    ret %= MOD;
    return ret;
}
int msub(int a, int b) {
    int ret = (a % MOD) - (b % MOD);
    ret += MOD;
    ret %= MOD;
    return ret;
}
int GCD(int a, int b) {
    if (b == 0) {
        return a;
    }
    return GCD(b, a % b);
}
int LCM(int a, int b) {
    return a*b / GCD(a, b);
}
struct pqComp
{
    bool operator()(const pair<int, int>& p1, const pair<int, int>& p2) const
    {
        return (p1.F < p2.F) || (p1.F == p2.F && p1.S < p2.S);
    }
};
bool pCompF(pair<int, int>& p1, pair<int, int>& p2)
{
    return p1.F < p2.F;
}
bool pCompS(pair<int, int>& p1, pair<int, int>& p2)
{
    return p1.S < p2.S;
}
bool pCompFS(pair<int, int>& p1, pair<int, int>& p2)
{
    return (p1.S < p2.S) || (p1.S == p2.S && p1.F < p2.F);
}
vector <pair<int, int>> DS {{1, 0}, {0, 1}};//{{0, -1}, {1, 0}, {0, 1}, {-1, 0}};//, {-1, -1}, {-1, 1}, {1, -1}, {1, 1}};
int n, q, a[11*N];

void solve() {
    cin >> n >> q;
    for (int i = 0; i < (1 << n); ++i) {
        char c; cin >> c;
        a[i] = (c - '0');
    }
    while (q--) {
        string s; cin >> s;
        reverse(all(s));
        int ans = 0;
        for (int mask = 0; mask < (1 << n); ++mask) {
            int ok = 1;
            for (int i = 0; i < n; ++i) {
                if (s[i] == '?') continue;
                ok &= (((mask >> i) & 1) == (s[i] - '0'));
            }
            if (ok) {
                ans += a[mask];
            }
        }
        cout << ans << '\n';
    }
}
 
signed main() {
    speed;
    int T = 1;
    //cin >> T;
    while (T--) {
        solve();
    }
}
/*
НЕ ЗАХОДИТ РЕШЕНИЕ?
1) ПРОВЕРЬ НА ОЧЕВИДНЫЕ ОШИБКИ В КОДЕ
2) ПРОВЕРЬ НА ПЕРЕПОЛНЕНИЯ
3) УБЕДИСЬ В ПРАВИЛЬНОСТИ АЛГОРИТМА
*/

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 348 KB Output is correct
2 Correct 7 ms 484 KB Output is correct
3 Correct 8 ms 348 KB Output is correct
4 Correct 12 ms 468 KB Output is correct
5 Correct 7 ms 344 KB Output is correct
6 Correct 7 ms 348 KB Output is correct
7 Correct 8 ms 344 KB Output is correct
8 Correct 6 ms 348 KB Output is correct
9 Correct 9 ms 348 KB Output is correct
10 Correct 7 ms 348 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 348 KB Output is correct
2 Correct 7 ms 484 KB Output is correct
3 Correct 8 ms 348 KB Output is correct
4 Correct 12 ms 468 KB Output is correct
5 Correct 7 ms 344 KB Output is correct
6 Correct 7 ms 348 KB Output is correct
7 Correct 8 ms 344 KB Output is correct
8 Correct 6 ms 348 KB Output is correct
9 Correct 9 ms 348 KB Output is correct
10 Correct 7 ms 348 KB Output is correct
11 Execution timed out 2080 ms 5172 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 348 KB Output is correct
2 Correct 7 ms 484 KB Output is correct
3 Correct 8 ms 348 KB Output is correct
4 Correct 12 ms 468 KB Output is correct
5 Correct 7 ms 344 KB Output is correct
6 Correct 7 ms 348 KB Output is correct
7 Correct 8 ms 344 KB Output is correct
8 Correct 6 ms 348 KB Output is correct
9 Correct 9 ms 348 KB Output is correct
10 Correct 7 ms 348 KB Output is correct
11 Execution timed out 2080 ms 5172 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 348 KB Output is correct
2 Correct 7 ms 484 KB Output is correct
3 Correct 8 ms 348 KB Output is correct
4 Correct 12 ms 468 KB Output is correct
5 Correct 7 ms 344 KB Output is correct
6 Correct 7 ms 348 KB Output is correct
7 Correct 8 ms 344 KB Output is correct
8 Correct 6 ms 348 KB Output is correct
9 Correct 9 ms 348 KB Output is correct
10 Correct 7 ms 348 KB Output is correct
11 Execution timed out 2029 ms 10072 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 348 KB Output is correct
2 Correct 7 ms 484 KB Output is correct
3 Correct 8 ms 348 KB Output is correct
4 Correct 12 ms 468 KB Output is correct
5 Correct 7 ms 344 KB Output is correct
6 Correct 7 ms 348 KB Output is correct
7 Correct 8 ms 344 KB Output is correct
8 Correct 6 ms 348 KB Output is correct
9 Correct 9 ms 348 KB Output is correct
10 Correct 7 ms 348 KB Output is correct
11 Execution timed out 2080 ms 5172 KB Time limit exceeded
12 Halted 0 ms 0 KB -