baoshuo/OI-codes
baoshuo/OI-codes
0
1
Fork 0
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-11-23 19:08:47 +00:00
Code Releases Activity

P4512 【模板】多项式除法

Browse Source 
https://www.luogu.com.cn/record/96412945
This commit is contained in:
Baoshuo Ren 2022-12-03 15:59:20 +08:00
parent c1d49f8976
commit d73cc89f59
Signed by: baoshuo
GPG Key ID: 00CB9680AB29F51A
1 changed files with 29 additions and 19 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

48
Luogu/P4512/P4512.cpp
View File

@ -138,6 +138,32 @@ class Poly : public std::vector<long long> {
return b;
}
static std::pair<Poly, Poly> div(Poly f, Poly g) {
int n = f.size() - 1,
m = g.size() - 1;
Poly rev_f{f}, rev_g{g};
std::reverse(rev_f.begin(), rev_f.end());
std::reverse(rev_g.begin(), rev_g.end());
rev_g.resize(n - m + 1);
rev_g = Poly::inv(rev_g);
rev_f = rev_g * rev_f;
Poly q(n - m + 1), r(m);
for (int i = 0; i <= n - m; i++) {
q[i] = rev_f[n - m - i];
}
g = g * q;
for (int i = 0; i < m; i++) {
r[i] = ((f[i] - g[i]) % mod + mod) % mod;
}
return {q, r};
}
} poly;
int main() {
@ -158,25 +184,9 @@ int main() {
cin >> g[i];
}
Poly rev_f{f}, rev_g{g};
std::reverse(rev_f.begin(), rev_f.end());
std::reverse(rev_g.begin(), rev_g.end());
rev_g.resize(n - m + 1);
rev_g = Poly::inv(rev_g);
rev_f = rev_g * rev_f;
Poly q(n - m + 1), r(m);
for (int i = 0; i <= n - m; i++) {
q[i] = rev_f[n - m - i];
}
g = g * q;
for (int i = 0; i < m; i++) {
r[i] = ((f[i] - g[i]) % mod + mod) % mod;
}
auto res = Poly::div(f, g);
Poly q = res.first,
r = res.second;
for (int i = 0; i <= n - m; i++) {
cout << q[i] << ' ';