제출 #64581

#제출 시각아이디문제언어결과실행 시간메모리
64581keko37Snake Escaping (JOI18_snake_escaping)C++14
75 / 100
2045 ms38680 KiB
#include<iostream> using namespace std; const int MAXN = (1<<20) + 10; int n, q, a, b, c, sol, mask, N, rev, count, i, j, tc; char l[30], cc; int val[MAXN], sum0[MAXN], sum1[MAXN], pc[MAXN]; void precompute () { for (i=0; i<(1<<n); i++) { pc[i] = __builtin_popcount(i); sum0[i] = val[i]; sum1[i] = val[i ^ ((1<<n) - 1)]; } for (i=0; i<n; i++) { for (j=0; j<(1<<n); j++) { if (j & (1<<i)) sum0[j] += sum0[j ^ (1<<i)]; if (j & (1<<i)) sum1[j] += sum1[j ^ (1<<i)]; } } } #define pcc(x) putchar(x); int main () { cin >> n >> q; do { cc = getchar(); } while (!(cc>='0' && cc<='9')); for (i=0; i<(1<<n); i++) { if (i>0) { cc = getchar(); } val[i] = cc - '0'; } precompute(); for (tc=0; tc<q; tc++) { a = b = c = 0; do { cc = getchar(); } while (!(cc=='0' || cc=='1' || cc=='?')); for (i=0; i<n; i++) { if (i>0) cc = getchar(); l[i] = cc; if (l[i] == '?') { a ^= (1<<(n-1-i)); } else if (l[i] == '0') { b ^= (1<<(n-1-i)); } else { c ^= (1<<(n-1-i)); } } sol = 0, mask = 0; if (pc[a] <= n/3) { do { sol += val[mask | c]; } while (mask = (mask-a) & a); } else if (pc[b] <= n/3) { do { if (pc[mask | a] & 1) { sol -= sum1[mask | a]; } else { sol += sum1[mask | a]; } } while (mask = (mask-b) & b); if (sol < 0) sol = -sol; } else { do { if (pc[mask | a] & 1) { sol -= sum0[mask | a]; } else { sol += sum0[mask | a]; } } while (mask = (mask-c) & c); if (sol < 0) sol = -sol; } N = sol, rev, count = 0; rev = N; if (N == 0) { pcc('0'); putchar('\n'); continue ;} while ((rev % 10) == 0) { count++; rev /= 10;} //obtain the count of the number of 0s rev = 0; while (N != 0) { rev = (rev<<3) + (rev<<1) + N % 10; N /= 10;} //store reverse of N in rev while (rev != 0) { pcc(rev % 10 + '0'); rev /= 10;} while (count--) pcc('0'); putchar('\n'); } return 0; }

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

snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:58:18: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
    } while (mask = (mask-a) & a);
             ~~~~~^~~~~~~~~~~~~~
snake_escaping.cpp:66:18: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
    } while (mask = (mask-b) & b);
             ~~~~~^~~~~~~~~~~~~~
snake_escaping.cpp:75:18: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
    } while (mask = (mask-c) & c);
             ~~~~~^~~~~~~~~~~~~~
snake_escaping.cpp:79:31: warning: right operand of comma operator has no effect [-Wunused-value]
         N = sol, rev, count = 0;
                               ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...