제출 #1276532

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1276532		icebear	Snake Escaping (JOI18_snake_escaping)	C++20	0 / 100	1 ms	568 KiB

snake_escaping

// ~~ icebear ~~
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;

template<class T>
    bool minimize(T &a, const T &b) {
        if (a > b) return a = b, true;
        return false;
    }

template<class T>
    bool maximize(T &a, const T &b) {
        if (a < b) return a = b, true;
        return false;
    }

#define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
#define FORR(i,a,b) for(int i=(a); i>=(b); --i)
#define REP(i, n) for(int i=0; i<(n); ++i)
#define RED(i, n) for(int i=(n)-1; i>=0; --i)
#define MASK(i) (1LL << (i))
#define BIT(S, i) (((S) >> (i)) & 1)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define task "icebear"

const int MOD = 1e9 + 7;
const int inf = 1e9 + 27092008;
const ll INF = 1e18 + 27092008;
const int N = MASK(20) + 5;
int L, q, a[N], super[N], sub[N];

void init(void) {
    cin >> L >> q;
    REP(i, MASK(L)) {
        char c; cin >> c;
        a[i] = c - '0';
        super[i] = a[i];
        sub[i] = a[i];
    }
}

void process(void) {
    REP(i, L) REP(mask, MASK(L)) if (BIT(mask, i) == 0)
        sub[mask | MASK(i)] += sub[mask];

    REP(i, L) RED(mask, MASK(L)) if (BIT(mask, i) == 1)
        super[mask ^ MASK(i)] += super[mask];

    while(q--) {
        string S; cin >> S;
        int A = 0, B = 0, C = 0;
        REP(i, L) {
            if (S[i] == '0') A |= MASK(L - 1 - i);
            if (S[i] == '1') B |= MASK(L - 1 - i);
            if (S[i] == '?') C |= MASK(L - 1 - i);
        }

        int numZero = __builtin_popcount(A);
        int numOne = __builtin_popcount(B);
        int numAsk = __builtin_popcount(C);
        int minBit = min({numOne, numZero, numAsk});
        int res = 0;
        if (numZero == minBit) {
            for(int mask = A; mask > 0; mask = (mask - 1) & A)
                res += (__builtin_popcount(mask) & 1 ? -1 : +1) * super[B | mask];
            res += super[B];
        } else if (numOne == minBit) {
            for(int mask = B; mask > 0; mask = (mask - 1) & B)
                res += (__builtin_popcount(mask) & 1 ? +1 : -1) * sub[C | mask];
            res -= sub[C];
        } else {
            for(int mask = C; mask > 0; mask = (mask - 1) & C)
                res += a[B | mask];
            res += a[B];
        }
        cout << res << '\n';
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    if (fopen(task".inp", "r")) {
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    int tc = 1;
//    cin >> tc;
    while(tc--) {
        init();
        process();
    }
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:92:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   92 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
snake_escaping.cpp:93:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   93 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 5
• Subtask 2: 0 / 7
• Subtask 3: 0 / 10
• Subtask 4: 0 / 53
• Subtask 5: 0 / 25