# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
947478 | dilanyan | Intergalactic ship (IZhO19_xorsum) | C++17 | 2028 ms | 1628 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
//-------------dilanyan------------\\
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<stdio.h>
using namespace std;
//------------------KarginDefines--------------------\\
#define ll long long
#define pb push_back
#define all(u) (u).begin(), (u).end()
#define pqueue priority_queue
#define upper upper_bound
#define lower lower_bound
#define umap unordered_map
#define uset unordered_set
#define Kargin ios_base::sync_with_stdio(false);cin.tie(NULL);
#define Usaco freopen(".in", "r", stdin); freopen(".out", "w", stdout);
//-------------------KarginConstants------------------\\
const ll mod = 1000000007;
const ll inf = 1e9 + 15;
//-------------------KarginCode------------------------\\
const int N = 1005,M = 100005;
ll a[N];
struct query {
int l, r, x;
};
query q[M];
void KarginSolve() {
int n; cin >> n;
for (int i = 0;i < n;i++) cin >> a[i];
int m; cin >> m;
for (int i = 0;i < m;i++) {
cin >> q[i].l >> q[i].r >> q[i].x;
q[i].l--;
}
ll ans = 0;
for (int i = 0;i < (1 << m);i++) {
for (int j = 0;j < m;j++) {
if (i & (1 << j)) {
for (int k = q[j].l;k < q[i].r;k++) a[k] ^= q[i].x;
}
}
for (int x = 0;x < n;x++) {
ll sum = 0;
for (int j = x;j < n;j++) {
sum += a[j];
ans += sum * sum;
ans %= mod;
}
}
for (int j = 0;j < m;j++) {
if (i & (1 << j)) {
for (int k = q[j].l;k < q[i].r;k++) a[k] ^= q[i].x;
}
}
}
cout << ans << '\n';
}
int main() {
Kargin;
int test = 1;
//cin >> test;
while (test--) {
KarginSolve();
}
return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |