# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
23018 |
2017-05-01T20:32:44 Z |
arman_ferdous |
Gap (APIO16_gap) |
C++14 |
|
0 ms |
0 KB |
#include <bits/stdc++.h>
#include "gap.h"
static void my_assert(int k){ if (!k) exit(1); }
static int subtask_num, N;
static long long A[100001];
static long long call_count;
const long long MAXN = 1e18;
long long findGap(int, int);
void MinMax(long long s, long long t, long long *mn, long long *mx)
{
int lo = 1, hi = N, left = N+1, right = 0;
my_assert(s <= t && mn != NULL && mx != NULL);
while (lo <= hi){
int mid = (lo+hi)>>1;
if (A[mid] >= s) hi = mid - 1, left = mid;
else lo = mid + 1;
}
lo = 1, hi = N;
while (lo <= hi){
int mid = (lo+hi)>>1;
if (A[mid] <= t) lo = mid + 1, right = mid;
else hi = mid - 1;
}
if (left > right) *mn = *mx = -1;
else{
*mn = A[left];
*mx = A[right];
}
if (subtask_num == 1) call_count++;
else if (subtask_num == 2) call_count += right-left+2;
}
long long findGap(int T, int N)
{
long long aray[N], i = 0, j = N-1, lo = 0, hi = MAXN;
while(j-i >= 1)
{
long long x, y;
MinMax(lo,hi,&x,&y);
aray[i] = x, aray[j] = y;
i++, j--;
}
long long res = -1;
for(int i = 0; i+1 < N; i++)
res = (res < aray[i+1]-aray[i] ? aray[i+1]-aray[i] : res);
return res;
}
int main()
{
FILE *in = stdin, *out = stdout;
my_assert(2 == fscanf(in, "%d%d", &subtask_num, &N));
my_assert(1 <= subtask_num && subtask_num <= 2);
my_assert(2 <= N && N <= 100000);
for (int i=1;i<=N;i++) my_assert(1 == fscanf(in, "%lld", A+i));
for (int i=1;i<N;i++) my_assert(A[i] < A[i+1]);
fprintf(out, "%lld\n", findGap(subtask_num, N));
fprintf(out, "%lld\n", call_count);
}
Compilation message
/tmp/ccTuuTbu.o: In function `MinMax(long long, long long, long long*, long long*)':
grader.cpp:(.text+0x0): multiple definition of `MinMax(long long, long long, long long*, long long*)'
/tmp/cck9A4up.o:gap.cpp:(.text+0x0): first defined here
/tmp/ccTuuTbu.o: In function `main':
grader.cpp:(.text.startup+0x0): multiple definition of `main'
/tmp/cck9A4up.o:gap.cpp:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status