QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#579055 | #4564. Digital Circuit | ModyKachef# | 0 | 1ms | 4072kb | C++23 | 680b | 2024-09-21 06:13:49 | 2024-09-21 06:13:50 |
answer
#include "circuit.h"
#include <bits/stdc++.h>
#include <vector>
using namespace std;
vector<vector<int>> adj ;
vector<int> a;
int n , m;
vector<int> dp;
const int mod = 1000002022;
void dfs(int node){
if (node >= n) {dp[node] = a[node]; return; }
for (auto i : adj[node]){
dfs(i);
dp[node] += dp[i];
}
}
void init(int N, int M, std::vector<int> P, std::vector<int> A) {
n= N, m = M;
a = A;
adj.assign(N+M , {});
for (int i = 1 ; i < N + M ; i++){
adj[P[i]].push_back(i);
}
}
int count_ways(int L, int R) {
for (int i = L ; i <= R ; i++) a[i-n]^=1;
dp.assign(n+m , 0);
dfs(0);
return dp[0];
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 4072kb
input:
1 2 -1 0 0 0 0 1 1 2 2 1 2 2 2 1 2 -1 -1 -2 -2
output:
0 1 0 1 0
result:
wrong answer 3rd lines differ - expected: '1', found: '0'
Subtask #2:
score: 0
Wrong Answer
Test #9:
score: 0
Wrong Answer
time: 1ms
memory: 3768kb
input:
1 2 -1 0 0 0 0 1 1 2 2 1 2 2 2 1 2 -1 -1 -2 -2
output:
0 1 0 1 0
result:
wrong answer 3rd lines differ - expected: '1', found: '0'
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%