#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "circuit.h"
const ll MOD = 1000002022;
bool test5;
int n, sz;
VVI gp;
VI val;
VL dpa; // sev
VL dpb; // spitak
void dfs(int u);
void init(int N, int M, VI P, VI A) {
n = N + M;
sz = M;
gp = VVI(n);
rep(u, n) if (u) gp[P[u]].pb(u);
val = VI(n);
rep(u, M) val[u+N] = A[u];
test5 = true;
replr(i, 1, n-1) if (P[i] != (i-1)/2) {
test5 = false;
break;
}
if (M != N+1) test5 = false;
if (M & (M-1)) test5 = false;
if (test5) {
cout << "TEST 5" << endl;
dpa = dpb = VL(n);
dfs(0);
}
}
VL subsets(VL& a, VL& b) {
int n = a.size();
VVL dp(n+1, VL(n+1));
dp[0][0] = 1;
replr(j, 1, n) dp[j][0] = dp[j-1][0]*b[j-1]%MOD;
replr(i, 1, n) replr(j, 1, n) {
dp[i][j] = dp[i-1][j-1]*a[i-1]%MOD + dp[i-1][j]*b[i-1]%MOD;
dp[i][j] %= MOD;
}
VL ret(n+1);
replr(i, 0, n) ret[i] = dp[n][i];
return ret;
}
void recalc(int u) {
dpa[u] = dpb[u] = 0;
if (gp[u].size() == 0) {
if (val[u]) dpa[u] = 1;
else dpb[u] = 1;
return;
}
VL a, b;
for (int v : gp[u]) {
a.pb(dpa[v]);
b.pb(dpb[v]);
}
int c = gp[u].size();
VL s = subsets(a, b);
replr(i, 0, c) {
dpa[u] += s[i]*i % MOD;
dpa[u] %= MOD;
dpb[u] += s[i]*(c-i) % MOD;
dpb[u] %= MOD;
}
}
void dfs(int u = 0) {
for (int v : gp[u]) dfs(v);
recalc(u);
}
void upd(int N, int L, int R, int i) {
if (i < L || i > R) return;
if (L == R) {
swap(dpa[N], dpb[N]);
return;
}
int M = (L + R) / 2;
upd(2*N+1, L, M, i);
upd(2*N+2, M+1, R, i);
recalc(N);
}
int count_ways(int L, int R) {
if (test5) {
int ind = L;
upd(0, sz-1, 2*(sz-1), ind);
} else {
replr(i, L, R) val[i] = !val[i];
dpa = dpb = VL(n);
dfs();
}
return dpa[0];
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
344 KB |
Possible tampering with the output or unexpected termination of the program |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
344 KB |
Possible tampering with the output or unexpected termination of the program |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
344 KB |
Possible tampering with the output or unexpected termination of the program |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
16 ms |
4952 KB |
Execution killed with signal 13 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
16 ms |
4952 KB |
Execution killed with signal 13 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
344 KB |
Possible tampering with the output or unexpected termination of the program |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
344 KB |
Possible tampering with the output or unexpected termination of the program |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
344 KB |
Possible tampering with the output or unexpected termination of the program |
| 2 |
Halted |
0 ms |
0 KB |
- |
