Submission #345662

#TimeUsernameProblemLanguageResultExecution timeMemory
345662oleh1421Intergalactic ship (IZhO19_xorsum)C++17
0 / 100
42 ms29292 KiB
//#pragma GCC optimize("Ofast") //#pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> typedef long long ll; using namespace std; #define endl '\n' const int N=1010; const ll mod=1000000007; int S[7][7][N][N]; int a[N]; void solve(){ int n;cin>>n; for (int i=1;i<=n;i++){ cin>>a[i]; } int q;cin>>q; for (int i=1;i<=q;i++){ int l,r,x;cin>>l>>r>>x; for (int j=0;j<7;j++){ for (int t=0;t<7;t++){ if ((x&(1<<j)) && (x&(1<<t))){ S[j][t][l][r]++; } } } } // for (int bit=0;bit<7;bit++){ // for (int i=1;i<=n;++i){ // for (int j=1;j<=n;j++) S[bit][i][j]+=S[bit][i][j-1]; // for (int j=1;j<=n;j++) S[bit][i][j]+=S[bit][i-1][j]; // } // } // for (int i=1;i<=n;i++){ // for (int j=1;j<=n;j++){ // for (int bit_i=0;bit_i<7;bit_i++){ // for (int int bit_j=0;bit_j<7;bit_j++){ // int cnt_i= // } // } // } // } } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); int tt=1; while (tt--){ solve(); } return 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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...