QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#524547 | #4564. Digital Circuit | kimmoqt | 0 | 21ms | 4144kb | C++20 | 638b | 2024-08-19 19:29:52 | 2024-08-19 19:29:53 |
Judging History
answer
#include "circuit.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MX=2e5+5,mod=1e9+2022;
ll cnt=0, p=0, cur=1;
int N,M;
vector<int> A;
void init(int N, int M, std::vector<int> P, std::vector<int> A) {
::N=N, ::M=M, ::A=A;
cnt=0,p=0;
p=1;
int n=N;
while(n>1) {
n/=2;
p*=2;
}
cur=p*p%mod;
for(int i=0;i<A.size();i++) cnt+=A[i];
}
int count_ways(int L, int R) {
L-=N;
cnt-=A[L];
A[L]^=1;
cnt+=A[L];
return cur*cnt%mod;
}
详细
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 3832kb
input:
1 2 -1 0 0 0 0 1 1 2 2 1 2 2 2 1 2 -1 -1 -2 -2
output:
1 2 1 0 1
result:
wrong answer 5th lines differ - expected: '0', found: '1'
Subtask #2:
score: 0
Wrong Answer
Test #9:
score: 0
Wrong Answer
time: 0ms
memory: 3800kb
input:
1 2 -1 0 0 0 0 1 1 2 2 1 2 2 2 1 2 -1 -1 -2 -2
output:
1 2 1 0 1
result:
wrong answer 5th lines differ - expected: '0', found: '1'
Subtask #3:
score: 0
Skipped
Dependency #1:
0%
Subtask #4:
score: 0
Wrong Answer
Test #43:
score: 0
Wrong Answer
time: 21ms
memory: 4144kb
input:
32767 32768 -1 0 0 1 1 2 2 3 3 4 4 5 5 6 6 7 7 8 8 9 9 10 10 11 11 12 12 13 13 14 14 15 15 16 16 17 17 18 18 19 19 20 20 21 21 22 22 23 23 24 24 25 25 26 26 27 27 28 28 29 29 30 30 31 31 32 32 33 33 34 34 35 35 36 36 37 37 38 38 39 39 40 40 41 41 42 42 43 43 44 44 45 45 46 46 47 47 48 48 49 49 50 50...
output:
869448468 601013012 869448468 137881902 406317358 137881902 869448468 137881902 869448468 137881902 406317358 137881902 869448468 601013012 332577556 64142100 332577556 601013012 869448468 601013012 332577556 601013012 869448468 137881902 406317358 137881902 869448468 601013012 332577556 64142100 79...
result:
wrong answer 3rd lines differ - expected: '431985922', found: '869448468'
Subtask #5:
score: 0
Skipped
Dependency #4:
0%
Subtask #6:
score: 0
Skipped
Dependency #2:
0%
Subtask #7:
score: 0
Skipped
Dependency #3:
0%
Subtask #8:
score: 0
Skipped
Dependency #1:
0%