Submission #1798988
Source Code Expand
#include <bits/stdc++.h> using namespace std; int main() { // your code goes here int N, Z, W; cin >> N >> Z >> W; int a[N]; for (int i = 0; i < N; i++) { cin >> a[i]; } if (N == 1) return cout << abs(a[N - 1] - W), 0; cout << max(abs(a[N - 1] - a[N - 2]), abs(a[N - 1] - W)); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - ABS |
User | kevinwen |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 312 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 256 KB |
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 KB |
example_1 | AC | 1 ms | 256 KB |
example_2 | AC | 1 ms | 256 KB |
example_3 | AC | 1 ms | 256 KB |
one_0 | AC | 1 ms | 256 KB |
one_1 | AC | 1 ms | 256 KB |
one_2 | AC | 1 ms | 256 KB |
one_3 | AC | 1 ms | 256 KB |
one_4 | AC | 1 ms | 256 KB |
one_5 | AC | 1 ms | 256 KB |
one_6 | AC | 1 ms | 256 KB |
one_7 | AC | 1 ms | 256 KB |
rand_0 | AC | 2 ms | 256 KB |
rand_1 | AC | 2 ms | 256 KB |
rand_10 | AC | 2 ms | 256 KB |
rand_11 | AC | 2 ms | 256 KB |
rand_12 | AC | 2 ms | 256 KB |
rand_13 | AC | 2 ms | 256 KB |
rand_14 | AC | 2 ms | 256 KB |
rand_15 | AC | 1 ms | 256 KB |
rand_2 | AC | 2 ms | 256 KB |
rand_3 | AC | 2 ms | 256 KB |
rand_4 | AC | 2 ms | 256 KB |
rand_5 | AC | 2 ms | 256 KB |
rand_6 | AC | 2 ms | 256 KB |
rand_7 | AC | 2 ms | 256 KB |
rand_8 | AC | 2 ms | 256 KB |
rand_9 | AC | 2 ms | 256 KB |