Please sign in first.
Submission #5330328
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, Z, W, a[2000];
cin >> n >> Z >> W;
for(int i=0; i<n; i++){
cin >> a[i];
}
if(n == 1){
cout << abs(W - a[0]) << endl;
}
else{
cout << max(abs(W - a[n-1]), abs(a[n-2] - a[n-1])) << endl;
}
return 0;
}
Submission Info
| Submission Time | |
|---|---|
| Task | D - ABS |
| User | NOSS |
| Language | C++14 (GCC 5.4.1) |
| Score | 500 |
| Code Size | 343 Byte |
| Status | AC |
| Exec Time | 2 ms |
| Memory | 256 KiB |
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 500 / 500 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | example_0, example_1, example_2, example_3 |
| All | example_0, example_1, example_2, example_3, one_0, one_1, one_2, one_3, one_4, one_5, one_6, one_7, rand_0, rand_1, rand_10, rand_11, rand_12, rand_13, rand_14, rand_15, rand_2, rand_3, rand_4, rand_5, rand_6, rand_7, rand_8, rand_9 |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| example_0 | AC | 1 ms | 256 KiB |
| example_1 | AC | 1 ms | 256 KiB |
| example_2 | AC | 1 ms | 256 KiB |
| example_3 | AC | 1 ms | 256 KiB |
| one_0 | AC | 1 ms | 256 KiB |
| one_1 | AC | 1 ms | 256 KiB |
| one_2 | AC | 1 ms | 256 KiB |
| one_3 | AC | 1 ms | 256 KiB |
| one_4 | AC | 1 ms | 256 KiB |
| one_5 | AC | 1 ms | 256 KiB |
| one_6 | AC | 1 ms | 256 KiB |
| one_7 | AC | 1 ms | 256 KiB |
| rand_0 | AC | 2 ms | 256 KiB |
| rand_1 | AC | 1 ms | 256 KiB |
| rand_10 | AC | 2 ms | 256 KiB |
| rand_11 | AC | 2 ms | 256 KiB |
| rand_12 | AC | 2 ms | 256 KiB |
| rand_13 | AC | 2 ms | 256 KiB |
| rand_14 | AC | 2 ms | 256 KiB |
| rand_15 | AC | 1 ms | 256 KiB |
| rand_2 | AC | 2 ms | 256 KiB |
| rand_3 | AC | 2 ms | 256 KiB |
| rand_4 | AC | 2 ms | 256 KiB |
| rand_5 | AC | 2 ms | 256 KiB |
| rand_6 | AC | 2 ms | 256 KiB |
| rand_7 | AC | 2 ms | 256 KiB |
| rand_8 | AC | 2 ms | 256 KiB |
| rand_9 | AC | 2 ms | 256 KiB |