結果

問題 No.2564 衝突予測
ユーザー マベマス(mavemas_413)マベマス(mavemas_413)
提出日時 2023-11-26 15:29:18
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 3,800 bytes
コンパイル時間 4,098 ms
コンパイル使用メモリ 229,604 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-09-26 11:46:57
合計ジャッジ時間 9,536 ms
ジャッジサーバーID
(参考情報)
judge2 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other WA * 9
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
// long long
using ll = long long;
// unsigned long long
using ull = unsigned long long;
// string
using str = string;
// long double
using ld = long double;
// pair
using pll = pair < ll, ll >;
// tuple
using tlll = tuple < ll, ll, ll >;
// vector
template < class T > using v = vector < T >;
using vl = v < ll >;
using vbl = v < bool >;
// priority_queue
template < class T > using pq = priority_queue < T >;
template < class T > using pqg = priority_queue < T, v < T >, greater < T > >;
// unordered_set
template < class T > using uset = unordered_set < T > ;
// unordered_map
template < class T, class U > using umap = unordered_map < T, U > ;
// rep
#define rep(i, a, b) for(ll i = a; i <= b; i ++)
#define Rep(i, a) for(ll i = 0; i < a; i ++)
#define rrep(i, a, b) for(ll i = a; i >= b; i --)
#define repp(i, a, b, c) for(ll i = a; i <= b; i += c)
// binary search
#define lobo(x, k) lower_bound(x.begin(), x.end(), k) - x.begin()
#define Lobo(x, a, b, k) lower_bound(x + a, x + b + 1, k) - x
#define upbo(x, k) upper_bound(x.begin(), x.end(), k) - x.begin()
#define Upbo(x, a, b, k) upper_bound(x + a, x + b + 1, k) - x;
// snippet
#define eruni(x) x.erase(unique(x.begin(), x.end()), x.end())
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define all(x) x.begin(), x.end()
#define rll(x) x.rbegin(), x.rend()
#define sz(x) (ll)x.size()
#define f first
#define s second
#define in insert
#define pf push_front
#define p_f pop_front
#define pb push_back
#define p_b pop_back
#define p_p prev_permutation
#define n_p next_permutation
#define led leader
#define print(a) printf("%.20Lf", a);
// function
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;}
// out
void Yes(bool f = true) {cout << (f ? "Yes" : "No" ) << endl;}
void No(bool f = true) {cout << (f ? "No" : "Yes" ) << endl;}
void YES(bool f = true) {cout << (f ? "YES" : "NO" ) << endl;}
void NO(bool f = true) {cout << (f ? "NO" : "YES" ) << endl;}
template < class T > void out(T a) {cout << a << endl;}
template < class T > void out1(T a) {cout << a << " ";}
template < class T, class U > void out2(T a, U b) {cout << a << " " << b << endl;}
template < class T> void allout(T &a) {
for(auto x : a) cout << x << " ";
cout << endl;
}
template < class T > void allout1(T &a) {
for(auto x : a) cout << x << endl;
}
// modint
using modi = modint998244353;
using mint = modint1000000007;
// constant
const ll md = 998244353;
const ll mo = 1000000007;
const ld pi = acos(-1);
const ll inf = (1LL << 60);
// grid
const pll ar1[4] = { {0, 0}, {1, 0}, {0, 1}, {1, 1} };
const pll ar2[4] = { {-1, 0}, {0, -1}, {1, 0}, {0, 1} };
const pll ar3[8] = { {-1, 0}, {0, -1}, {1, 0}, {0, 1}, {-1, 1}, {1, -1}, {1, 1}, {-1, -1} };
int main(){
ll t;
cin >> t;
Rep(k, t){
ll x1, x2, y1, y2;
char d1, d2;
cin >> x1 >> y1 >> d1 >> x2 >> y2 >> d2;
bool fg = true;
if(d1 == d2) fg = false;
if(d1 == 'L' && x2 >= x1) fg = false;
if(d1 == 'R' && x2 <= x1) fg = false;
if(d1 == 'U' && y2 <= y1) fg = false;
if(d1 == 'D' && y2 >= y1) fg = false;
if(d2 == 'L' && x2 <= x1) fg = false;
if(d2 == 'R' && x2 >= x1) fg = false;
if(d2 == 'U' && y2 >= y1) fg = false;
if(d2 == 'D' && y2 <= y1) fg = false;
if(!fg){
No();
continue;
}
ll dist1 = 0, dist2 = 0;
if(d1 == 'L' || d1 == 'R') dist1 = abs(x1 - x2);
else if(d1 == 'U' || d1 == 'D') dist1 = abs(y1 - y2);
if(d2 == 'L' || d2 == 'R') dist2 = abs(x2 - x1);
else if(d2 == 'U' || d2 == 'D') dist2 = abs(y2 - y1);
Yes(dist1 == dist2);
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0