Submission #1244307


Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <map>
#include <cstdio>
#include <math.h>
#include <utility>
#include <list>
#include <functional>
#include <queue>
using namespace std;

#define ll long long
#define vecint vector<int>
#define Pii pair<int, int>

#define REP(i,x,n) for(int i=x;i<n;i++)
#define rep(i,n) REP(i,0,n)
#define print(a) cout << a << endl

#define MOD 1000000007
#define NIL -1

int x,y,z,w;

void solve(){
    if(x==z||x==w||y==z||y==w) print("YES");
    else print("NO");
    return;
}



int main(){
    cin>>x>>y;
    cin>>z>>w;
    solve();
    return 0;
}

Submission Info

Submission Time
Task B - ディスプレイ
User maxi
Language C++14 (GCC 5.4.1)
Score 100
Code Size 684 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 5
AC × 20
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