Submission #2522479
Source Code Expand
#include <iostream> #include <algorithm> #include <map> #include <math.h> #include <string> typedef long long ll; using namespace std; int main(){ int d1[2], d2[2]; cin >> d1[0] >> d1[1]; cin >> d2[0] >> d2[1]; for (int i = 0; i < 2; i++){ for (int j = 0; j < 2; j++){ if (d1[i] == d2[j]){ cout << "YES" << endl; return 0; } } } cout << "NO" << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - ディスプレイ |
User | woodline23xx |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 439 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample0.txt, sample1.txt, sample2.txt, sample3.txt, sample4.txt |
All | sample0.txt, sample1.txt, sample2.txt, sample3.txt, sample4.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample0.txt | AC | 1 ms | 256 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |
sample4.txt | AC | 1 ms | 256 KB |
subtask1_0.txt | AC | 1 ms | 256 KB |
subtask1_1.txt | AC | 1 ms | 256 KB |
subtask1_10.txt | AC | 1 ms | 256 KB |
subtask1_11.txt | AC | 1 ms | 256 KB |
subtask1_12.txt | AC | 1 ms | 256 KB |
subtask1_13.txt | AC | 1 ms | 256 KB |
subtask1_14.txt | AC | 1 ms | 256 KB |
subtask1_2.txt | AC | 1 ms | 256 KB |
subtask1_3.txt | AC | 1 ms | 256 KB |
subtask1_4.txt | AC | 1 ms | 256 KB |
subtask1_5.txt | AC | 1 ms | 256 KB |
subtask1_6.txt | AC | 1 ms | 256 KB |
subtask1_7.txt | AC | 1 ms | 256 KB |
subtask1_8.txt | AC | 1 ms | 256 KB |
subtask1_9.txt | AC | 1 ms | 256 KB |