結果

問題 No.2564 衝突予測
ユーザー GOTKAKO
提出日時 2023-12-02 15:10:07
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 188 ms / 2,000 ms
コード長 1,565 bytes
コンパイル時間 1,988 ms
コンパイル使用メモリ 194,652 KB
最終ジャッジ日時 2025-02-18 04:18:37
ジャッジサーバーID
(参考情報)
judge2 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 9
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:47:13: warning: ‘distx’ may be used uninitialized [-Wmaybe-uninitialized]
   47 |             if(disty == distx) cout << "Yes" << endl;
      |             ^~
main.cpp:43:37: note: ‘distx’ was declared here
   43 |             long long disty = y1-y2,distx;
      |                                     ^~~~~
main.cpp:35:13: warning: ‘distx’ may be used uninitialized [-Wmaybe-uninitialized]
   35 |             if(disty == distx) cout << "Yes" << endl;
      |             ^~
main.cpp:31:37: note: ‘distx’ was declared here
   31 |             long long disty = y2-y1,distx;
      |                                     ^~~~~

ソースコード

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

#include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int test; cin >> test;
while(test--){
int x1,y1,x2,y2; char d1,d2;
cin >> x1 >> y1 >> d1 >> x2 >> y2 >> d2;
if(d1 == d2){cout << "No" << endl; continue;}
if(d1 == 'R' && d2 == 'L'){swap(x1,x2); swap(y1,y2); swap(d1,d2);}
if(d1 == 'L' && d2 == 'R'){
if(y1 == y2 && x1 > x2) cout << "Yes" << endl;
else cout << "No" << endl;
continue;
}
if(d1 == 'D' && d2 == 'U'){swap(x1,x2);swap(y1,y2);swap(d1,d2);}
if(d1 == 'U' && d2 == 'D'){
if(x1 == x2 && y1 < y2) cout << "Yes" << endl;
else cout << "No" << endl;
continue;
}
if(d2 == 'U'){swap(x1,x2); swap(y1,y2); swap(d1,d2);}
if(d1 == 'U'){
if(y1 >= y2){cout << "No" << endl; continue;}
long long disty = y2-y1,distx;
if(d2 == 'L') distx = x2-x1;
if(d2 == 'R') distx = x1-x2;
if(disty == distx) cout << "Yes" << endl;
else cout << "No" << endl;
continue;
}
if(d2 == 'D'){swap(x1,x2); swap(y1,y2); swap(d1,d2);}
if(d1 == 'D'){
if(y1 <= y2){cout << "No" << endl; continue;}
long long disty = y1-y2,distx;
if(d2 == 'L') distx = x2-x1;
if(d2 == 'R') distx = x1-x2;
if(disty == distx) cout << "Yes" << endl;
else cout << "No" << endl;
}
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0