#1167355 (C++23) No.3559 +A,-B

• 問題: No.3559 +A,-B
• ユーザー: ponjuice
• 提出日時: 2026-05-29 19:45:23
• 言語: C++23 (gcc 15.2.0 + boost 1.89.0)
• 結果: AC
• 実行時間: 139 ms / 2,000 ms
• コード長: 3,733 bytes
• コンパイル時間: 2,765 ms
• コンパイル使用メモリ: 333,048 KB
• 実行使用メモリ: 6,400 KB
• 最終ジャッジ日時: 2026-05-29 19:45:42
• 合計ジャッジ時間: 9,453 ms
• ジャッジサーバーID （参考情報）: judge3_1 / judge1_0

サブタスク	配点	結果
部分点1	10 %	AC * 4
部分点2	60 %	AC * 7
部分点3	30 %	AC * 20
合計	100 点

ソースコード

#include <bits/stdc++.h>
using namespace std;

//高速化 
struct ponjuice{ponjuice(){cin.tie(0);ios::sync_with_stdio(0);cout<<fixed<<setprecision(20);}}PonJuice;
//#define endl '\n' //インタラクティブ問題の時は消す

//型
using ll = long long;
using ld = long double;
template<class T>using vc = vector<T>; template<class T>using vvc = vc<vc<T>>; template<class T>using vvvc = vvc<vc<T>>;
using vi = vc<int>;  using vvi = vvc<int>;  using vvvi = vvvc<int>;
using vl = vc<ll>;   using vvl = vvc<ll>;   using vvvl = vvvc<ll>;
using pi = pair<int, int>;  using pl = pair<ll, ll>;
using ull = unsigned ll;
template<class T>using priq = priority_queue<T>;
template<class T>using priqg = priority_queue<T, vc<T>, greater<T>>;

// for文
#define overload4(a, b, c, d, e, ...) e
#define rep1(n)             for(ll i = 0; i < n; i++)
#define rep2(i, n)          for(ll i = 0; i < n; i++)
#define rep3(i, a, b)       for(ll i = a; i < b; i++)
#define rep4(i, a, b, step) for(ll i = a; i < b; i+= step)
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define per1(n)             for(ll i = n-1; i >= 0; i--)
#define per2(i, n)          for(ll i = n-1; i >= 0; i--)
#define per3(i, a, b)       for(ll i = b-1; i >= a; i--)
#define per4(i, a, b, step) for(ll i = b-1; i >= a; i-= step)
#define per(...) overload4(__VA_ARGS__, per4, per3, per2, per1)(__VA_ARGS__)

//関数
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define si(x) (ll)(x).size()
template<class S, class T>inline bool chmax(S& a, T b){return a < b && ( a = b , true);}
template<class S, class T>inline bool chmin(S& a, T b){return a > b && ( a = b , true);}

inline void yes(){cout << "Yes\n";}
inline void no(){cout << "No\n";}
inline void yesno(bool y = true){if(y)yes();else no();}

//定数
constexpr ll mod = 998244353;
constexpr ll minf=-(1<<29);
constexpr ll inf=(1<<29);
constexpr ll MINF=-(1LL<<60);
constexpr ll INF=(1LL<<60);
const int dx[4] ={-1, 0, 1, 0};
const int dy[4] ={ 0, 1, 0,-1};
const int dx8[8] ={-1,-1,-1, 0, 1, 1, 1, 0};
const int dy8[8] ={-1, 0, 1, 1, 1, 0,-1,-1};

void solve();
int main() {
	int t = 1;
    cin >>t;
    while(t--)solve();
}

void solve(){
    ll n,x,y,a,b;
    cin >> n >> x >> y >> a >> b;
    
    if(x+y < 0 && a <= 0) {
        cout << x + a*n << " " << y << endl;
        return;
    }
    if(x+y >= 0 && b <= 0) {
        cout << x << " " << y - b*n << endl;
        return;
    }
    if(a <= 0) {
        ll cnt = (x+y) / b + 1;
        if(cnt >= n) {
            cout << x << " " << y - b*n << endl;
        }else {
            n -= cnt;
            y -= b * cnt;
            cout << x + a*n << " " << y << endl;
        }
        return;
    }
    if(b <= 0) {
        ll cnt = (-(x+y)+a-1) / a;
        if(cnt >= n) {
            cout << x + a*n << " " << y << endl;
        }else {
            n -= cnt;
            x += a * cnt;
            cout << x << " " << y - b*n << endl;
        }
        return;
    }

    if(x + y + n * a < 0) {
        cout << x + a*n << " " << y << endl;
        return;
    }

    ll ok = 0, ng = n+1;
    while(ng - ok > 1) {
        ll mid = (ok + ng) / 2;
        ll sum = x + y + mid * a;
        if(sum < 0) {
            ok = mid;
            continue;
        }
        ll cnt = sum / b;
        if(cnt + mid < n) ok = mid;
        else ng = mid;
    }
    x += ok * a;
    n -= ok + (x+y)/b;
    y -= (x+y)/b * b;


    while(n) {
        if(x+y >= 0) {
            ll cnt = min(n, (x+y)/b+1);
            n -= cnt;
            y -= cnt * b;
        }else {
            ll cnt = min(n, (-(x+y)+a-1)/a);
            n -= cnt;
            x += cnt * a;
        }
    }
    cout << x << " " << y << endl;
}