結果
| 問題 |
No.2104 Multiply-Add
|
| コンテスト | |
| ユーザー |
 fuppy_kyopro
|
| 提出日時 | 2022-10-21 22:28:51 |
| 言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 11 ms / 2,000 ms |
| コード長 | 6,514 bytes |
| コンパイル時間 | 11,612 ms |
| コンパイル使用メモリ | 287,784 KB |
| 最終ジャッジ日時 | 2025-02-08 10:15:42 |
|
ジャッジサーバーID （参考情報） |
judge5 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 32 |
ソースコード
//*
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//*/
// #include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
// using namespace atcoder;
// #define _GLIBCXX_DEBUG
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int iiiiiiii = 0; iiiiiiii < v.size(); iiiiiiii++) \
cerr << " " << v[iiiiiiii]; \
cerr << endl;
#define DEBUG_MAT(v) \
cerr << #v << endl; \
for (int iv = 0; iv < v.size(); iv++) { \
for (int jv = 0; jv < v[iv].size(); jv++) { \
cerr << v[iv][jv] << " "; \
} \
cerr << endl; \
}
typedef long long ll;
// #define int ll
#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define vs vector<string>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
template <class S, class T>
pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) {
return pair<S, T>(s.first + t.first, s.second + t.second);
}
template <class S, class T>
pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template <class S, class T>
ostream &operator<<(ostream &os, pair<S, T> p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
#define X first
#define Y second
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rrep1(i, n) for (int i = (int)(n); i > 0; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(), c.end()
void YES(bool t = true) {
cout << (t ? "YES" : "NO") << endl;
}
void Yes(bool t = true) { cout << (t ? "Yes" : "No") << endl; }
void yes(bool t = true) { cout << (t ? "yes" : "no") << endl; }
void NO(bool t = true) { cout << (t ? "NO" : "YES") << endl; }
void No(bool t = true) { cout << (t ? "No" : "Yes") << endl; }
void no(bool t = true) { cout << (t ? "no" : "yes") << endl; }
template <class T>
bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
int popcount(ll t) { return __builtin_popcountll(t); }
// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {0, 0, -1, 1}, dy = {-1, 1, 0, 0};
vi dx2 = {1, 1, 0, -1, -1, -1, 0, 1}, dy2 = {0, 1, 1, 1, 0, -1, -1, -1};
struct Setup_io {
Setup_io() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cout << fixed << setprecision(25);
}
} setup_io;
// const ll MOD = 1000000007;
const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'
struct dice {
mt19937 mt;
dice() : mt(chrono::steady_clock::now().time_since_epoch().count()) {}
// [0, x)の一様乱数
ll operator()(ll x) { return this->operator()(0, x); }
// [x, y)の一様乱数
ll operator()(ll x, ll y) {
uniform_int_distribution<ll> dist(x, y - 1);
return dist(mt);
}
vl operator()(int n, ll x, ll y) {
vl res(n);
for (int i = 0; i < n; i++)
res[i] = this->operator()(x, y);
return res;
}
} rnd;
// signed main() {
// vector<pii> ans(1, pii(0, 1));
// set<pii> st;
// st.insert(pii(0, 1));
// rep(_, 10000000) {
// int idx = rnd(ans.size());
// auto p = ans[idx];
// int t = rnd(2);
// int k = rnd(-10, 10);
// if (t == 0) {
// p.second += p.first * k;
// } else {
// p.first += p.second * k;
// }
// if (p.first > p.second) {
// swap(p.first, p.second);
// }
// if (max(abs(p.first), abs(p.second)) >= 20) {
// continue;
// }
// if (st.count(p)) {
// continue;
// }
// st.insert(p);
// ans.push_back(p);
// }
// sort(all(ans));
// map<int, vi> mp;
// for (auto [x, y] : ans) {
// mp[x].push_back(y);
// }
// for (auto [x, ys] : mp) {
// DEBUG(x);
// DEBUG_VEC(ys);
// }
// // DEBUG_VEC(ans);
// }
ll gcd(ll a, ll b) {
if (b > a) {
swap(a, b);
}
if (b == 0) return a;
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
ll lcm(ll a, ll b) {
return (a / gcd(a, b)) * b;
}
vector<pll> red(ll a, ll b) {
vector<pll> ans;
if (a < 0) {
if (b < 0) {
ans.emplace_back(2, 1);
b += a;
ans.emplace_back(1, -1);
a -= b;
} else {
ans.emplace_back(2, -1);
b -= a;
ans.emplace_back(1, 1);
a += b;
}
}
assert(a >= 0);
if (b < 0) {
ans.emplace_back(1, -1);
a -= b;
ans.emplace_back(2, 1);
b += a;
}
assert(b >= 0);
while (a > 0 && b > 0) {
if (a >= b) {
ll k = a / b;
ans.emplace_back(1, -k);
a -= b * k;
} else {
ll k = b / a;
ans.emplace_back(2, -k);
b -= a * k;
}
}
if (a == 0) {
ans.emplace_back(1, 1);
ans.emplace_back(2, -1);
}
return ans;
}
signed main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll g1 = gcd(abs(a), abs(b));
ll g2 = gcd(abs(c), abs(d));
if (g1 != g2) {
cout << -1 << endl;
return 0;
}
auto to = red(a, b);
auto from = red(c, d);
reverse(all(from));
cout << to.size() + from.size() << endl;
for (auto [t, k] : to) {
cout << t << " " << k << endl;
}
for (auto [t, k] : from) {
cout << t << " " << -k << endl;
}
}