QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #493488 | #8520. Xor Partitions | MSS_Eggdrop# | WA | 0ms | 3944kb | C++14 | 727b | 2024-07-27 09:48:12 | 2024-07-27 09:48:14 |
Judging History
answer
#include <bits/stdc++.h>
#define fi first
#define se second
#define lb lower_bound
#define pb push_back
#define MOD 1000000007
#define INF (1ll<<60);
using namespace std;
typedef long long LL;
typedef pair<int,int> pii;
int N;
LL D[65], S=1;
int main(){
scanf("%d", &N);
LL x=0;
for (int i=1; i<=N; i++){
LL a;
scanf("%lld", &a);
x ^= a;
LL dp = S % MOD * x % MOD;
for (int j=0; j<60; j++){
if (x & (1ll << j)) dp = (dp - ((1ll << j) % MOD * D[j] % MOD) + MOD) % MOD;
else dp = (dp + ((1ll << j) % MOD * D[j] % MOD)) % MOD;
}
S = (S + dp) % MOD;
for (int j=0; j<60; j++) if (x & (1ll << j)) D[j] = (D[j] + dp) % MOD;
if (i == N) printf("%lld\n", dp);
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3860kb
input:
4 7 3 1 2
output:
170
result:
ok 1 number(s): "170"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3940kb
input:
1 0
output:
0
result:
ok 1 number(s): "0"
Test #3:
score: 0
Accepted
time: 0ms
memory: 3944kb
input:
1 1
output:
1
result:
ok 1 number(s): "1"
Test #4:
score: 0
Accepted
time: 0ms
memory: 3872kb
input:
3 1 2 3
output:
16
result:
ok 1 number(s): "16"
Test #5:
score: 0
Accepted
time: 0ms
memory: 3872kb
input:
4 0 1 0 1
output:
2
result:
ok 1 number(s): "2"
Test #6:
score: -100
Wrong Answer
time: 0ms
memory: 3856kb
input:
562 918479109239293921 960173570446350728 374394588863436385 418106819278123099 473761712658352147 662782574081105364 824954323015093862 827581845536521847 184394794881199801 820907621998888642 606529830885621237 961790689782125501 582742201855597942 337901250755571075 287706594894797714 18578215893...
output:
147704596
result:
wrong answer 1st numbers differ - expected: '641941658', found: '147704596'