제출 #71987

#제출 시각아이디문제언어결과실행 시간메모리
71987마릴린 희정 (#118)재채점 전쟁 (FXCUP3_judge)C++17
0 / 100
2 ms488 KiB
#include <bits/stdc++.h> using namespace std; typedef long long lint; typedef long double llf; typedef pair<int, int> pi; const int MAXN = 1050000; int m, n1, n2, a[MAXN], b[MAXN]; char buf[22]; int getMask(){ scanf("%s",buf); int ans = 0; for(int i=0; buf[i]; i++){ if(buf[i] != '.') ans |= (1<<i); } return ans; } int dp[MAXN]; int func[MAXN], cnt[MAXN], ok[MAXN], ret[MAXN]; void fucking_koosaga(){ for (int i = 0; i < (1 << m); i += 1) { dp[i] = (1<<m) - 1; } for(int i=0; i<n1; i++){ int x = (1<<m) - 1; x ^= a[i]; dp[x] = x; } for (int i = (1<<m); i > 0; i -= 1) { if (dp[i] == i) { ok[((1<<m) - 1)^ i] = 1; } for (int j = 0; j < m; j += 1) { if ((1 << j) & i) { dp[i ^ (1 << j)] &= dp[i]; } } } } int main(){ scanf("%d",&m); scanf("%d",&n1); for(int i=0; i<n1; i++) a[i] = getMask(); scanf("%d",&n2); for(int i=0; i<n2; i++){ b[i] = getMask(); cnt[b[i] ^ ((1<<m) - 1)] ++; } fucking_koosaga(); // first, count b_i such that, j & b_i neq 0; for(int i=0; i<m; i++){ for(int j=0; j<(1<<m); j++){ if((j >> i) & 1){ cnt[j] += cnt[j ^ (1<<i)]; } } } for(int j=0; j<(1<<m); j++){ func[j] = n2 - cnt[((1<<m) - 1) ^ j]; if(ok[j]) ret[func[j]] = 1; } for(int i=1; i<=n2; i++) putchar(ret[i] ? 'o' : 'x'); puts(""); } /* struct rmq{ int tree[530000], lim; void init(int n){ memset(tree, 0x3f, sizeof(tree)); for(lim = 1; lim < n; lim <<= 1); for(int i=0; i<lim; i++){ l[i + lim] = i + 1; r[i + lim] = i + 1; } for(int i=lim-1; i; i--){ l[i] = l[2*i]; r[i] = r[2*i+1]; } } int query(int s, int e){ s--, e--; s += lim; e += lim; int ret = 1e9; while(s < e){ if(s%2 == 1) ret = min(ret, tree[s++]); if(e%2 == 0) ret = min(ret, tree[e--]); s >>= 1; e >>= 1; } if(s == e) ret = min(ret, tree[s]); return ret; } }rmq; int n, q, a[200005]; int main(){ scanf("%d %d",&n,&q); rmq.init(n); for(int i=1; i<=n; i++){ scanf("%*d",&a[i]); rmq.add(i, a[i]); } while(q--){ int l, r; scanf("%d %d",&l,&r); printf("%d\n", rmq.query(l, r)); } }o*/

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

judge.cpp: In function 'int getMask()':
judge.cpp:12:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s",buf);
  ~~~~~^~~~~~~~~~
judge.cpp: In function 'int main()':
judge.cpp:46:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&m);
  ~~~~~^~~~~~~~~
judge.cpp:47:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n1);
  ~~~~~^~~~~~~~~~
judge.cpp:49:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n2);
  ~~~~~^~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...