#include "circuit.h"
#include <bits/stdc++.h>
#define MAX 300001
#define INF LLONG_MAX
#define MOD 1000002022
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ins insert
#define ff first
#define ss second
#define gett(x,m) get<m>(x)
#define all(a) a.begin(),a.end()
#define lb(a,b) lower_bound(all(a),b)
#define ub(a,b) upper_bound(all(a),b)
#define sortv(a) sort(all(a))
#define sorta(a,sz) sort(a,a+sz)
#define inputar(a,b){\
for(int i=0;i<b;i++){\
cin >> a[i];\
}\
}
#define inputvec(a,b){\
for(int i=0;i<b;i++){\
ll num;\
cin >> num;\
a.pb(num);\
}\
}
#define outputar(a,b){\
for(int i=0;i<b;i++){\
cout << a[i] << " ";\
}\
cout << "\n";\
}
#define outputvec(a){\
for(auto x:a){\
cout << x << " ";\
}\
cout << "\n";\
}
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef tuple<ll,ll,ll> tll;
typedef pair<ll,ll> pll;
typedef double db;
typedef long double ldb;
inline void USACO(string filename){
freopen((filename+".in").c_str(),"r",stdin);
freopen((filename+".out").c_str(),"w",stdout);
}
ll n,q,t=1,m,n2,m2,k,cnt=0,x,y,z,x2,y2,z2,res1=0,cnt1,cnt2,cnt3;
ll c[501][501];
ll fact[MAX];
ll inv_fact[MAX];
//char c;
string str[MAX];
string s1,s2;
vector<tuple<ll,ll,ll>> v;
vector<pll> v1,v2,v3,v4;
const int mod = 998244353;
vector<int> a,b;
vector<vector<ll>> g;
ll dp[2005][2005];
ll dp3[2005][2];
void dfs(ll v){
cout << v << "\n";
ll sz=g[v].size();
if(!sz){
if(b[v-n]==0){
dp3[v][0]=1;
dp3[v][1]=0;
}
else{
dp3[v][0]=0;
dp3[v][1]=1;
}
return;
}
for(int i=0;i<=sz;i++){
dp[v][i]=0;
}
dp3[v][0]=0;
dp3[v][1]=0;
dp[v][0]=1;
vector<ll> arr(sz+1,0);
for(auto x:g[v]){
dfs(x);
for(int i=0;i<=sz;i++){
arr[i]+=(dp[v][i]*dp3[x][0])%MOD;
arr[i]%=MOD;
}
for(int i=1;i<=sz;i++){
arr[i]+=(dp[v][i-1]*dp3[x][1])%MOD;
arr[i]%=MOD;
}
for(int i=0;i<=sz;i++){
dp[v][i]=arr[i];
arr[i]=0;
}
}
for(ll i=0;i<=sz;i++){
dp3[v][1]+=(i*dp[v][i])%MOD;
dp3[v][0]+=((sz-i)*dp[v][i])%MOD;
dp3[v][1]%=MOD;
dp3[v][0]%=MOD;
}
}
void init(int N, int M, std::vector<int> P, std::vector<int> A) {
n=N;
m=M;
a=P;
b=A;
g.resize(N+M);
for(int i=1;i<N+M;i++){
g[P[i]].pb(i);
}
}
int count_ways(int L, int R) {
for(int i=L-n;i<=R-n;i++){
b[i]=(1-b[i]);
}
dfs(0);
return (int)dp3[0][1];
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
5 ms |
9680 KB |
Possible tampering with the output or unexpected termination of the program |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
5 ms |
9680 KB |
Possible tampering with the output or unexpected termination of the program |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
5 ms |
9680 KB |
Possible tampering with the output or unexpected termination of the program |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
29 ms |
26328 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
29 ms |
26328 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
5 ms |
9680 KB |
Possible tampering with the output or unexpected termination of the program |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
5 ms |
9680 KB |
Possible tampering with the output or unexpected termination of the program |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
5 ms |
9680 KB |
Possible tampering with the output or unexpected termination of the program |
| 2 |
Halted |
0 ms |
0 KB |
- |
