Skip to content

Commit

Permalink
fps division
Browse files Browse the repository at this point in the history
  • Loading branch information
potato167 committed Jun 19, 2024
1 parent 1625df1 commit 6689dde
Show file tree
Hide file tree
Showing 2 changed files with 67 additions and 0 deletions.
34 changes: 34 additions & 0 deletions fps/FPS_division.hpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,34 @@
#pragma once
#include <vector>
#include <atcoder/convolution>

#include "FPS_inv.hpp"
namespace po167{
template<class T>
// f = g * res.first + res.second
// |res.first| <= |f| - |g| + 1
// |res.second| <= |g| - 1
std::pair<std::vector<T>, std::vector<T>>
FPS_division(std::vector<T> f, std::vector<T> g){
assert(!f.empty() && f.back() != 0);
assert(!g.empty() && g.back() != 0);
if (f.size() < g.size()){
return {{}, f};
}
// rev(f) / rev(g) = rev(q) (mod x ^ {|f| - |g| + 1})
std::vector<T> r = f;
std::reverse(f.begin(), f.end());
std::reverse(g.begin(), g.end());
int z = (int)f.size() - (int)g.size() + 1;
f.resize(z);
std::vector<T> q = atcoder::convolution(f, FPS_inv(g, z));
q.resize(z);
std::reverse(g.begin(), g.end());
std::reverse(q.begin(), q.end());
f = atcoder::convolution(q, g);
for (int i = 0; i < (int)f.size(); i++) r[i] -= f[i];
while (!q.empty() && q.back() == 0) q.pop_back();
while (!r.empty() && r.back() == 0) r.pop_back();
return {q, r};
}
}
33 changes: 33 additions & 0 deletions test/fps/division.test.cpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,33 @@
#define PROBLEM "https://judge.yosupo.jp/problem/division_of_polynomials"

#include "../../fps/FPS_division.hpp"

#include <vector>
#include <iostream>
#include <atcoder/modint>

int main(){
int N, M, a;
std::cin >> N >> M;
std::vector<atcoder::modint998244353> f(N), g(M);
for (int i = 0; i < N; i++){
std::cin >> a;
f[i] = a;
}
for (int i = 0; i < M; i++){
std::cin >> a;
g[i] = a;
}
auto ans = po167::FPS_division(f, g);
std::cout << ans.first.size() << " " << ans.second.size() << "\n";
for (int i = 0; i < (int)ans.first.size(); i++){
if (i) std::cout << " ";
std::cout << ans.first[i].val();
}
std::cout << "\n";
for (int i = 0; i < (int)ans.second.size(); i++){
if (i) std::cout << " ";
std::cout << ans.second[i].val();
}
std::cout << "\n";
}

0 comments on commit 6689dde

Please sign in to comment.