Submission #2673910
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>
typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;
#define sz(a) int((a).size())
#define pb push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n) for(int var=0;var<(n);++var)
#define rep1(var,n) for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n) for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c) (c).begin(),(c).end()
#define RALL(c) (c).rbegin(),(c).rend()
#define tr(i,c) for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e) ((s).find(e)!=(s).end())
#define mset(arr,val) memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }
const ll MOD=1000000007LL;
ll ADD(ll x, ll y) { return (x+y) % MOD; }
ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
ll MUL(ll x, ll y) { return x*y % MOD; }
ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
ll DIV(ll x, ll y) { /*assert(y%MOD!=0);*/ return MUL(x, POW(y, MOD-2)); }
// ll comb(ll n, ll k) { ll v=1; for(ll i=1; i<=k; i++) v = DIV(MUL(v, n-i+1),i); return v; }
//
#define INTSPACE 12
char _buf[INTSPACE*1000000 + 3];
int loadint() {
if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;
return atoi(_buf);
}
void read_cr() {
fgets(_buf, 256, stdin);
}
int loadvec(vector<int>& v, int N=-1) {
if (N == -1) {
N = loadint();
if (N==0) return 0;
}
int bufsize = INTSPACE*N + 3;
if (fgets(_buf, bufsize, stdin)==NULL) return 0;
v.resize(N);
int i=0;
bool last = false;
for (char *p=&_buf[0]; ;) {
char *q = p;
while (*q > ' ') ++q;
if (*q == 0x0D || *q == 0x0A) last = true;
*q = 0;
v[i++] = atoi(p);
if (last || i == N) break;
p = q+1;
}
// assert(i <= N);
return i;
}
ll solve(int N,int _Z,int W,vi& a) {
// 1-2000, 1-1e9, 1-1e9, {1-1e9}
// xが全部取るケース
int best = abs(a[N-1] - W);
// rep(i,N) best0 = max(best0, abs(a[i] - W));
// 1つだけ残すケース
if (N >= 2)
best = max(best, abs(a[N-2] - a[N-1]));
// rep(i,N-1) best1 = max(best1, abs(a[i] - a[N-1]));
return best;
}
int main() {
int N,Z,W; cin >> N>>Z>>W;
read_cr();
vi a(N);
loadvec(a, N);
cout << solve(N,Z,W,a) << endl;
return 0;
}
Submission Info
Submission Time
2018-06-16 19:39:59+0900
Task
D - ABS
User
naoya_t
Language
C++14 (GCC 5.4.1)
Score
500
Code Size
2983 Byte
Status
AC
Exec Time
1 ms
Memory
256 KB
Compile Error
./Main.cpp: In function ‘void read_cr()’:
./Main.cpp:61:28: warning: ignoring return value of ‘char* fgets(char*, int, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
fgets(_buf, 256, stdin);
^
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