oj.uz

Submission #382020

# Submission time Handle Problem Language Result Execution time Memory
382020 2021-03-26T09:46:59 Z vanic Intergalactic ship (IZhO19_xorsum) C++14
9 / 100
 2000 ms 492 KB 
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <cassert>

using namespace std;

typedef long long ll;

const int maxn=1005, mod=1e9+7, maxq=22;

inline int sum(int a, int b){
	if(a+b>=mod){
		return a+b-mod;
	}
	if(a+b<0){
		return a+b+mod;
	}
	return a+b;
}

inline int mul(int a, int b){
	return (ll)a*b%mod;
}

int n, m;
int a[maxn];
int sol;
int q[maxq][3];
bool ocu[maxq];
int pravi[maxn];

void probaj(){
	for(int i=0; i<n; i++){
		pravi[i]=a[i];
	}
	for(int i=0; i<m; i++){
		if(ocu[i]){
			for(int j=q[i][0]; j<=q[i][1]; j++){
				pravi[j]^=q[i][2];
			}
		}
	}
	int kofa;
	for(int i=0; i<n; i++){
		for(int j=i; j<n; j++){
			if(j!=i){
				kofa=2*(i+1)*(n-j);
			}
			else{
				kofa=(i+1)*(n-j);
			}
			sol=sum(sol, mul(kofa, mul(pravi[i], pravi[j])));
		}
	}
}

void rek(int x){
	if(x==m){
		probaj();
		return;
	}
	ocu[x]=0;
	rek(x+1);
	ocu[x]=1;
	rek(x+1);
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin >> n;
	for(int i=0; i<n; i++){
		cin >> a[i];
	}
	cin >> m;
	assert(m<maxq);
	for(int i=0; i<m; i++){
		cin >> q[i][0] >> q[i][1] >> q[i][2];
		q[i][0]--;
		q[i][1]--;
	}
	rek(0);
	cout << sol <<  '\n';
	return 0;
}

Subtask #1
4.0 / 4.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 32 ms 364 KB Output is correct
7 Correct 31 ms 364 KB Output is correct
8 Correct 30 ms 492 KB Output is correct

Subtask #3
0 / 6.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 492 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 492 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2075 ms 364 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2075 ms 364 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 32 ms 364 KB Output is correct
7 Correct 31 ms 364 KB Output is correct
8 Correct 30 ms 492 KB Output is correct
9 Execution timed out 2075 ms 364 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 32 ms 364 KB Output is correct
7 Correct 31 ms 364 KB Output is correct
8 Correct 30 ms 492 KB Output is correct
9 Execution timed out 2075 ms 364 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #9
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 32 ms 364 KB Output is correct
7 Correct 31 ms 364 KB Output is correct
8 Correct 30 ms 492 KB Output is correct
9 Runtime error 1 ms 492 KB Execution killed with signal 6
10 Halted 0 ms 0 KB -