Submission #53083291


Source Code Expand

#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pa first
#define pb second
#define endl '\n'
#define vint vector<int>
#define vlong vector<ll>
#define pii pair<int, int>
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define rng(i, a, b) for (int i = int(a); i <= int(b); i++)
#define per(i, a, b) for (int i = int(b - 1); i >= int(a); i--)
#define gnr(i, a, b) for (int i = int(b); i >= int(a); i--)
using namespace std;
#define ATC
#ifdef ATC
#include <atcoder/all>
using namespace atcoder;
#endif

#ifdef MT
void solve()
{
}
#endif

int main(void)
{
    std::ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n, x, y, z;
    cin >> n >> x >> y >> z;
    int maxm = max(x, y), minm = min(x, y);
    if (z <= maxm && z >= minm) {
        cout << "Yes";
    } else {
        cout << "No";
    }
#ifdef MT
    int t;
    cin >> t;
    for (int i = 0; i < t; i++)
        solve();
#endif
}

Submission Info

Submission Time
Task A - AtCoder Line
User L1bra
Language C++ 20 (gcc 12.2)
Score 100
Code Size 1001 Byte
Status AC
Exec Time 1 ms
Memory 3648 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 12
Set Name Test Cases
Sample sample00.txt, sample01.txt, sample02.txt
All sample00.txt, sample01.txt, sample02.txt, testcase00.txt, testcase01.txt, testcase02.txt, testcase03.txt, testcase04.txt, testcase05.txt, testcase06.txt, testcase07.txt, testcase08.txt
Case Name Status Exec Time Memory
sample00.txt AC 1 ms 3480 KiB
sample01.txt AC 1 ms 3568 KiB
sample02.txt AC 1 ms 3648 KiB
testcase00.txt AC 1 ms 3512 KiB
testcase01.txt AC 1 ms 3464 KiB
testcase02.txt AC 1 ms 3508 KiB
testcase03.txt AC 1 ms 3552 KiB
testcase04.txt AC 1 ms 3520 KiB
testcase05.txt AC 1 ms 3508 KiB
testcase06.txt AC 1 ms 3436 KiB
testcase07.txt AC 1 ms 3572 KiB
testcase08.txt AC 1 ms 3516 KiB