QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#149167 | #4564. Digital Circuit | juanda_o_182 | 0 | 0ms | 0kb | C++23 | 473b | 2023-08-24 05:42:02 | 2023-08-24 05:42:03 |
answer
#include "circuit.h"
#include <bits/stdc++.h>
using namespace std;
int n,m,on;
vector<int>p;
vector<int>a;
void init(int N, int M, vector<int> P, vector<int> A) {
N=n;
M=m;
for(int i=0;i<int(P.size());i++){
p.push_back(P[i]);
}
for(int i=0;i<int(A.size());i++){
a.push_back(A[i]);
if(A[i]==1){
on+=1;
}
}
}
int count_ways(int L, int R) {
L-=n;
R-=n;
for(int i=L;i<R+1;i++){
if(a[i]==0){
a[i]=1;
on+=1;
}else{
a[i]=0;
on-=1;
}
}
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
Runtime Error
Test #1:
score: 0
Runtime Error
input:
1 2 -1 0 0 0 0 1 1 2 2 1 2 2 2 1 2 -1 -1 -2 -2
output:
result:
Subtask #2:
score: 0
Runtime Error
Test #9:
score: 0
Runtime Error
input:
1 2 -1 0 0 0 0 1 1 2 2 1 2 2 2 1 2 -1 -1 -2 -2
output:
result:
Subtask #3:
score: 0
Skipped
Dependency #1:
0%
Subtask #4:
score: 0
Runtime Error
Test #43:
score: 0
Runtime Error
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:
result:
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%