Submission #2499089


Source Code Expand

Copy
#include <iostream>
#include <algorithm>

using namespace std;

int main()
{
	int num[3], d;
	bool flag = true;
	int a, c;
	
	cin >> num[0] >> num[1] >> num[2] >> d;
	
	a = num[0];
	c = num[2];
	
	sort(num, num + 3);
	
	for (int i = 2; i > 0; i--) {
		if (num[i] - num[i-1] > d) {
			flag = false;
			break;
		}
	}
	
	
	if (max(a, c) - min(a, c) <= d) {
		flag = true;
	}
	
	if (flag == true) {
		cout << "Yes" << endl;
	}
	else {
		cout << "No" << endl;
	}
}

Submission Info

Submission Time
Task A - Colorful Transceivers
User wakimiko
Language C++14 (GCC 5.4.1)
Score 100
Code Size 495 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 × 4
AC × 10
Set Name Test Cases
Sample 0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt
All 0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt
Case Name Status Exec Time Memory
0_000.txt AC 1 ms 256 KB
0_001.txt AC 1 ms 256 KB
0_002.txt AC 1 ms 256 KB
0_003.txt AC 1 ms 256 KB
1_003.txt AC 1 ms 256 KB
1_004.txt AC 1 ms 256 KB
1_005.txt AC 1 ms 256 KB
1_006.txt AC 1 ms 256 KB
1_007.txt AC 1 ms 256 KB
1_008.txt AC 1 ms 256 KB