# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1086436 | shikgom2 | 씽크스몰 (kriii3_TT) | C++17 | 165 ms | 42372 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pi = array<lint, 2>;
#define sz(a) ((int)(a).size())
#define all(a) (a).begin(), (a).end()
// Convolution mod 2^64
// Source: https://judge.yosupo.jp/submission/75233
// MAXN = max size of polynomials whose convolution will be found
const int MAXN = 1050000;
namespace Conv64 {
using u64 = uint64_t;
struct u64_omega {
using T = u64_omega;
u64 a, b;
constexpr u64_omega() : a(0), b(0) {}
constexpr u64_omega(u64 x) : a(x), b(0) {}
constexpr u64_omega(u64 a, u64 b) : a(a), b(b) {}
constexpr T &to_conj() {
b = -b, a += b;
return *this;
}
constexpr T &operator+=(const T &other) {
a += other.a, b += other.b;
return *this;
}
constexpr T &operator-=(const T &other) {
a -= other.a, b -= other.b;
return *this;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |