oj.uz

답안 #1114489

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1114489 2024-11-19T05:25:22 Z stdfloat Intergalactic ship (IZhO19_xorsum) C++17
17 / 100
 2000 ms 1616 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

const int md = (int)1e9 + 7;

int main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);

	int n;
	cin >> n;

	vector<int> a(n + 1);
	for (int i = 1; i <= n; i++)
		cin >> a[i];

	int q;
	cin >> q;

	vector<int> l(q + 1), r(q + 1), x(q + 1);
	for (int i = 1; i <= q; i++)
		cin >> l[i] >> r[i] >> x[i];

	int ans = 0;
	for (int mk = 0; mk < 1 << q; mk++) {
		vector<int> v = a;
		for (int i = 1; i <= q; i++) {
			if ((mk >> (i - 1)) & 1) {
				for (int j = l[i]; j <= r[i]; j++)
					v[j] ^= x[i];
			}
		}

		vector<int> p(n + 1);
		for (int i = 1; i <= n; i++)
			p[i] = p[i - 1] + v[i];

		int sm = 0, sms = 0;
		for (int i = 1; i <= n; i++) {
			int x = (ll)p[i] * p[i] % md;

			ans = (ans + (((ll)i * x % md - (ll)p[i] * sm % md + md) % md + sms + md) % md) % md;

			sms = (sms + x) % md;
			sm = (sm + (p[i] << 1)) % md;
		}
	}

	cout << ans;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 504 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 504 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 3 ms 336 KB Output is correct
7 Correct 2 ms 336 KB Output is correct
8 Correct 2 ms 336 KB Output is correct

Subtask #3
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 14 ms 1616 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2064 ms 336 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 511 ms 584 KB Output is correct
2 Correct 512 ms 440 KB Output is correct
3 Correct 506 ms 440 KB Output is correct

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 511 ms 584 KB Output is correct
2 Correct 512 ms 440 KB Output is correct
3 Correct 506 ms 440 KB Output is correct
4 Incorrect 5 ms 504 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 504 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 3 ms 336 KB Output is correct
7 Correct 2 ms 336 KB Output is correct
8 Correct 2 ms 336 KB Output is correct
9 Correct 511 ms 584 KB Output is correct
10 Correct 512 ms 440 KB Output is correct
11 Correct 506 ms 440 KB Output is correct
12 Incorrect 11 ms 336 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 504 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 3 ms 336 KB Output is correct
7 Correct 2 ms 336 KB Output is correct
8 Correct 2 ms 336 KB Output is correct
9 Correct 511 ms 584 KB Output is correct
10 Correct 512 ms 440 KB Output is correct
11 Correct 506 ms 440 KB Output is correct
12 Incorrect 5 ms 504 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #9
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 504 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 3 ms 336 KB Output is correct
7 Correct 2 ms 336 KB Output is correct
8 Correct 2 ms 336 KB Output is correct
9 Incorrect 14 ms 1616 KB Output isn't correct
10 Halted 0 ms 0 KB -