結果
| 問題 | No.2564 衝突予測 |
| ユーザー |
 cumene_rx
|
| 提出日時 | 2023-12-02 15:53:42 |
| 言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 5,995 bytes |
| コンパイル時間 | 4,859 ms |
| コンパイル使用メモリ | 319,532 KB |
| 実行使用メモリ | 6,948 KB |
| 最終ジャッジ日時 | 2024-09-26 19:28:24 |
| 合計ジャッジ時間 | 8,602 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge1 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
6,812 KB |
| testcase_01 | AC | 3 ms
6,940 KB |
| testcase_02 | AC | 2 ms
6,944 KB |
| testcase_03 | AC | 332 ms
6,940 KB |
| testcase_04 | AC | 303 ms
6,944 KB |
| testcase_05 | AC | 298 ms
6,944 KB |
| testcase_06 | AC | 304 ms
6,944 KB |
| testcase_07 | WA | - |
| testcase_08 | WA | - |
| testcase_09 | WA | - |
| testcase_10 | WA | - |
| testcase_11 | WA | - |
ソースコード
#include <bits/stdc++.h>
#include <atcoder/all>
#include <random>
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef unsigned long long ull;
using mint9 = modint998244353;
using mint1 = modint1000000007;
//using mint = modint;
const ll INF = 1000000007;
const ll LINF = INF * INF;
//const long long LLMAX = 9223372036854775807;
const long long LLMAX = 100000000000000000;
const double TIME_1 = 1.5;
//const ll MOD = 998244353;
std::mt19937 get_rand_mt;
#define PA pair<int,int>
#define PAL pair<ll,ll>
#define TP tuple<int,int,int>
#define TPL tuple<ll, ll, ll>
#define rep(i, z, n) for(int i = z; i < n; i++)
#define repl(i, z, n) for(ll i = z; i < n; i++)
#define revrep(i, z, n) for(int i = n - 1; i >= z; i--)
#define revrepl(i, z, n) for(ll i = n - 1; i >= z; i--)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define SZ(x) ((int)(x).size())
#define PB push_back
#define YN(T) if(T){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}
#define YN2(T) if(T){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define OK cout << "OK" << endl;
#define FX(x) cout << fixed << setprecision(10) << x << endl;
#define shuffle(x) shuffle(all(x), get_rand_mt)
#define PQ priority_queue<int,vector<int>,greater<int>>
#define PQL priority_queue<ll,vector<ll>,greater<ll>>
#define PQPA priority_queue<PA,vector<PA>,greater<PA>>
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; }
template<class T>T ceilX(T a, T b) {return (a + b - 1)/b; }
ll lmax(ll a, ll b){if(a>b) return a; return b;}
ll lmin(ll a, ll b){if(a>b) return b; return a;}
ll comb(ll X, ll Y){ll res = 1LL;ll R = X;repl(i, 1LL, lmin(Y + 1LL, X - Y + 1LL)){res *= (R - i + 1LL);res /= i;}return res;}
template<class T>void Rekkyo(vector<T> X){cout<<"Rekkyo"<<endl;for(auto Y:X){cout<<Y<<" ";}cout<<endl<<"end"<<endl;}
template<class T>void Rekkyo1(vector<T> X){cout<<"Rekkyo1"<<endl;int cnt=0;for(auto Y:X){cout<<cnt<<" "<<Y<<endl;cnt++;}cout<<"end"<<endl;}
template<class T>void Rekkyo2(vector<vector<T>> X){cout<<"Rekkyo2"<<endl;for(auto Y:X){for(auto Z:Y){cout <<Z<<" ";}cout<<endl;}cout<<"end"<<endl;}
vector<int> Eratosthenes(const int N){
vector<bool> is_prime(N + 1);
rep(i, 0, N + 1) is_prime[i] = true;
vector<int> P;
rep(i, 2, N + 1){
if(is_prime[i]){
for( int j = 2 * i; j <= N; j += i ) is_prime[ j ] = false;
P.emplace_back(i);
}
}
return P;
}
vector<vector<int>> make_edge(vector<int> u, vector<int> v, bool angle){
int N = u.size();
vector<vector<int>> res;
rep(i, 0, N){res[u[i]].PB(v[i]);if(!angle) res[v[i]].PB(u[i]);}
return res;
}
vector<vector<PA>> make_edge(vector<int> u, vector<int> v, vector<int> w, bool angle){
int N = u.size();
vector<vector<PA>> res;
rep(i, 0, N){res[u[i]].PB(PA(v[i], w[i]));if(!angle) res[v[i]].PB(PA(u[i], w[i]));}
return res;
}
vector<vector<PAL>> make_edgeL(vector<int> u, vector<int> v, vector<ll> w, bool angle){
int N = u.size();
vector<vector<PAL>> res;
rep(i, 0, N){res[u[i]].PB(PAL(v[i], w[i]));if(!angle) res[v[i]].PB(PAL(u[i], w[i]));}
return res;
}
int main(){
int T;
cin >> T;
rep(t, 0, T){
vector<ll> x(2), y(2);
vector<char> d(2);
cin >> x[0] >> y[0] >> d[0] >> x[1] >> y[1] >> d[1];
vector<int> D(2);
rep(i, 0, 2){
if(d[i] == 'R'){
D[i] = -1;
}
if(d[i] == 'L'){
D[i] = 1;
}
if(d[i] == 'U'){
D[i] = -2;
}
if(d[i] == 'D'){
D[i] = 2;
}
}
bool ans = false;
if(D[0] == D[1]) ans = false;
else if(D[0] == -D[1]){
if(D[0] == -1){
if(y[0] != y[1]) ans = false;
else if(x[0] > x[1]) ans = false;
else ans = true;
}
if(D[0] == 1){
if(y[0] != y[1]) ans = false;
else if(x[0] < x[1]) ans = false;
else ans = true;
}
if(D[0] == -2){
if(x[0] != x[1]) ans = false;
else if(y[0] > y[1]) ans = false;
else ans = true;
}
if(D[0] == 2){
if(x[0] != x[1]) ans = false;
else if(y[0] < y[1]) ans = false;
else ans = true;
}
}
else{
if(D[0] == -1){
if(D[1] == -2){
if(-x[0] + x[1] == y[0] - y[1]) ans = true;
else ans = false;
}
if(D[1] == 2){
if(-x[0] + x[1] == -y[0] + y[1]) ans = true;
else ans = false;
}
}
if(D[0] == 1){
if(D[1] == -2){
if(x[0] - x[1] == y[0] - y[1]) ans = true;
else ans = false;
}
if(D[1] == 2){
if(x[0] - x[1] == -y[0] + y[1]) ans = true;
else ans = false;
}
}
if(D[0] == -2){
if(D[1] == -1){
if(x[0] - x[1] == -y[0] + y[1]) ans = true;
else ans = false;
}
if(D[1] == 1){
if(-x[0] + x[1] == -y[0] + y[1]) ans = true;
else ans = false;
}
}
if(D[0] == 2){
if(D[1] == -1){
if(x[0] - x[1] == y[0] - y[1]) ans = true;
else ans = false;
}
if(D[1] == 1){
if(-x[0] + x[1] == y[0] - y[1]) ans = true;
else ans = false;
}
}
}
YN(ans);
}
}