# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1163077 | SmuggingSpun | Intergalactic ship (IZhO19_xorsum) | C++20 | 11 ms | 328 KiB |
#include<bits/stdc++.h>
#define taskname "C"
using namespace std;
const int mod = 1e9 + 7;
const int lim = 1e3 + 5;
void add(int& a, int b){
if((a += b) >= mod){
a -= mod;
}
}
int n, q, a[lim];
namespace sub12{
void solve(){
vector<tuple<int, int, int>>query(q);
for(auto& [l, r, x] : query){
cin >> l >> r >> x;
}
int ans = 0;
vector<int>A(n + 1);
for(int mask = (1 << q) - 1; mask > -1; mask--){
for(int i = 1; i <= n; i++){
A[i] = a[i];
}
for(int i = 0; i < q; i++){
if(1 << i & mask){
auto& [l, r, x] = query[i];
for(int j = l; j <= r; j++){
A[j] ^= x;
}
}
}
for(int i = 1; i <= n; i++){
for(int j = i, sum = 0; j <= n; j++){
sum += A[j];
add(ans, 1LL * sum * sum % mod);
}
}
}
cout << ans;
}
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
if(fopen(taskname".inp", "r")){
freopen(taskname".inp", "r", stdin);
}
cin >> n;
for(int i = 1; i <= n; i++){
cin >> a[i];
}
cin >> q;
if(n <= 100 && q <= 10){
sub12::solve();
}
}
컴파일 시 표준 에러 (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... |