結果

問題 No.1741 Arrays and XOR Procedure
ユーザー kiyoshi0205kiyoshi0205
提出日時 2021-11-12 21:55:33
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 4,971 bytes
コンパイル時間 5,905 ms
コンパイル使用メモリ 266,920 KB
実行使用メモリ 8,064 KB
最終ジャッジ日時 2024-05-04 08:28:03
合計ジャッジ時間 7,982 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 6 ms
6,656 KB
testcase_01 AC 6 ms
6,656 KB
testcase_02 AC 5 ms
6,784 KB
testcase_03 AC 19 ms
8,064 KB
testcase_04 AC 5 ms
6,656 KB
testcase_05 AC 18 ms
7,936 KB
testcase_06 AC 20 ms
7,936 KB
testcase_07 AC 19 ms
8,064 KB
testcase_08 AC 18 ms
8,064 KB
testcase_09 AC 18 ms
7,680 KB
testcase_10 AC 19 ms
7,808 KB
testcase_11 AC 16 ms
7,552 KB
testcase_12 AC 13 ms
7,296 KB
testcase_13 AC 17 ms
7,680 KB
testcase_14 AC 14 ms
7,424 KB
testcase_15 AC 16 ms
7,552 KB
testcase_16 AC 6 ms
6,656 KB
testcase_17 AC 10 ms
6,784 KB
testcase_18 AC 14 ms
7,552 KB
testcase_19 AC 6 ms
6,656 KB
testcase_20 AC 19 ms
7,936 KB
testcase_21 AC 16 ms
7,680 KB
testcase_22 AC 15 ms
7,424 KB
testcase_23 AC 9 ms
6,912 KB
testcase_24 AC 6 ms
6,656 KB
testcase_25 AC 19 ms
7,936 KB
testcase_26 AC 11 ms
7,040 KB
testcase_27 AC 6 ms
6,784 KB
testcase_28 AC 16 ms
7,552 KB
testcase_29 AC 17 ms
7,808 KB
testcase_30 AC 16 ms
7,552 KB
testcase_31 AC 6 ms
6,656 KB
testcase_32 AC 12 ms
7,168 KB
testcase_33 AC 12 ms
7,296 KB
testcase_34 AC 8 ms
6,784 KB
testcase_35 WA -
testcase_36 AC 7 ms
6,784 KB
testcase_37 AC 11 ms
6,912 KB
testcase_38 AC 19 ms
7,936 KB
testcase_39 AC 10 ms
7,040 KB
testcase_40 AC 5 ms
6,656 KB
testcase_41 AC 8 ms
6,676 KB
testcase_42 AC 6 ms
6,656 KB
testcase_43 RE -
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function 'bool judge(vec)':
main.cpp:145:10: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
  145 |     auto [val,id]=que.top();que.pop();
      |          ^

ソースコード

diff # 

#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// #include<ext/pb_ds/tag_and_trait.hpp>
// using namespace __gnu_pbds;
// #include<boost/multiprecision/cpp_int.hpp>
// namespace multiprecisioninteger = boost::multiprecision;
// using cint=multiprecisioninteger::cpp_int;
using namespace std;
using ll=long long;
using datas=pair<ll,ll>;
using ddatas=pair<long double,long double>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using pvec=vector<datas>;
using pmat=vector<pvec>;
// using llset=tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>;
#define For(i,a,b) for(i=a;i<(ll)b;++i)
#define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i)
#define rep(i,N) For(i,0,N)
#define rep1(i,N) For(i,1,N)
#define brep(i,N) bFor(i,N,0)
#define brep1(i,N) bFor(i,N,1)
#define all(v) (v).begin(),(v).end()
#define allr(v) (v).rbegin(),(v).rend()
#define vsort(v) sort(all(v))
#define vrsort(v) sort(allr(v))
#define uniq(v) vsort(v),(v).erase(unique(all(v)),(v).end())
#define endl "\n"
#define popcount __builtin_popcountll
#define eb emplace_back
#define print(x) cout<<x<<endl
#define printyes print("Yes")
#define printno print("No")
#define printYES print("YES")
#define printNO print("NO")
#define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0)
#define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0)
constexpr ll mod=1000000007;
// constexpr ll mod=998244353;
constexpr ll inf=1LL<<60;
constexpr long double eps=1e-9;
const long double PI=acosl(-1);
template<class T,class E> ostream& operator<<(ostream& os,const pair<T,E>& p){return os<<"("<<p.first<<","<<p.second<<")";}
template<class T> ostream& operator<<(ostream& os,const vector<T>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T> ostream& operator<<(ostream& os,const set<T>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T> ostream& operator<<(ostream& os,const multiset<T>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T,class E> ostream& operator<<(ostream& os,const map<T,E>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T> inline bool chmax(T& a,const T b){bool x=a<b;if(x)a=b;return x;}
template<class T> inline bool chmin(T& a,const T b){bool x=a>b;if(x)a=b;return x;}
#ifdef DEBUG
void debugg(){cout<<endl;}
template<class T,class... Args>void debugg(const T& x,const Args&... args){cout<<" "<<x;debugg(args...);}
#define debug(...) cout<<__LINE__<<" ["<<#__VA_ARGS__<<"]:",debugg(__VA_ARGS__)
#else
#define debug(...) (void(0))
#endif

inline void startupcpp(void) noexcept{
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout<<fixed<<setprecision(15);
}

ll modinv(ll a,const ll m=mod) noexcept{
  ll b=m,u=1,v=0,t;
  while(b){
    t=a/b;
    a-=t*b; swap(a,b);
    u-=t*v; swap(u,v);
  }
  return (u+m)%m;
}

ll moddevide(const ll a,const ll b) noexcept{return (a*modinv(b))%mod;}

vec modncrlistp,modncrlistm;

ll modncr(const ll n,const ll r) noexcept{
  if(n<r)return 0;
  ll i,size=modncrlistp.size();
  if(size<=n){
    modncrlistp.resize(n+1);
    modncrlistm.resize(n+1);
    if(!size){
      modncrlistp[0]=modncrlistm[0]=1;
      size++;
    }
    For(i,size,n+1)modncrlistp[i]=modncrlistp[i-1]*i%mod;
    modncrlistm[n]=modinv(modncrlistp[n]);
    for(i=n;i>size;--i)modncrlistm[i-1]=modncrlistm[i]*i%mod;
  }
  return modncrlistp[n]*modncrlistm[r]%mod*modncrlistm[n-r]%mod;
}

ll modpow(ll a,ll n,const ll m=mod){
  if(n<0)return 0;
  ll res=1;
  while(n>0){
    if(n&1)res=res*a%m;
    a=a*a%m;
    n>>=1;
  }
  return res;
}

constexpr ll gcd(const ll a,const ll b) noexcept{return (!b)?abs(a):(a%b==0)?abs(b):gcd(b,a%b);}
constexpr ll lcm(const ll a,const ll b) noexcept{return a/gcd(a,b)*b;}


ll N,M,K,H,W,A,B,C,D;
string s,t;
ll ans;
bool judge(vec h){
  priority_queue<datas> que;
  ll i;
  rep(i,N){
    que.emplace(h[i],i);
  }
  rep(i,A){
    auto [val,id]=que.top();que.pop();
    assert(h[id]==val);
    h[id]-=C;
    if(h[id]<0)h[id]=0;
    que.emplace(h[id],id);
  }
  auto T=accumulate(all(h),0LL);
  return T<=B*D;
}
vec primefactorization(ll N){
  ll i=2;
  vec res;
  while(i*i<=N){
    while(!(N%i)){
      res.eb(i);
      N/=i;
    }
    i++;
  }
  if(N!=1)res.eb(N);
  return res;
}

#include<atcoder/all>
using mint=atcoder::modint998244353;
mint dp[200001][2][2];
int main(){
  startupcpp();
  ll i,j;
  cin>>N;
  vec b(N);
  rep(i,N){
    cin>>b[i];
    if(((N-1)&i)==i){
      if(b[i]==-1)++B;
      if(b[i]==1)C^=1;
    }else{
      if(b[i]==-1)++A;
    }
  }
  if(B==0&&C==0){
    print(0);
    return 0;
  }
  print((mint(2).pow(A+B-1)).val());
}
0