QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#188935 | #7509. 01tree | zhoukangyang# | TL | 11ms | 32384kb | C++11 | 2.2kb | 2023-09-26 16:59:36 | 2023-09-26 16:59:36 |
Judging History
answer
#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long
#define vi vector < int >
#define sz(a) ((int) (a).size())
#define ll long long
#define ull unsigned long long
#define me(a, x) memset(a, x, sizeof(a))
using namespace std;
const int N = 1 << 19, mod = 1e9 + 7;
int qpow(int x, int y = mod - 2) {
int res = 1;
for(; y; x = (ll) x * x % mod, y >>= 1) if(y & 1) res = (ll) res * x % mod;
return res;
}
int fac[N], ifac[N], inv[N];
void init(int x) {
fac[0] = ifac[0] = inv[1] = 1;
L(i, 2, x) inv[i] = (ll) (mod - mod / i) * inv[mod % i] % mod;
L(i, 1, x) fac[i] = (ll) fac[i - 1] * i % mod, ifac[i] = (ll) ifac[i - 1] * inv[i] % mod;
}
int C(int x, int y) {
return x < y || y < 0 ? 0 : (ll) fac[x] * ifac[y] % mod * ifac[x - y] % mod;
}
int n;
char s[N], t[N];
vi e[N];
int scnt[N], snon[N];
int tcnt[N], tnon[N];
int col[N];
void dfs(int x, int fa) {
if(col[x]) {
if(s[x] != '?')
s[x] ^= 1;
if(t[x] != '?')
t[x] ^= 1;
}
scnt[x] = s[x] == '1';
snon[x] = s[x] == '?';
tcnt[x] = t[x] == '1';
tnon[x] = t[x] == '?';
for(auto v : e[x]) if(v != fa) {
col[v] = col[x] ^ 1, dfs(v, x);
scnt[x] += scnt[v];
snon[x] += snon[v];
tcnt[x] += tcnt[v];
tnon[x] += tnon[v];
}
}
void Main() {
cin >> n;
L(i, 1, n - 1) {
int u, v;
cin >> u >> v;
e[u].emplace_back(v);
e[v].emplace_back(u);
}
cin >> (s + 1) >> (t + 1);
col[1] = 0, dfs(1, 0);
int ans = 0;
L(i, 2, n) {
int sx = snon[i];
int sy = snon[1] - snon[i];
int tx = tnon[i];
int ty = tnon[1] - tnon[i];
L(a, 0, sx) {
L(b, 0, tx) {
L(c, 0, sy) {
L(d, 0, ty) {
if(a + c + scnt[1] == b + d + tcnt[1]) {
(ans += (ll) C(sx, a) * C(tx, b) % mod *
C(sy, c) % mod * C(ty, d) % mod *
abs(a + scnt[i] - b - tcnt[i]) % mod) %= mod;
}
}
}
}
}
}
cout << ans << '\n';
L(i, 1, n) {
e[i].clear();
}
}
int main() {
init(2e5 + 7);
ios :: sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int t; cin >> t; while(t--) Main();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 6ms
memory: 32384kb
input:
3 2 1 2 00 11 3 1 2 2 3 ??? ??? 3 1 2 2 3 ??1 0?0
output:
1 16 1
result:
ok 3 number(s): "1 16 1"
Test #2:
score: 0
Accepted
time: 11ms
memory: 32272kb
input:
1000 23 1 2 1 3 1 4 2 5 5 6 4 7 3 8 4 9 8 10 8 11 8 12 1 13 7 14 10 15 7 16 7 17 5 18 18 19 12 20 9 21 21 22 6 23 00?10?0000??1?00111?010 011??1?10?01?110?0??101 6 1 2 1 3 1 4 4 5 3 6 000?10 1???01 25 1 2 2 3 2 4 4 5 5 6 2 7 4 8 5 9 7 10 8 11 11 12 5 13 11 14 3 15 6 16 14 17 1 18 4 19 6 20 4 21 5 22...
output:
53545 24 11724 2228 162 14 711 28 550 1680 52 2 13 988 9480 2342 626416 0 71780 1 88 39207 19448 4 37395 9602 3253496 38057200 1066 3 303732 1608 281022 11718 170 78 15 1219376 29364 9092 7 0 2 7014 1942448 170371 75845 167217 16554 64 904 564290 14822 1127090 1758504 1227646 14833316 14954550 36055...
result:
ok 1000 numbers
Test #3:
score: -100
Time Limit Exceeded
input:
1 3000 1 2 2 3 2 4 1 5 3 6 2 7 5 8 8 9 9 10 10 11 2 12 11 13 7 14 11 15 7 16 13 17 8 18 1 19 11 20 10 21 18 22 7 23 7 24 15 25 23 26 24 27 14 28 15 29 25 30 16 31 6 32 10 33 3 34 30 35 16 36 9 37 36 38 28 39 26 40 33 41 1 42 11 43 20 44 23 45 14 46 31 47 41 48 11 49 48 50 45 51 6 52 10 53 32 54 38 5...