Submission #67712930
Source Code Expand
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
#include <array>
#include <unordered_set>
#include <unordered_map>
#define rep(x, s, t) for(ll x = (s); (x) <= (t); (x)++)
#define per(x, s, t) for(ll x = (s); (x) >= (t); (x)--)
#define reps(x, s) for(ll x = 0; (x) < (ll)(s).size(); (x)++)
#define pers(x, s) for(ll x = (ll)(s).size()-1; (x) >= 0; (x)--)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define sz(x) ((ll)(x).size())
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define outl(...) dump_func(__VA_ARGS__)
#define outf(x) cout << fixed << setprecision(16) << (x) << endl
#define pb push_back
#define fi first
#define se second
#define inf 2e18
#define eps 1e-9
const double PI = 3.1415926535897932384626433;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
template<class T> using Preq = priority_queue<T>;
template<class T> using preq = priority_queue<T, vector<T>, greater<T>>;
struct edge{
ll to, cost;
edge(){}
edge(ll a, ll b){ to = a, cost = b;}
};
const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};
const int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dy8[] = {0, -1, -1, -1, 0, 1, 1, 1};
const int mod = 998244353;
//const int mod = 1000000007;
struct mint{
int x;
mint(ll y = 0){if(y < 0 || y >= mod) y = (y%mod+mod)%mod; x = y;}
mint(const mint &ope) {x = ope.x;}
mint operator-(){return mint(-x);}
mint operator+(const mint &ope){return mint(x) += ope;}
mint operator-(const mint &ope){return mint(x) -= ope;}
mint operator*(const mint &ope){return mint(x) *= ope;}
mint operator/(const mint &ope){return mint(x) /= ope;}
mint& operator+=(const mint &ope){x += ope.x; if(x >= mod) x -= mod; return *this;}
mint& operator-=(const mint &ope){x += mod - ope.x; if(x >= mod) x -= mod; return *this;}
mint& operator*=(const mint &ope){ll tmp = x; tmp *= ope.x, tmp %= mod; x = tmp; return *this;}
mint& operator/=(const mint &ope){
ll n = mod-2; mint mul = ope;
while(n){if(n & 1) *this *= mul; mul *= mul; n >>= 1;}
return *this;
}
mint inverse(){return mint(1) / *this;}
bool operator ==(const mint &ope){return x == ope.x;}
bool operator !=(const mint &ope){return x != ope.x;}
bool operator <(const mint &ope)const{return x < ope.x;}
};
mint modpow(mint a, ll n){
if(n == 0) return mint(1);
if(n % 2) return a * modpow(a, n-1);
else return modpow(a*a, n/2);
}
istream& operator >>(istream &is, mint &ope){ll t; is >> t, ope = mint(t); return is;}
ostream& operator <<(ostream &os, mint &ope){return os << ope.x;}
ostream& operator <<(ostream &os, const mint &ope){return os << ope.x;}
ll modpow(ll a, ll n, ll mod){
if(n == 0) return 1;
if(n % 2) return ((a%mod) * (modpow(a, n-1, mod)%mod)) % mod;
else return modpow((a*a)%mod, n/2, mod) % mod;
}
vector<mint> fact, fact_inv;
void make_fact(int n){
fact.resize(n+1), fact_inv.resize(n+1);
fact[0] = mint(1); rep(i, 1, n) fact[i] = fact[i-1] * mint(i);
fact_inv[n] = fact[n].inverse(); per(i, n-1, 0) fact_inv[i] = fact_inv[i+1] * mint(i+1);
}
mint comb(int n, int k){ if(n < 0 || k < 0 || n < k) return mint(0); return fact[n] * fact_inv[k] * fact_inv[n-k];}
mint perm(int n, int k){ return comb(n, k) * fact[k]; }
mint divide(int n, int k){ if(n == 0 && k == 0) return 1; return comb(n+k-1, k-1); }
template<typename T> T comb2(ll n, ll k){ if(n < 0 || k < 0 || n < k) return T(0); T ret = 1; rep(i, 1, k) ret *= n-k+i, ret /= i; return ret;}
mint cat(ll w, ll h, ll b = 0){ return comb(w+h, w) - comb(w+h, h+b+1); } //b >= 0;
vector<ll> prime, pvec, qrime, tot;
void make_prime(int n){
prime.resize(n+1);
rep(i, 2, n){
if(prime[i] == 0) pvec.push_back(i), prime[i] = i;
for(auto p : pvec){ if(i*p > n || p > prime[i]) break; prime[i*p] = p;}
}
}
void make_qrime(int n){
qrime.resize(n+1);
rep(i, 2, n){int ni = i / prime[i]; if(prime[i] == prime[ni]) qrime[i] = qrime[ni] * prime[i]; else qrime[i] = prime[i];}
}
void make_totient(int n)
{
tot.resize(n+1);
tot[1] = 1;
rep(i, 2, n) tot[i] = (qrime[i] - qrime[i]/prime[i]) * tot[i/qrime[i]];
}
void factorize(ll n, map<ll, ll> &mp){
mp.clear();
for(auto p : pvec) while(n % p == 0) mp[p]++, n /= p;
if(n > 1) mp[n]++;
}
template<typename S, typename T, typename U> bool isin(S x, T l, U r){return l <= x && x <= r;}
template<typename T> bool isdigit(T c){return isin(c, '0', '9');}
template<typename T> bool islower(T c){return isin(c, 'a', 'z');}
template<typename T> bool isupper(T c){return isin(c, 'A', 'Z');}
bool exceed(ll x, ll y, ll m){return y > 0 && x >= m / y + 1;}
void mark(){ cout << "*" << endl; }
void yes(){ cout << "Yes" << endl; }
void no(){ cout << "No" << endl; }
ll floor(ll a, ll b){ if(b < 0) a *= -1, b *= -1; if(a >= 0) return a/b; else return -((-a+b-1)/b); }
ll ceil(ll a, ll b){ if(b < 0) a *= -1, b *= -1; if(a >= 0) return (a+b-1)/b; else return -((-a)/b); }
ll modulo(ll a, ll b){ b = abs(b); return a - floor(a, b) * b;}
ll sgn(ll x){ if(x > 0) return 1; if(x < 0) return -1; return 0;}
ll gcd(ll a, ll b){if(b == 0) return a; return gcd(b, a%b);}
ll lcm(ll a, ll b){return a/gcd(a, b)*b;}
template<typename T> T arith(T x){return x*(x+1)/2;}
template<typename T> T arith2(T x){return x*(x+1)*(x*2+1)/6;}
ll digitnum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret++; return ret;}
ll digitsum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret += x % b; return ret;}
string lltos(ll x, ll b = 10){if(x == 0) return "0"; string ret; for(;x;x/=b) ret += x % b + '0'; reverse(all(ret)); return ret;}
ll stoll(string &s, ll b = 10){ll ret = 0; for(auto c : s) ret *= b, ret += c - '0'; return ret;}
template<typename T> void uniq(T &vec){sort(all(vec)); vec.erase(unique(all(vec)), vec.end());}
int popcount(ull x){
x -= ((x>>1)&0x5555555555555555ULL), x = (x & 0x3333333333333333ULL) + ((x>>2) & 0x3333333333333333ULL);
return (((x + (x>>4)) & 0x0F0F0F0F0F0F0F0FULL) * 0x0101010101010101ULL) >> 56;
}
template<typename T> vector<pair<T, ll>> rle(vector<T> vec){
vector<pair<T, ll>> ret;
for(auto x : vec){if(sz(ret) == 0 || ret.back().first != x) ret.push_back(P(x, 1)); else ret.back().second++;}
return ret;
}
vector<pair<char, ll>> rle(string s){ vector<char> vec; for(auto c : s) vec.push_back(c); return rle(vec);}
template<class S, class T> pair<S, T>& operator+=(pair<S, T> &s, const pair<S, T> &t){s.first += t.first, s.second += t.second; return s;}
template<class S, class T> pair<S, T>& operator-=(pair<S, T> &s, const pair<S, T> &t){s.first -= t.first, s.second -= t.second; return s;}
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t){return pair<S,T>(s.first+t.first, s.second+t.second);}
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t){return pair<S,T>(s.first-t.first, s.second-t.second);}
template<class T> T dot(const pair<T, T> &s, const pair<T, T> &t){return s.first*t.first + s.second*t.second;}
template<class T> T cross(const pair<T, T> &s, const pair<T, T> &t){return s.first*t.second - s.second*t.first;}
template<class T> T mdist(pair<T, T> s, pair<T, T> t){return abs(s.first-t.first) + abs(s.second-t.second);}
template<class T> T cdist(pair<T, T> s, pair<T, T> t){return max(abs(s.first-t.first), abs(s.second-t.second));}
template<class T> T edist2(pair<T, T> s, pair<T, T> t){return (s.first-t.first)*(s.first-t.first) + (s.second-t.second)*(s.second-t.second);}
template<typename T, typename U> ostream& operator << (ostream& os, pair<T, U>& ope){ os << "(" << ope.first << ", " << ope.second << ")"; return os;}
template<typename T, typename U> ostream& operator << (ostream& os, const pair<T, U>& ope){ os << "(" << ope.first << ", " << ope.second << ")"; return os;}
template<typename T> ostream& operator << (ostream& os, vector<T>& vec){reps(i, vec) os << vec[i] << " "; return os;}
template<typename T> ostream& operator << (ostream& os, const vector<T>& vec){reps(i, vec) os << vec[i] << " "; return os;}
template<typename T> ostream& operator << (ostream& os, list<T>& ls){for(auto x : ls) os << x << " "; return os;}
template<typename T> ostream& operator << (ostream& os, const list<T>& ls){for(auto x : ls) os << x << " "; return os;}
template<typename T> ostream& operator << (ostream& os, deque<T>& deq){reps(i, deq) os << deq[i] << " "; return os;}
template<typename T, typename U> ostream& operator << (ostream& os, map<T, U>& ope){ for(auto p : ope) os << "(" << p.first << ", " << p.second << "),";return os;}
template<typename T> ostream& operator << (ostream& os, set<T>& ope){for(auto x : ope) os << x << " "; return os;}
template<typename T> ostream& operator << (ostream& os, multiset<T>& ope){for(auto x : ope) os << x << " "; return os;}
template<typename T> void outa(T a[], ll s, ll t){rep(i, s, t){ cout << a[i]; if(i < t) cout << " ";} cout << endl;}
template<typename T> void outg(T a[], ll sy, ll ty, ll sx, ll tx){rep(y, sy, ty){rep(x, sx, tx){cout << a[x][y]; if(x < tx) cout << " ";} cout << endl;}}
template<typename T, size_t N> ostream& operator << (ostream& os, array<T, N>& arr){reps(i, arr) os << arr[i] << " "; return os;}
template<typename T, size_t N> ostream& operator << (ostream& os, const array<T, N>& arr){reps(i, arr) os << arr[i] << " "; return os;}
void dump_func(){cout << endl;}
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail){cout << head; if(sizeof...(Tail) > 0) cout << " "; dump_func(std::move(tail)...);}
template<typename T> void bssert(bool b, T t){ if(!b) cout << t << endl, exit(0); }
ll T;
ll n;
string s;
bool b[1<<18];
int main(void)
{
ios::sync_with_stdio(0);
cin.tie(0);
cin >> T;
while(T--){
cin >> n >> s;
ll N = 1<<n;
s = "0" + s;
rep(i, 0, N-1) b[i] = false;
b[0] = true;
rep(i, 0, N-1){
if(!b[i]) continue;
rep(j, 0, n-1){
if(i & (1<<j)) continue;
ll ni = i|(1<<j);
if(s[ni] == '1') continue;
b[ni] = true;
}
}
if(b[N-1]) yes();
else no();
}
return 0;
}
Submission Info
| Submission Time |
|
| Task |
C - Mixture |
| User |
leaf1415 |
| Language |
C++ 20 (gcc 12.2) |
| Score |
350 |
| Code Size |
10478 Byte |
| Status |
AC |
| Exec Time |
47 ms |
| Memory |
4100 KiB |
Compile Error
Main.cpp: In function ‘std::istream& operator>>(std::istream&, mint&)’:
Main.cpp:87:73: warning: implicitly-declared ‘constexpr mint& mint::operator=(const mint&)’ is deprecated [-Wdeprecated-copy]
87 | istream& operator >>(istream &is, mint &ope){ll t; is >> t, ope = mint(t); return is;}
| ^
Main.cpp:63:9: note: because ‘mint’ has user-provided ‘mint::mint(const mint&)’
63 | mint(const mint &ope) {x = ope.x;}
| ^~~~
Main.cpp: In function ‘void make_fact(int)’:
Main.cpp:100:25: warning: implicitly-declared ‘constexpr mint& mint::operator=(const mint&)’ is deprecated [-Wdeprecated-copy]
100 | fact[0] = mint(1); rep(i, 1, n) fact[i] = fact[i-1] * mint(i);
| ^
Main.cpp:63:9: note: because ‘mint’ has user-provided ‘mint::mint(const mint&)’
63 | mint(const mint &ope) {x = ope.x;}
| ^~~~
Main.cpp:100:69: warning: implicitly-declared ‘constexpr mint& mint::operator=(const mint&)’ is deprecated [-Wdeprecated-copy]
100 | fact[0] = mint(1); rep(i, 1, n) fact[i] = fact[i-1] * mint(i);
| ^
Main.cpp:63:9: note: because ‘mint’ has user-provided ‘mint::mint(const mint&)’
63 | mint(const mint &ope) {x = ope.x;}
| ^~~~
Main.cpp:101:39: warning: implicitly-declared ‘constexpr mint& mint::operator=(const mint&)’ is deprecated [-Wdeprecated-copy]
101 | fact_inv[n] = fact[n].inverse(); per(i, n-1, 0) fact_inv[i] = fact_inv[i+1] * mint(i+1);
| ^
Main.cpp:63:9: note: because ‘mint’ has user-provided ‘mint::mint(const mint&)’
63 | mint(const mint &ope) {x = ope.x;}
| ^~~~
Main.cpp:101:95: warning: implicitly-declared ‘constexpr mint& mint::operator=(const mint&)’ is deprecated [-Wdeprecated-copy]
101 | fact_inv[n] = fact[n].inverse(); per(i, n-1, 0) fact_inv[i] = fact_inv[i+1] * mint(i+1);
| ^
Main.cpp:63:9: note: because ‘mint’ has user-provided ‘mint::mint(const mint&)’
63 | mint(const mint &ope) {x = ope.x;}
| ^~~~
Judge Result
| Set Name |
Sample |
All |
| Score / Max Score |
0 / 0 |
350 / 350 |
| Status |
|
|
| Set Name |
Test Cases |
| Sample |
sample_01.txt |
| All |
sample_01.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt |
| Case Name |
Status |
Exec Time |
Memory |
| sample_01.txt |
AC |
1 ms |
3436 KiB |
| test_01.txt |
AC |
42 ms |
3476 KiB |
| test_02.txt |
AC |
43 ms |
3480 KiB |
| test_03.txt |
AC |
43 ms |
3492 KiB |
| test_04.txt |
AC |
40 ms |
3492 KiB |
| test_05.txt |
AC |
28 ms |
4100 KiB |
| test_06.txt |
AC |
25 ms |
3484 KiB |
| test_07.txt |
AC |
12 ms |
3756 KiB |
| test_08.txt |
AC |
35 ms |
3620 KiB |
| test_09.txt |
AC |
28 ms |
3848 KiB |
| test_10.txt |
AC |
34 ms |
3504 KiB |
| test_11.txt |
AC |
27 ms |
3888 KiB |
| test_12.txt |
AC |
26 ms |
3624 KiB |
| test_13.txt |
AC |
13 ms |
3764 KiB |
| test_14.txt |
AC |
15 ms |
3500 KiB |
| test_15.txt |
AC |
19 ms |
3936 KiB |
| test_16.txt |
AC |
18 ms |
3496 KiB |
| test_17.txt |
AC |
18 ms |
4092 KiB |
| test_18.txt |
AC |
22 ms |
3448 KiB |
| test_19.txt |
AC |
8 ms |
3964 KiB |
| test_20.txt |
AC |
47 ms |
3472 KiB |
| test_21.txt |
AC |
3 ms |
4064 KiB |
| test_22.txt |
AC |
44 ms |
3492 KiB |
| test_23.txt |
AC |
17 ms |
4044 KiB |
| test_24.txt |
AC |
29 ms |
3484 KiB |