結果
問題 | No.2564 衝突予測 |
ユーザー |
|
提出日時 | 2023-12-02 16:45:34 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 342 ms / 2,000 ms |
コード長 | 4,273 bytes |
コンパイル時間 | 2,193 ms |
コンパイル使用メモリ | 198,320 KB |
最終ジャッジ日時 | 2025-02-18 05:39:06 |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 9 |
ソースコード
#include <bits/stdc++.h> using namespace std; #define rep(i,n) for (int i = 0; i < (n); i++) template<typename T> inline bool chmax(T &a, T b) {return ((a < b) ? (a = b, true) : (false));} template<typename T> inline bool chmin(T &a, T b) {return ((a > b) ? (a = b, true) : (false));} typedef long long ll; typedef pair<ll,ll> P; int main() { ll t; cin >> t; vector<ll> x(2*t), y(2*t); vector<char> d(2*t); rep(i,2*t) cin >> x[i] >> y[i] >> d[i]; rep(i,t) { ll p1 = 2*i, p2 = 2*i+1; if(d[p1] == 'R') { if(d[p2] == 'R') { cout << "No" << endl; } if(d[p2] == 'L') { if(x[p1] < x[p2] && y[p1] == y[p2]) { cout << "Yes" << endl; } else { cout << "No" << endl; } } if(d[p2] == 'U') { ll dx = x[p2]-x[p1], dy = y[p1]-y[p2]; if(dx > 0 && dx == dy) { cout << "Yes" << endl; } else { cout << "No" << endl; } } if(d[p2] == 'D') { ll dx = x[p2]-x[p1], dy = y[p2]-y[p1]; if(dx > 0 && dx == dy) { cout << "Yes" << endl; } else { cout << "No" << endl; } } } if(d[p1] == 'L') { if(d[p2] == 'R') { if(x[p1] > x[p2] && y[p1] == y[p2]) { cout << "Yes" << endl; } else { cout << "No" << endl; } } if(d[p2] == 'L') { cout << "No" << endl; } if(d[p2] == 'U') { ll dx = x[p1]-x[p2], dy = y[p1]-y[p2]; if(dx > 0 && dx == dy) { cout << "Yes" << endl; } else { cout << "No" << endl; } } if(d[p2] == 'D') { ll dx = x[p1]-x[p2], dy = y[p2]-y[p1]; if(dx > 0 && dx == dy) { cout << "Yes" << endl; } else { cout << "No" << endl; } } } if(d[p1] == 'U') { if(d[p2] == 'R') { ll dx = x[p1]-x[p2], dy = y[p2]-y[p1]; if(dx > 0 && dx == dy) { cout << "Yes" << endl; } else { cout << "No" << endl; } } if(d[p2] == 'L') { ll dx = x[p2]-x[p1], dy = y[p2]-y[p1]; if(dx > 0 && dx == dy) { cout << "Yes" << endl; } else { cout << "No" << endl; } } if(d[p2] == 'U') { cout << "No" << endl; } if(d[p2] == 'D') { if(x[p1] == x[p2] && y[p1] < y[p2]) { cout << "Yes" << endl; } else { cout << "No" << endl; } } } if(d[p1] == 'D') { if(d[p2] == 'R') { ll dx = x[p1]-x[p2], dy = y[p1]-y[p2]; if(dx > 0 && dx == dy) { cout << "Yes" << endl; } else { cout << "No" << endl; } } if(d[p2] == 'L') { ll dx = x[p2]-x[p1], dy = y[p1]-y[p2]; if(dx > 0 && dx == dy) { cout << "Yes" << endl; } else { cout << "No" << endl; } } if(d[p2] == 'U') { if(x[p1] == x[p2] && y[p1] > y[p2]) { cout << "Yes" << endl; } else { cout << "No" << endl; } } if(d[p2] == 'D') { cout << "No" << endl; } } } return 0; }