結果

問題 No.2564 衝突予測
ユーザー soto800soto800
提出日時 2023-12-02 15:11:58
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 810 ms / 2,000 ms
コード長 5,332 bytes
コンパイル時間 1,540 ms
コンパイル使用メモリ 170,784 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-09-26 18:16:11
合計ジャッジ時間 9,839 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 810 ms
5,376 KB
testcase_04 AC 799 ms
5,376 KB
testcase_05 AC 802 ms
5,376 KB
testcase_06 AC 798 ms
5,376 KB
testcase_07 AC 793 ms
5,376 KB
testcase_08 AC 794 ms
5,376 KB
testcase_09 AC 798 ms
5,376 KB
testcase_10 AC 785 ms
5,376 KB
testcase_11 AC 798 ms
5,376 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function 'void solve()':
main.cpp:130:35: warning: 'd2' may be used uninitialized [-Wmaybe-uninitialized]
  130 |         double posY21 = y2 + di[d2] * s1;
      |                              ~~~~~^
main.cpp:103:17: note: 'd2' was declared here
  103 |     lli x2, y2, d2;
      |                 ^~
main.cpp:127:35: warning: 'd1' may be used uninitialized [-Wmaybe-uninitialized]
  127 |         double posY11 = y1 + di[d1] * s1;
      |                              ~~~~~^
main.cpp:102:17: note: 'd1' was declared here
  102 |     lli x1, y1, d1;
      |                 ^~

ソースコード

diff # 

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

#define lli long long int
#define REP(i, s, n) for (lli i = s; i < n; i++)
#define INF (1LL << 62)
#define DEBUG 0
#define mp(a, b) make_pair(a, b)
#define SORT(V) sort(V.begin(), V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) #VariableName
#define LOG1(x) \
    if (DEBUG) cout << TO_STRING(x) << "=" << x << " " << endl;
#define LOG2(x, y)                                                          \
    if (DEBUG)                                                              \
        cout << TO_STRING(x) << "=" << x << " " << TO_STRING(y) << "=" << y \
             << endl;
#define LOG3(x, y, z)                                                       \
    if (DEBUG)                                                              \
        cout << TO_STRING(x) << "=" << x << " " << TO_STRING(y) << "=" << y \
             << " " << TO_STRING(z) << "=" << z << endl;
#define LOG4(w, x, y, z)                                                      \
    if (DEBUG)                                                                \
        cout << TO_STRING(w) << "=" << w << " " << TO_STRING(x) << "=" << x   \
             << " " << TO_STRING(y) << "=" << y << " " << TO_STRING(z) << "=" \
             << z << endl;
#define LOG5(w, x, y, z, a)                                                   \
    if (DEBUG)                                                                \
        cout << TO_STRING(w) << "=" << w << " " << TO_STRING(x) << "=" << x   \
             << " " << TO_STRING(y) << "=" << y << " " << TO_STRING(z) << "=" \
             << z << " " << TO_STRING(a) << "=" << a << endl;
#define LOG6(w, x, y, z, a, b)                                                \
    if (DEBUG)                                                                \
        cout << TO_STRING(w) << "=" << w << " " << TO_STRING(x) << "=" << x   \
             << " " << TO_STRING(y) << "=" << y << " " << TO_STRING(z) << "=" \
             << z << " " << TO_STRING(a) << "=" << a << " " << TO_STRING(b)   \
             << "=" << b << endl;

#define overload6(a, b, c, d, e, f, g, ...) g
#define LOG(...) \
    overload6(__VA_ARGS__, LOG6, LOG5, LOG4, LOG3, LOG2, LOG1)(__VA_ARGS__)

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 (b < a) {
        a = b;
        return 1;
    }
    return 0;
}

mt19937 engine;
std::chrono::system_clock::time_point start, endTime;

std::ostream &operator<<(std::ostream &dest, __int128_t value) {
    std::ostream::sentry s(dest);
    if (s) {
        __uint128_t tmp = value < 0 ? -value : value;
        char buffer[128];
        char *d = std::end(buffer);
        do {
            --d;
            *d = "0123456789"[tmp % 10];
            tmp /= 10;
        } while (tmp != 0);
        if (value < 0) {
            --d;
            *d = '-';
        }
        int len = std::end(buffer) - d;
        if (dest.rdbuf()->sputn(d, len) != len) {
            dest.setstate(std::ios_base::badbit);
        }
    }
    return dest;
}

__int128 parse(string &s) {
    __int128 ret = 0;
    for (int i = 0; i < s.length(); i++) {
        if ('0' <= s[i] && s[i] <= '9') {
            ret = 10 * ret + s[i] - '0';
        }
    }
    return ret;
}

string dirs = "LDRU";
lli di[4] = {0, -1, 0, 1};
lli dj[4] = {-1, 0, 1, 0};

void solve() {
    lli x1, y1, d1;
    lli x2, y2, d2;

    char dd1, dd2;
    cin >> x1 >> y1 >> dd1;
    cin >> x2 >> y2 >> dd2;

    REP(i, 0, 4) {
        if (dirs[i] == dd1) {
            d1 = i;
        }
        if (dirs[i] == dd2) {
            d2 = i;
        }
    }

    double small = 0;
    double large = 100000000000 + 10;

    lli count = 300;
    while (count--) {
        double s1 = (small * 2 + large) / 3.0;
        double s2 = (small + large * 2) / 3.0;

        double posX11 = x1 + dj[d1] * s1;
        double posY11 = y1 + di[d1] * s1;

        double posX21 = x2 + dj[d2] * s1;
        double posY21 = y2 + di[d2] * s1;

        double pos1Length = abs(posX11 - posX21) + abs(posY11 - posY21);

        double posX12 = x1 + dj[d1] * s2;
        double posY12 = y1 + di[d1] * s2;

        double posX22 = x2 + dj[d2] * s2;
        double posY22 = y2 + di[d2] * s2;

        double pos2Length = abs(posX12 - posX22) + abs(posY12 - posY22);

        if (pos1Length > pos2Length) {
            small = s1;
        } else {
            large = s2;
        }
    }
    double T = (small + large) / 2.0;
    double posX11 = x1 + dj[d1] * T;
    double posY11 = y1 + di[d1] * T;
    double posX21 = x2 + dj[d2] * T;
    double posY21 = y2 + di[d2] * T;
    double pos1Length = abs(posX11 - posX21) + abs(posY11 - posY21);
    if (pos1Length < 0.2) {
        cout << "Yes" << endl;
    } else {
        cout << "No" << endl;
    }
}

// Generated by 2.12.0 https://github.com/kyuridenamida/atcoder-tools  (tips:
// You use the default template now. You can remove this line by using your
// custom template)
int main() {
    lli n = 1;
    cin >> n;
    while (n--) solve();
    return 0;
}

struct Setup {
    Setup() {
        cin.tie(0);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
    }
} __Setup;
0