oj.uz

Submission #919652

# Submission time Handle Problem Language Result Execution time Memory
919652 2024-02-01T10:34:20 Z manizare Intergalactic ship (IZhO19_xorsum) C++14
100 / 100
 206 ms 17644 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("O3,unroll-loops")
#define pb push_back
#define F first
#define S second 
#define all(a) a.begin(),a.end()
#define pii pair <int,int>
#define PII pair<pii , pii>
#define int long long 
#define sz(v) (int)v.size()
#define rep(i , a , b) for(int i=a;i <= (b);i++)
#define per(i , a , b) for(int i=a;i >= (b);i--)
#define deb(x) cout <<#x << " : " << x << "\n" ; 
using namespace std ;   
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxn = 2002+ 10 , maxq = 1e6+10 , lg = 18 , inf= 1e9 , mod = 1e9+7 ;
int t[maxn] ,prt[maxn] , f[maxn][9] , pr[maxn][8] , a2[maxq] , pr2[maxn][8] , a[maxn];
 
struct bz{
    int l , r , w ;
};
bz b[maxq] ;
vector <int> L[maxn] , R[maxn] ;
 
signed main(){
	ios_base::sync_with_stdio(false);cin.tie(0);
    a2[0] = 1;
    rep(i , 1, maxq-1){
        a2[i] = a2[i-1] * 2 % mod ;
    }
    int n ;cin >> n; 
    rep(i , 1, n){
        cin >> a[i] ;
    }
    int Q ;
    cin >> Q; 
    rep(i , 1, Q){
        cin >> b[i].l >> b[i].r >> b[i].w;  
        L[b[i].l].pb(i); 
        R[b[i].r].pb(i) ;
        rep(j , 0 , 6){
            pr2[b[i].l][j] += (b[i].w>>j&1) ;
            pr2[b[i].r+1][j] -= (b[i].w>>j&1) ;
        }
    }
    rep(i , 1, n){
        rep(j , 0 , 6){
            pr2[i][j] += pr2[i-1][j] ;
        }
    }
    int ans =0 ;
    rep(k , 0 , 6){
        rep(i , 1 , n){
            for(int id : L[i]){
                if((b[id].w>>k&1) == 0)continue ;
                rep(z , 0 , 6){
                    f[b[id].r][z] += (b[id].w>>z&1) ;
                }
            }
            rep(z , 0 , 6){
                int sm= 0  ;
                per(j , n, i){
                    sm += f[j][z] ;
                    int o[2][2] ;
                    o[1][1] = sm ;
                    o[1][0] = pr2[i][k] - sm;
                    o[0][1] = pr2[j][z] - sm ;
                    o[0][0] = Q - o[0][1] - o[1][0] - o[1][1] ;
                    int Z = i * (n-j+1) % mod * (1ll<<k) %mod * (1ll<<z)%mod;
                    if(i != j)Z = Z * 2 % mod ;
                    if((o[1][1]!=0)+(o[1][0]!=0)+(o[0][1]!=0) >= 2){
                        ans = (ans + Z * a2[Q-2] % mod)%mod ;
                    }else if((o[1][1]!=0)+(o[1][0]!=0)+(o[0][1]!=0) == 0){
                        if((a[i]>>k&1) && (a[j]>>z&1))ans = (ans + Z * a2[Q])%mod;
                    }else{
                        int x1 = 1 , y1 =1 ;
                        if(o[0][1] != 0)x1 = 0;
                        if(o[1][0] != 0)y1 = 0 ;
                        if(((a[i]>>k&1)) && (a[j]>>z&1))ans = (ans + Z * a2[Q-1]) % mod ;
                        if(((a[i]>>k&1)^(x1==1)) &&  ((a[j]>>z&1)^(y1==1)))ans = (ans + Z * a2[Q-1]) % mod ;
                    }            
                }
            }
        }
        rep(i , 0 , n){
            rep(j , 0 , 6){
                f[i][j] = 0;
            }
        }
    }
    cout << ans << "\n"; 
}
/*
    
*/

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9304 KB Output is correct
2 Correct 5 ms 9304 KB Output is correct
3 Correct 5 ms 9308 KB Output is correct
4 Correct 5 ms 9308 KB Output is correct
5 Correct 6 ms 9508 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9304 KB Output is correct
2 Correct 5 ms 9304 KB Output is correct
3 Correct 5 ms 9308 KB Output is correct
4 Correct 5 ms 9308 KB Output is correct
5 Correct 6 ms 9508 KB Output is correct
6 Correct 8 ms 9304 KB Output is correct
7 Correct 6 ms 9304 KB Output is correct
8 Correct 7 ms 9304 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 15696 KB Output is correct
2 Correct 9 ms 11612 KB Output is correct
3 Correct 7 ms 9308 KB Output is correct
4 Correct 7 ms 9308 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 173 ms 9304 KB Output is correct
2 Correct 182 ms 9304 KB Output is correct
3 Correct 141 ms 9304 KB Output is correct
4 Correct 138 ms 9304 KB Output is correct

Subtask #5
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9304 KB Output is correct
2 Correct 6 ms 9304 KB Output is correct
3 Correct 6 ms 9304 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9304 KB Output is correct
2 Correct 6 ms 9304 KB Output is correct
3 Correct 6 ms 9304 KB Output is correct
4 Correct 7 ms 11608 KB Output is correct
5 Correct 7 ms 11612 KB Output is correct
6 Correct 7 ms 11612 KB Output is correct
7 Correct 7 ms 11612 KB Output is correct

Subtask #7
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9304 KB Output is correct
2 Correct 5 ms 9304 KB Output is correct
3 Correct 5 ms 9308 KB Output is correct
4 Correct 5 ms 9308 KB Output is correct
5 Correct 6 ms 9508 KB Output is correct
6 Correct 8 ms 9304 KB Output is correct
7 Correct 6 ms 9304 KB Output is correct
8 Correct 7 ms 9304 KB Output is correct
9 Correct 5 ms 9304 KB Output is correct
10 Correct 6 ms 9304 KB Output is correct
11 Correct 6 ms 9304 KB Output is correct
12 Correct 8 ms 9304 KB Output is correct
13 Correct 7 ms 9304 KB Output is correct
14 Correct 7 ms 9304 KB Output is correct
15 Correct 7 ms 9308 KB Output is correct

Subtask #8
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9304 KB Output is correct
2 Correct 5 ms 9304 KB Output is correct
3 Correct 5 ms 9308 KB Output is correct
4 Correct 5 ms 9308 KB Output is correct
5 Correct 6 ms 9508 KB Output is correct
6 Correct 8 ms 9304 KB Output is correct
7 Correct 6 ms 9304 KB Output is correct
8 Correct 7 ms 9304 KB Output is correct
9 Correct 5 ms 9304 KB Output is correct
10 Correct 6 ms 9304 KB Output is correct
11 Correct 6 ms 9304 KB Output is correct
12 Correct 7 ms 11608 KB Output is correct
13 Correct 7 ms 11612 KB Output is correct
14 Correct 7 ms 11612 KB Output is correct
15 Correct 7 ms 11612 KB Output is correct
16 Correct 8 ms 9304 KB Output is correct
17 Correct 7 ms 9304 KB Output is correct
18 Correct 7 ms 9304 KB Output is correct
19 Correct 7 ms 9308 KB Output is correct
20 Correct 75 ms 17244 KB Output is correct
21 Correct 73 ms 16732 KB Output is correct
22 Correct 62 ms 17256 KB Output is correct

Subtask #9
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9304 KB Output is correct
2 Correct 5 ms 9304 KB Output is correct
3 Correct 5 ms 9308 KB Output is correct
4 Correct 5 ms 9308 KB Output is correct
5 Correct 6 ms 9508 KB Output is correct
6 Correct 8 ms 9304 KB Output is correct
7 Correct 6 ms 9304 KB Output is correct
8 Correct 7 ms 9304 KB Output is correct
9 Correct 26 ms 15696 KB Output is correct
10 Correct 9 ms 11612 KB Output is correct
11 Correct 7 ms 9308 KB Output is correct
12 Correct 7 ms 9308 KB Output is correct
13 Correct 173 ms 9304 KB Output is correct
14 Correct 182 ms 9304 KB Output is correct
15 Correct 141 ms 9304 KB Output is correct
16 Correct 138 ms 9304 KB Output is correct
17 Correct 5 ms 9304 KB Output is correct
18 Correct 6 ms 9304 KB Output is correct
19 Correct 6 ms 9304 KB Output is correct
20 Correct 7 ms 11608 KB Output is correct
21 Correct 7 ms 11612 KB Output is correct
22 Correct 7 ms 11612 KB Output is correct
23 Correct 7 ms 11612 KB Output is correct
24 Correct 8 ms 9304 KB Output is correct
25 Correct 7 ms 9304 KB Output is correct
26 Correct 7 ms 9304 KB Output is correct
27 Correct 7 ms 9308 KB Output is correct
28 Correct 75 ms 17244 KB Output is correct
29 Correct 73 ms 16732 KB Output is correct
30 Correct 62 ms 17256 KB Output is correct
31 Correct 187 ms 17644 KB Output is correct
32 Correct 206 ms 16724 KB Output is correct
33 Correct 195 ms 17492 KB Output is correct
34 Correct 176 ms 16424 KB Output is correct
35 Correct 175 ms 16328 KB Output is correct
36 Correct 162 ms 16328 KB Output is correct