結果
| 問題 | No.2104 Multiply-Add |
| ユーザー |
 tokusakurai
|
| 提出日時 | 2022-10-21 21:58:54 |
| 言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
| 結果 |
CE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 4,325 bytes |
| コンパイル時間 | 2,007 ms |
| コンパイル使用メモリ | 196,872 KB |
| 最終ジャッジ日時 | 2024-11-15 02:44:31 |
| 合計ジャッジ時間 | 2,454 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge1 |
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
main.cpp: In instantiation of 'void printn(const std::vector<_Tp>&, T) [with T = std::pair<int, long long int>]':
main.cpp:182:11: required from here
main.cpp:51:46: error: no match for 'operator+' (operand types are 'const __gnu_cxx::__alloc_traits<std::allocator<std::pair<int, long long int> >, std::pair<int, long long int> >::value_type' {aka 'const std::pair<int, long long int>'} and 'std::pair<int, long long int>')
51 | for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
| ~~~~~^~~
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:67,
from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/specfun.h:45,
from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/cmath:1935,
from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/x86_64-pc-linux-gnu/bits/stdc++.h:41,
from main.cpp:1:
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_iterator.h:630:5: note: candidate: 'template<class _Iterator> constexpr std::reverse_iterator<_Iterator> std::operator+(typename reverse_iterator<_Iterator>::difference_type, const reverse_iterator<_Iterator>&)'
630 | operator+(typename reverse_iterator<_Iterator>::difference_type __n,
| ^~~~~~~~
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_iterator.h:630:5: note: template argument deduction/substitution failed:
main.cpp:51:46: note: 'std::pair<int, long long int>' is not derived from 'const std::reverse_iterator<_Iterator>'
51 | for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
| ~~~~~^~~
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_iterator.h:1804:5: note: candidate: 'template<class _Iterator> constexpr std::move_iterator<_IteratorL> std::operator+(typename move_iterat
ソースコード
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define per(i, n) for (int i = (n)-1; i >= 0; i--)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)
#define each(e, v) for (auto &e : v)
#define MM << " " <<
#define pb push_back
#define eb emplace_back
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
template <typename T>
using minheap = priority_queue<T, vector<T>, greater<T>>;
template <typename T>
using maxheap = priority_queue<T>;
template <typename T>
bool chmax(T &x, const T &y) {
return (x < y) ? (x = y, true) : false;
}
template <typename T>
bool chmin(T &x, const T &y) {
return (x > y) ? (x = y, true) : false;
}
template <typename T>
int flg(T x, int i) {
return (x >> i) & 1;
}
template <typename T>
void print(const vector<T> &v, T x = 0) {
int n = v.size();
for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');
if (v.empty()) cout << '\n';
}
template <typename T>
void printn(const vector<T> &v, T x = 0) {
int n = v.size();
for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
}
template <typename T>
int lb(const vector<T> &v, T x) {
return lower_bound(begin(v), end(v), x) - begin(v);
}
template <typename T>
int ub(const vector<T> &v, T x) {
return upper_bound(begin(v), end(v), x) - begin(v);
}
template <typename T>
void rearrange(vector<T> &v) {
sort(begin(v), end(v));
v.erase(unique(begin(v), end(v)), end(v));
}
template <typename T>
vector<int> id_sort(const vector<T> &v, bool greater = false) {
int n = v.size();
vector<int> ret(n);
iota(begin(ret), end(ret), 0);
sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });
return ret;
}
template <typename S, typename T>
pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {
return make_pair(p.first + q.first, p.second + q.second);
}
template <typename S, typename T>
pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {
return make_pair(p.first - q.first, p.second - q.second);
}
template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &p) {
S a;
T b;
is >> a >> b;
p = make_pair(a, b);
return is;
}
template <typename S, typename T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
return os << p.first << ' ' << p.second;
}
struct io_setup {
io_setup() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout << fixed << setprecision(15);
}
} io_setup;
const int inf = (1 << 30) - 1;
const ll INF = (1LL << 60) - 1;
// const int MOD = 1000000007;
const int MOD = 998244353;
vector<pil> solve(ll &a, ll &b) {
vector<pil> ret;
while (a != 0 && b != 0) {
ll c = abs(a), d = abs(b);
if (c > d) {
ll k = c / d;
if (a * b > 0) {
a -= b * k;
ret.eb(1, -k);
} else {
a += b * k;
ret.eb(1, k);
}
} else {
ll k = d / c;
if (a * b > 0) {
b -= a * k;
ret.eb(2, -k);
} else {
b += a * k;
ret.eb(2, k);
}
}
}
if (a == 0) {
if (b < 0) {
a -= b;
ret.eb(1, -1);
b += a;
ret.eb(2, 1);
} else {
a += b;
ret.eb(1, 1);
b -= a;
ret.eb(2, -1);
}
} else if (a < 0) {
b -= a;
ret.eb(2, -1);
a += 2 * b;
ret.eb(1, 2);
b -= a;
ret.eb(2, -1);
}
return ret;
}
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
auto p = solve(a, b);
auto q = solve(c, d);
assert(b == 0 && a >= 0);
assert(d == 0 && c >= 0);
if (a != c) {
cout << "-1\n";
return 0;
}
vector<pil> ans;
each(e, p) ans.eb(e);
reverse(all(q));
each(e, q) ans.eb(e.first, -e.second);
cout << sz(ans) << '\n';
printn(ans, pil(0, 0));
}