Submission #6416831
Source Code Expand
#include<iostream> #include<cstdio> #include<cmath> #include<cstdlib> #include<climits> #include<string> #include<algorithm> #include<vector> #include<queue> #include<stack> #include<numeric> #include<map> #include<set> #include<bitset> using namespace std; #define REP(i,m,n) for(int i = m; i < n; i++) #define rep(i,n) REP(i,0,n) #define ALL(a) (a).begin(),(a).end() #define RALL(a) (a).rbegin(),(a).rend() #define PI 3.14159265359 #define MOD 1000000007 typedef long long LL; template<class T> inline void chmax(T& a, T b) { if (a < b) { a = b; } } template<class T> inline void chmin(T& a, T b) { if (a > b) { a = b; } } template<class T> void print_vector(vector<T> vec) { cout << "[ "; for (int i = 0; i < vec.size(); i++) { cout << vec[i] << " "; } cout << "]" << endl; } template<class T> void print_pair_vector(vector<pair<T, T> > vec) { cout << "[ "; for (int i = 0; i < vec.size(); i++) { cout << "(" << vec[i].first << "," << vec[i].second << ") "; } cout << "]" << endl; } const int INF = 1 << 30; int main(void) { int H1, W1, H2, W2; cin >> H1 >> W1 >> H2 >> W2; if (H1 == H2 or H1 == W2 or W1 == H2 or W1 == W2) { cout << "YES" << endl; } else { cout << "NO" << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - ディスプレイ |
User | himagineer |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1278 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 |