Submission #47960

# Submission time Handle Problem Language Result Execution time Memory
47960 2018-05-09T08:36:24 Z octopuses Gap (APIO16_gap) C++17
89.0376 / 100
86 ms 2124 KB
#include "gap.h"
#include <bits/stdc++.h>

#define ll long long
#define M (ll)(1e18)

using namespace std;
ll _A[100020];

long long findGap(int T, int n)
{
  if(T == 2)
  {
    ll a, b, answer;
    MinMax(0, M, &a, &b);
    ll gap = (b - a) / (n - 1);
    answer = gap - 1;
    ll pre = a;
    ll l = a - gap + 1;
    ll r = a;

    for(ll i = 0; r + 1 < b; ++ i)
    {
      l += gap;
      r += gap;
      r = min(b - 1, r);
      ll x, y;
      if(l > r)
      {
        break;
      }
      MinMax(l, r, &x, &y);
      if(x == -1)
        continue;
      answer = max(answer, x - pre);
      pre = y;
    }
    answer = max(b - pre, answer);
    return answer;
  }
  int l, r;
  _A[0] = -1;
  l = 0; r = n + 1;
  _A[r] = M + 1;
  l ++; r --;
  while(l <= r)
  {
    MinMax(_A[l - 1] + 1, _A[r + 1] - 1, &_A[l], &_A[r]);
    l ++;
    r --;
  }
  ll answer = 0;
  for(int i = 2; i <= n; ++ i)
    answer = max(answer, _A[i] - _A[i - 1]);
  return answer;
}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 568 KB Output is correct
4 Correct 2 ms 568 KB Output is correct
5 Correct 2 ms 568 KB Output is correct
6 Correct 2 ms 600 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 2 ms 600 KB Output is correct
9 Correct 2 ms 600 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 2 ms 600 KB Output is correct
13 Correct 3 ms 600 KB Output is correct
14 Correct 2 ms 600 KB Output is correct
15 Correct 2 ms 600 KB Output is correct
16 Correct 15 ms 920 KB Output is correct
17 Correct 15 ms 920 KB Output is correct
18 Correct 15 ms 968 KB Output is correct
19 Correct 15 ms 1076 KB Output is correct
20 Correct 12 ms 1076 KB Output is correct
21 Correct 59 ms 2120 KB Output is correct
22 Correct 58 ms 2120 KB Output is correct
23 Correct 57 ms 2120 KB Output is correct
24 Correct 58 ms 2120 KB Output is correct
25 Correct 63 ms 2120 KB Output is correct
26 Correct 58 ms 2120 KB Output is correct
27 Correct 57 ms 2120 KB Output is correct
28 Correct 57 ms 2124 KB Output is correct
29 Correct 56 ms 2124 KB Output is correct
30 Correct 44 ms 2124 KB Output is correct
31 Correct 2 ms 2124 KB Output is correct
32 Correct 2 ms 2124 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 2124 KB Output is correct
2 Correct 2 ms 2124 KB Output is correct
3 Correct 2 ms 2124 KB Output is correct
4 Correct 2 ms 2124 KB Output is correct
5 Correct 2 ms 2124 KB Output is correct
6 Correct 2 ms 2124 KB Output is correct
7 Correct 2 ms 2124 KB Output is correct
8 Correct 2 ms 2124 KB Output is correct
9 Correct 2 ms 2124 KB Output is correct
10 Correct 2 ms 2124 KB Output is correct
11 Correct 3 ms 2124 KB Output is correct
12 Correct 4 ms 2124 KB Output is correct
13 Correct 3 ms 2124 KB Output is correct
14 Correct 3 ms 2124 KB Output is correct
15 Correct 3 ms 2124 KB Output is correct
16 Correct 23 ms 2124 KB Output is correct
17 Correct 21 ms 2124 KB Output is correct
18 Correct 20 ms 2124 KB Output is correct
19 Correct 20 ms 2124 KB Output is correct
20 Partially correct 10 ms 2124 KB Partially correct
21 Correct 77 ms 2124 KB Output is correct
22 Correct 80 ms 2124 KB Output is correct
23 Correct 86 ms 2124 KB Output is correct
24 Correct 78 ms 2124 KB Output is correct
25 Correct 72 ms 2124 KB Output is correct
26 Correct 79 ms 2124 KB Output is correct
27 Correct 76 ms 2124 KB Output is correct
28 Correct 81 ms 2124 KB Output is correct
29 Correct 78 ms 2124 KB Output is correct
30 Partially correct 41 ms 2124 KB Partially correct
31 Correct 2 ms 2124 KB Output is correct
32 Correct 2 ms 2124 KB Output is correct