oj.uz

Submission #868501

# Submission time Handle Problem Language Result Execution time Memory
868501 2023-10-31T15:03:13 Z KiaRez Intergalactic ship (IZhO19_xorsum) C++17
17 / 100
 339 ms 11356 KB 
/*
    IN THE NAME OF GOD
*/
#include <bits/stdc++.h>

// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef long double ld;

#define F                                      first
#define S                                      second
#define Mp                                     make_pair
#define pb                                     push_back
#define pf                                     push_front
#define size(x)                                ((ll)x.size())
#define all(x)                                 (x).begin(),(x).end()
#define kill(x)		                           cout << x << '\n', exit(0);
#define fuck(x)                                cout << "(" << #x << " , " << x << ")" << endl
#define endl                                   '\n'

const int N = 1e6+23, lg = 20;
ll Mod = 1e9+7; //998244353;

inline ll MOD(ll a, ll mod=Mod) {a%=mod; (a<0)&&(a+=mod); return a;}
inline ll poww(ll a, ll b, ll mod=Mod) {
    ll ans = 1;
    a=MOD(a, mod);
    while (b) {
        if (b & 1) ans = MOD(ans*a, mod);
        b >>= 1;
        a = MOD(a*a, mod);
    }
    return ans;
}

ll ans, q, n, l[N], r[N], x[N], pref[N], a[N], sum[N];
int main () {
	ios_base::sync_with_stdio(false), cin.tie(0);

	cin>>n;
	for(int i=1; i<=n; i++) {
		cin>>a[i];
	}
	cin>>q;
	for(int i=1; i<=q; i++) {
		cin>>l[i]>>r[i]>>x[i];
	}
	if(q > 20) kill(0);
	for(int mask=0; mask<(1<<q); mask++) {
		fill(pref, pref+n+2, 0);
		for(int i=1; i<=q; i++) {
			if((mask>>(i-1))%2 == 0) continue;
			pref[l[i]] ^= x[i];
			pref[r[i]+1] ^= x[i];
		}
		for(int i=1; i<=n; i++) pref[i] ^= pref[i-1];

		ll tmp=0;
		for(int i=1; i<=n; i++) {
			sum[i] = sum[i-1] + (a[i]^pref[i]);
			tmp += sum[i];
			ans = MOD(ans - 2ll*tmp*sum[i] + MOD(sum[i]*sum[i])*(n+2));
		}
	}

	cout<<ans<<endl;

	return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10704 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 10656 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 2 ms 10588 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10704 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 10656 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 2 ms 10588 KB Output is correct
6 Correct 3 ms 10584 KB Output is correct
7 Correct 2 ms 10588 KB Output is correct
8 Correct 3 ms 10584 KB Output is correct

Subtask #3
0 / 6.0

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

Subtask #4
0 / 9.0

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

Subtask #5
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 332 ms 10948 KB Output is correct
2 Correct 339 ms 10700 KB Output is correct
3 Correct 330 ms 10696 KB Output is correct

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 332 ms 10948 KB Output is correct
2 Correct 339 ms 10700 KB Output is correct
3 Correct 330 ms 10696 KB Output is correct
4 Incorrect 2 ms 10588 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10704 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 10656 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 2 ms 10588 KB Output is correct
6 Correct 3 ms 10584 KB Output is correct
7 Correct 2 ms 10588 KB Output is correct
8 Correct 3 ms 10584 KB Output is correct
9 Correct 332 ms 10948 KB Output is correct
10 Correct 339 ms 10700 KB Output is correct
11 Correct 330 ms 10696 KB Output is correct
12 Incorrect 2 ms 8540 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10704 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 10656 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 2 ms 10588 KB Output is correct
6 Correct 3 ms 10584 KB Output is correct
7 Correct 2 ms 10588 KB Output is correct
8 Correct 3 ms 10584 KB Output is correct
9 Correct 332 ms 10948 KB Output is correct
10 Correct 339 ms 10700 KB Output is correct
11 Correct 330 ms 10696 KB Output is correct
12 Incorrect 2 ms 10588 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #9
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10704 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 10656 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 2 ms 10588 KB Output is correct
6 Correct 3 ms 10584 KB Output is correct
7 Correct 2 ms 10588 KB Output is correct
8 Correct 3 ms 10584 KB Output is correct
9 Incorrect 13 ms 11356 KB Output isn't correct
10 Halted 0 ms 0 KB -