Submission #53083108

Source Code Expand

// #pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define inf (ll)1e18
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define fi first
#define se second
#define lll __int128
const int N = 1e6 + 5;

void solve() {
	ll n, x, y, z;
	cin >> n >> x >> y >> z;
	if (x > y)
		swap(x, y);
	if (z >= x && z <= y)
		cout << "Yes" << endl;
	else
		cout << "No" << endl;
}

int main() {
	ios::sync_with_stdio(false);
  	cin.tie(0);
  	cout.tie(0);
	solve();
	return 0;
}

Submission Info

Submission Time
Task A - AtCoder Line
User TopCloser
Language C++ 20 (gcc 12.2)
Score 100
Code Size 577 Byte
Status AC
Exec Time 1 ms
Memory 3608 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 3456 KiB
sample01.txt AC 1 ms 3528 KiB
sample02.txt AC 1 ms 3528 KiB
testcase00.txt AC 1 ms 3420 KiB
testcase01.txt AC 1 ms 3608 KiB
testcase02.txt AC 1 ms 3400 KiB
testcase03.txt AC 1 ms 3448 KiB
testcase04.txt AC 1 ms 3460 KiB
testcase05.txt AC 1 ms 3528 KiB
testcase06.txt AC 1 ms 3600 KiB
testcase07.txt AC 1 ms 3412 KiB
testcase08.txt AC 1 ms 3464 KiB