#809436 (C++17) No.2104 Multiply-Add

提出ソース

結果

問題	No.2104 Multiply-Add
ユーザー	snuke
提出日時	2022-10-21 21:56:33
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	4,249 bytes
コンパイル時間	2,214 ms
コンパイル使用メモリ	213,124 KB
実行使用メモリ	6,944 KB
最終ジャッジ日時	2024-07-01 06:30:41
合計ジャッジ時間	6,435 ms
ジャッジサーバーID （参考情報）	judge5 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	WA	-
testcase_01	AC	2 ms 6,940 KB
testcase_02	WA	-
testcase_03	WA	-
testcase_04	WA	-
testcase_05	WA	-
testcase_06	WA	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	WA	-
testcase_10	WA	-
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	WA	-
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	WA	-
testcase_20	WA	-
testcase_21	WA	-
testcase_22	WA	-
testcase_23	WA	-
testcase_24	WA	-
testcase_25	AC	2 ms 6,944 KB
testcase_26	WA	-
testcase_27	AC	2 ms 6,940 KB
testcase_28	AC	2 ms 6,940 KB
testcase_29	AC	2 ms 6,940 KB
testcase_30	AC	2 ms 6,940 KB
testcase_31	AC	2 ms 6,944 KB
testcase_32	AC	2 ms 6,944 KB
testcase_33	AC	2 ms 6,940 KB
testcase_34	AC	2 ms 6,940 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep1(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < (t); ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define newline puts("")
using namespace std;
template<typename T> using vc = vector<T>;
template<typename T> using vv = vc<vc<T>>;
template<typename T> using PQ = priority_queue<T,vc<T>,greater<T>>;
using uint = unsigned; using ull = unsigned long long;
using vi = vc<int>; using vvi = vv<int>; using vvvi = vv<vi>;
using ll = long long; using vl = vc<ll>; using vvl = vv<ll>; using vvvl = vv<vl>;
using P = pair<int,int>; using vp = vc<P>; using vvp = vv<P>;
int geti(){int x;scanf("%d",&x);return x;}
vi pm(int n, int s=0) { vi a(n); iota(rng(a),s); return a;}
template<typename T>istream& operator>>(istream&i,vc<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const T&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}
template<typename T>ostream& operator<<(ostream&o,const vc<T>&v){if(sz(v))o<<join(v," ");return o;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;}
template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int){a.fi--;a.se--;}
template<typename T>void operator--(vc<T>&a,int){for(T&x:a)x--;}
template<typename T>void operator+=(vc<T>&a,T b){for(T&x:a)x+=b;}
template<typename T>void operator+=(vc<T>&a,const vc<T>&b){a.insert(a.end(),rng(b));}
template<typename T1,typename T2>bool mins(T1& x,const T2&y){if(x>y){x=y;return true;}else return false;}
template<typename T1,typename T2>bool maxs(T1& x,const T2&y){if(x<y){x=y;return true;}else return false;}
template<typename Tx, typename Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;}
template<typename T>ll suma(const vc<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
template<typename T>ll suma(const vv<T>&a){ll res(0);for(auto&&x:a)res+=suma(x);return res;}
template<typename T>void uni(T& a){sort(rng(a));a.erase(unique(rng(a)),a.end());}
template<typename T>void prepend(vc<T>&a,const T&x){a.insert(a.begin(),x);}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return;}
#define yes { puts("Yes"); return;}
#define no { puts("No"); return;}
#define ret(x) { cout<<(x)<<endl; return;}
#define yn {puts("Yes");}else{puts("No");}
const int MX = 200005;

struct Solver {
  vp f(int a, int b) {
    vp res;

    rep(t,2) {
      if (a == 0) {
        res.eb(t,1);
        a += b;
      }
      swap(a,b);
    }

    rep(t,2) {
      if (a < 0) {
        int s = abs(a)/abs(b)+1;
        if (b < 0) s = -s;
        res.eb(t,s);
        a += b*s;
      }
      swap(a,b);
    }

    int t = 0;
    while (b) {
      int s = a/b;
      if (s) {
        res.eb(t,-s);
        a -= b*s;
      }
      t ^= 1; swap(a,b);
    }

    if (t) {
      res.eb(0,1);
      res.eb(1,-1);
    }

    return res;
  }
  void solve(int a, int b, int c, int d) {
    int g = gcd(abs(a),abs(b));
    if (gcd(abs(c),abs(d)) != g) dame;
    if (g == 0) ret(0);
    a /= g;
    b /= g;
    c /= g;
    d /= g;
    vp s = f(a,b);
    vp t = f(c,d);
    reverse(rng(t));
    rep(i,sz(t)) t[i].se *= -1;
    s += t;
    cout<<sz(s)<<endl;
    for (auto [t,k] : s) {
      cout<<t<<" "<<k<<endl;
      if (t) b += a*k; else a += b*k;
    }
    assert(a == c && b == d);
  }
};

int main() {
  int ts = 1;
  // scanf("%d",&ts);
  rep1(ti,ts) {
    Solver solver;
    int a,b,c,d;
    scanf("%d%d%d%d",&a,&b,&c,&d);
    solver.solve(a,b,c,d);
  }
  return 0;

  rep(ti,100) {
    int a = rand()%21 - 10;
    int b = rand()%21 - 10;
    int c = rand()%21 - 10;
    int d = rand()%21 - 10;
    Solver solver;
    // cerr<<a<<" "<<b<<" "<<c<<" "<<d<<endl;
    solver.solve(a,b,c,d);
  }
  return 0;
}

yukicoder

結果

テストケース

ソースコード