#1167911 (C++17) No.3559 +A,-B

• 問題: No.3559 +A,-B
• ユーザー: 👑 AngrySadEight
• 提出日時: 2026-05-31 09:47:23
• 言語: C++17 (gcc 15.2.0 + boost 1.89.0)
• 結果: WA
• 実行時間: -
• コード長: 5,082 bytes
• コンパイル時間: 2,789 ms
• コンパイル使用メモリ: 212,820 KB
• 実行使用メモリ: 6,400 KB
• 最終ジャッジ日時: 2026-05-31 09:47:37
• 合計ジャッジ時間: 11,491 ms
• ジャッジサーバーID （参考情報）: judge2_1 / judge1_1

サブタスク	配点	結果
部分点1	10 %	AC * 2 WA * 2
部分点2	60 %	AC * 7
部分点3	30 %	AC * 9 WA * 2 RE * 9
合計	60 点

ソースコード

#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

int main(){
    ll T;
    cin >> T;
    while (T--){
        ll N, X, Y, A, B;
        cin >> N >> X >> Y >> A >> B;
        if (A <= 0 && B <= 0){
            if (X + Y < 0){
                cout << X + N * A << " " << Y << endl;
            }
            else{
                cout << X << " " << Y - N * B << endl;
            }
        }
        else if (A <= 0 && B > 0){
            if (X + Y < 0){
                cout << X + N * A << " " << Y << endl;
            }
            else{
                ll times = (X + Y) / B;
                if (times >= N){
                    cout << X << " " << Y - N * B << endl;
                }
                else{
                    cout << X + (N - times - 1) * A << " " << Y - (times + 1) * B << endl;
                }
            }
        }
        else if (A > 0 && B <= 0){
            if (X + Y >= 0){
                cout << X << " " << Y - N * B << endl;
            }
            else{
                ll times = (-X - Y - 1) / B;
                if (times >= N){
                    cout << X + N * A << " " << Y << endl;
                }
                else{
                    cout << X + (times + 1) * A << " " << Y + (N - times - 1) * B << endl;
                }
            }
        }
        else{
            if (X + Y < 0 && X + N * A + Y < 0){
                cout << X + N * A << " " << Y << endl;
            }
            else if (X + Y >= 0 && X + Y - N * B >= 0){
                cout << X << " " << Y - N * B << endl;
            }
            else{
                ll ok = 0;
                ll ng = N;
                while (ng - ok > 1){
                    ll mid = (ok + ng) / 2;
                    if (X + Y + mid * A - (N - mid) * B >= 0){
                        ng = mid;
                    }
                    else{
                        ok = mid;
                    }
                }
                // debug_out(ok, ng);
                if (X + Y + ng * A - (N - ng) * B < A){
                    cout << X + ng * A << " " << Y - (N - ng) * B << endl;
                }
                else{
                    cout << X + ok * A << " " << Y - (N - ok) * B << endl;
                }
            }
        }
    }
}