oj.uz

Submission #173240

# Submission time Handle Problem Language Result Execution time Memory
173240 2020-01-03T16:03:13 Z mosiashvililuka Intergalactic ship (IZhO19_xorsum) C++14
9 / 100
 100 ms 1272 KB 
#include<bits/stdc++.h>
using namespace std;
long long a,b,c,d,e,f[1009],i,j,zx,xc,xr[(1<<10)][101],pas,mod=1000000007;
pair <pair <long long, long long>, long long> p[1009];
int main(){
    ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    cin>>a;
    for(i=1; i<=a; i++) cin>>f[i];
    cin>>b;
    for(i=0; i<b; i++){
        cin>>p[i].first.first>>p[i].first.second>>p[i].second;
    }
    if(b<=10){
        for(j=1; j<=a; j++) xr[0][j]=f[j];
        for(i=1; i<(1<<b); i++){
            for(zx=b-1; zx>=0; zx--){
                if((i&(1<<zx))!=0) break;
            }
            for(j=1; j<=a; j++){
                if(p[zx].first.first<=j&&j<=p[zx].first.second){
                    xr[i][j]=(xr[i-(1<<zx)][j]^p[zx].second);
                }else{
                    xr[i][j]=xr[i-(1<<zx)][j];
                }
            }
        }
        for(i=0; i<(1<<b); i++){
            for(j=1; j<=a; j++) xr[i][j]+=xr[i][j-1];
            for(zx=1; zx<=a; zx++){
                for(xc=zx-1; xc>=0; xc--){
                    pas+=(xr[i][xc]-xr[i][zx])*(xr[i][xc]-xr[i][zx]);
                    pas%=mod;
                }
            }
        }
        cout<<pas;
    }
    return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 4 ms 1272 KB Output is correct
4 Correct 4 ms 1144 KB Output is correct
5 Correct 4 ms 1144 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 4 ms 1272 KB Output is correct
4 Correct 4 ms 1144 KB Output is correct
5 Correct 4 ms 1144 KB Output is correct
6 Correct 99 ms 1144 KB Output is correct
7 Correct 100 ms 1236 KB Output is correct
8 Correct 100 ms 1144 KB Output is correct

Subtask #3
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 27 ms 1144 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 4 ms 1272 KB Output is correct
4 Correct 4 ms 1144 KB Output is correct
5 Correct 4 ms 1144 KB Output is correct
6 Correct 99 ms 1144 KB Output is correct
7 Correct 100 ms 1236 KB Output is correct
8 Correct 100 ms 1144 KB Output is correct
9 Incorrect 2 ms 376 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 4 ms 1272 KB Output is correct
4 Correct 4 ms 1144 KB Output is correct
5 Correct 4 ms 1144 KB Output is correct
6 Correct 99 ms 1144 KB Output is correct
7 Correct 100 ms 1236 KB Output is correct
8 Correct 100 ms 1144 KB Output is correct
9 Incorrect 2 ms 376 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #9
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 4 ms 1272 KB Output is correct
4 Correct 4 ms 1144 KB Output is correct
5 Correct 4 ms 1144 KB Output is correct
6 Correct 99 ms 1144 KB Output is correct
7 Correct 100 ms 1236 KB Output is correct
8 Correct 100 ms 1144 KB Output is correct
9 Incorrect 27 ms 1144 KB Output isn't correct
10 Halted 0 ms 0 KB -