Submission #5566047
Source Code Expand
#pragma region include
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <string>
#include <queue>
#include <stack>
#include <cmath>
#include <set>
#include <cstdio>
#define ALL(obj) (obj).begin(),(obj).end()
#define RALL(obj) (obj).rbegin(),(obj).rend()
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define MOD 1000000007
#define INF 1000000000
#define LLINF 4000000000000000000
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
#pragma endregion
//#define __DEBUG__
#ifdef __DEBUG__
#define dump(x) cerr << #x << " = " << (x) << " [" << __LINE__ << ":" << __FUNCTION__ << "] " << endl;
// vector出力
template<typename T>
ostream& operator << (ostream& os, vector<T>& v) {
os << "{";
REP(i, (int)v.size()) { os << v[i] << (i < v.size() - 1 ? ", " : ""); }
os << "}";
return os;
}
// pair出力
template<typename T, typename U>
ostream& operator << (ostream& os, pair<T, U>& p) {
return os << "(" << p.first << ", " << p.second << ")";
}
// map出力
template<typename T, typename U>
ostream& operator << (ostream& os, map<T, U>& map_var) {
os << "{";
for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
os << "(" << itr->first << ", " << itr->second << ")";
itr++;
if (itr != map_var.end()) os << ", ";
itr--;
}
os << "}";
return os;
}
// set 出力
template<typename T>
ostream& operator << (ostream& os, set<T>& set_var) {
os << "{";
for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
os << *itr;
++itr;
if (itr != set_var.end()) os << ", ";
itr--;
}
os << "}";
return os;
}
#endif
int main() {
cin.tie(0); ios::sync_with_stdio(false);
int N, Z, W;
cin >> N >> Z >> W;
VI a(N);
REP(i, N) {
cin >> a[i];
}
if (N == 1) {
cout << abs(W - a[N - 1]) << endl;
}
else {
cout << max(abs(W - a[N - 1]), abs(a[N - 1] - a[N - 2])) << endl;
}
getchar(); getchar();
}
Submission Info
Submission Time |
|
Task |
D - ABS |
User |
kanpurin |
Language |
C++14 (GCC 5.4.1) |
Score |
500 |
Code Size |
2261 Byte |
Status |
AC |
Exec Time |
1 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 |
1 ms |
256 KB |
rand_1 |
AC |
1 ms |
256 KB |
rand_10 |
AC |
1 ms |
256 KB |
rand_11 |
AC |
1 ms |
256 KB |
rand_12 |
AC |
1 ms |
256 KB |
rand_13 |
AC |
1 ms |
256 KB |
rand_14 |
AC |
1 ms |
256 KB |
rand_15 |
AC |
1 ms |
256 KB |
rand_2 |
AC |
1 ms |
256 KB |
rand_3 |
AC |
1 ms |
256 KB |
rand_4 |
AC |
1 ms |
256 KB |
rand_5 |
AC |
1 ms |
256 KB |
rand_6 |
AC |
1 ms |
256 KB |
rand_7 |
AC |
1 ms |
256 KB |
rand_8 |
AC |
1 ms |
256 KB |
rand_9 |
AC |
1 ms |
256 KB |