Submission #410259

#	Time	Username	Problem	Language	Result	Execution time	Memory
410259		rrrr10000	Intergalactic ship (IZhO19_xorsum)	C++14	47 / 100	2083 ms	4416 KiB

xorsum

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define pb emplace_back
#define lb(v,k) (lower_bound(all(v),(k))-v.begin())
#define ub(v,k) (upper_bound(all(v),(k))-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define all(a) a.begin(),a.end()
#define rsort(a) {sort(all(a));reverse(all(a));}
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void outset(T s){auto itr=s.begin();while(itr!=s.end()){if(itr!=s.begin())cout<<' ';cout<<*itr;itr++;}cout<<'\n';}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}

int main(){
    ll n;cin>>n;
    vi v(n);rep(i,n)cin>>v[i];
    ll q;cin>>q;
    vi l(q),r(q),val(q);
    rep(i,q){
        cin>>l[i]>>r[i]>>val[i];l[i]--;r[i]--;
    }
    ll ans=0;
    vi mp(q+5);
    mp[0]=1;rep(i,q+4)mp[i+1]=mp[i]*2%mod;
    rep(a,7)rep(b,7){
        rep(i,n)REP(j,i,n){
            ll res=0;
            vvi cnt(2,vi(2));
            rep(k,q){
                ll c=0,d=0;
                if((val[k]>>a&1)&&l[k]<=i&&i<=r[k])c=1;
                if((val[k]>>b&1)&&l[k]<=j&&j<=r[k])d=1;
                cnt[c][d]++;
            }
            if(cnt[1][1]){
                if(cnt[1][0]+cnt[0][1])res+=mp[q-2];
                else if((v[i]>>a&1)==(v[j]>>b&1))res+=mp[q-1];
            }
            else{
                ll tmp=1;
                if(cnt[1][0])tmp*=mp[cnt[1][0]-1];
                else if(!(v[i]>>a&1))tmp=0;
                if(cnt[0][1])tmp*=mp[cnt[0][1]-1];
                else if(!(v[j]>>b&1))tmp=0;
                res+=tmp%mod*mp[cnt[0][0]]%mod;
            }
            if(i==j)ans+=res%mod*(1<<a+b)%mod*(i+1)*(n-j)%mod;
            else ans+=2*res%mod*(1<<a+b)%mod*(i+1)*(n-j)%mod;
        }
    }
    out(ans%mod);
}

Compilation message (stderr)

xorsum.cpp: In function 'int main()':
xorsum.cpp:84:39: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   84 |             if(i==j)ans+=res%mod*(1<<a+b)%mod*(i+1)*(n-j)%mod;
      |                                      ~^~
xorsum.cpp:85:38: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   85 |             else ans+=2*res%mod*(1<<a+b)%mod*(i+1)*(n-j)%mod;
      |                                     ~^~

• Subtask 1: 4 / 4
• Subtask 2: 5 / 5
• Subtask 3: 0 / 6
• Subtask 4: 0 / 9
• Subtask 5: 8 / 8
• Subtask 6: 11 / 11
• Subtask 7: 19 / 19
• Subtask 8: 0 / 30
• Subtask 9: 0 / 8