oj.uz

Submission #493281

# Submission time Handle Problem Language Result Execution time Memory
493281 2021-12-10T17:24:42 Z Khizri Intergalactic ship (IZhO19_xorsum) C++17
9 / 100
 2000 ms 2244 KB 
#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define pb push_back		 
#define F first																 
#define S second 															 
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
	if(a>b) swap(a,b);
	if(a==0) return a+b;
	return gcd(b%a,a);
}
ll lcm(ll a,ll b){
	return a/gcd(a,b)*b;
}
bool is_prime(ll n){
	ll k=sqrt(n);
	if(n==2) return true;
	if(n<2||n%2==0||k*k==n) return false;
	for(int i=3;i<=k;i+=2){
		if(n%i==0){
			return false;
		}
	}
	return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=2e5+5;
int t=1,n,m,arr[mxn],l[mxn],r[mxn],x[mxn],ans;
void funk(vector<int>&vt){
	for(int v:vt){
		for(int i=l[v];i<=r[v];i++){
			arr[i]^=x[v];
		}
	}
	for(int i=1;i<=n;i++){
		int sum=0;
		for(int j=i;j<=n;j++){
			sum+=arr[j];
			ans=(ans+((sum*sum)%MOD))%MOD;
		}
	}
	for(int v:vt){
		for(int i=l[v];i<=r[v];i++){
			arr[i]^=x[v];
		}
	}
}
void solve(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>arr[i];
	}
	cin>>m;
	for(int i=1;i<=m;i++){
		cin>>l[i]>>r[i]>>x[i];
	}
	for(int mask=0;mask<(1<<m);mask++){
		vector<int>vt;
		for(int i=0;i<m;i++){
			if(mask&(1<<i)){
				vt.pb(i+1);
			}
		}
		funk(vt);
	}
	cout<<ans<<endl;
}
int main(){
	//IOS;
	//cin>>t;
	while(t--){
		solve();
	}
	return 0;
}

Subtask #1
4.0 / 4.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 24 ms 204 KB Output is correct
7 Correct 24 ms 316 KB Output is correct
8 Correct 25 ms 296 KB Output is correct

Subtask #3
0 / 6.0

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

Subtask #4
0 / 9.0

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

Subtask #5
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2090 ms 204 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 2090 ms 204 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 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 24 ms 204 KB Output is correct
7 Correct 24 ms 316 KB Output is correct
8 Correct 25 ms 296 KB Output is correct
9 Execution timed out 2090 ms 204 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 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 24 ms 204 KB Output is correct
7 Correct 24 ms 316 KB Output is correct
8 Correct 25 ms 296 KB Output is correct
9 Execution timed out 2090 ms 204 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 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 24 ms 204 KB Output is correct
7 Correct 24 ms 316 KB Output is correct
8 Correct 25 ms 296 KB Output is correct
9 Incorrect 54 ms 2244 KB Output isn't correct
10 Halted 0 ms 0 KB -