Submission #47949

# Submission time Handle Problem Language Result Execution time Memory
47949 2018-05-09T08:27:26 Z octopuses Gap (APIO16_gap) C++17
30 / 100
110 ms 2284 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;
    ll pre = a;
    ll l = a;
    ll r = a + gap - 1;

    for(ll i = 0; r < b; ++ i)
    {
      l += gap;
      r += gap;
      r = min(b, r);
      ll x, y;
      MinMax(l, r, &x, &y);
      if(x == -1)
        continue;
      answer = max(answer, x - pre);
      pre = y;
    }
    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 248 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 2 ms 488 KB Output is correct
4 Correct 2 ms 488 KB Output is correct
5 Correct 2 ms 488 KB Output is correct
6 Correct 2 ms 540 KB Output is correct
7 Correct 2 ms 544 KB Output is correct
8 Correct 2 ms 588 KB Output is correct
9 Correct 2 ms 588 KB Output is correct
10 Correct 2 ms 588 KB Output is correct
11 Correct 3 ms 592 KB Output is correct
12 Correct 2 ms 592 KB Output is correct
13 Correct 2 ms 596 KB Output is correct
14 Correct 2 ms 612 KB Output is correct
15 Correct 2 ms 612 KB Output is correct
16 Correct 15 ms 996 KB Output is correct
17 Correct 15 ms 1000 KB Output is correct
18 Correct 15 ms 1000 KB Output is correct
19 Correct 15 ms 1000 KB Output is correct
20 Correct 12 ms 1004 KB Output is correct
21 Correct 57 ms 2156 KB Output is correct
22 Correct 56 ms 2160 KB Output is correct
23 Correct 56 ms 2160 KB Output is correct
24 Correct 54 ms 2284 KB Output is correct
25 Correct 48 ms 2284 KB Output is correct
26 Correct 55 ms 2284 KB Output is correct
27 Correct 56 ms 2284 KB Output is correct
28 Correct 55 ms 2284 KB Output is correct
29 Correct 55 ms 2284 KB Output is correct
30 Correct 43 ms 2284 KB Output is correct
31 Correct 2 ms 2284 KB Output is correct
32 Correct 2 ms 2284 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 2284 KB Output is correct
2 Correct 2 ms 2284 KB Output is correct
3 Correct 2 ms 2284 KB Output is correct
4 Correct 5 ms 2284 KB Output is correct
5 Correct 2 ms 2284 KB Output is correct
6 Correct 2 ms 2284 KB Output is correct
7 Correct 2 ms 2284 KB Output is correct
8 Correct 2 ms 2284 KB Output is correct
9 Correct 2 ms 2284 KB Output is correct
10 Incorrect 2 ms 2284 KB Output isn't correct
11 Correct 3 ms 2284 KB Output is correct
12 Correct 3 ms 2284 KB Output is correct
13 Correct 3 ms 2284 KB Output is correct
14 Correct 3 ms 2284 KB Output is correct
15 Correct 3 ms 2284 KB Output is correct
16 Correct 19 ms 2284 KB Output is correct
17 Correct 19 ms 2284 KB Output is correct
18 Correct 19 ms 2284 KB Output is correct
19 Correct 21 ms 2284 KB Output is correct
20 Partially correct 10 ms 2284 KB Partially correct
21 Correct 75 ms 2284 KB Output is correct
22 Correct 73 ms 2284 KB Output is correct
23 Correct 77 ms 2284 KB Output is correct
24 Correct 72 ms 2284 KB Output is correct
25 Correct 69 ms 2284 KB Output is correct
26 Correct 110 ms 2284 KB Output is correct
27 Correct 96 ms 2284 KB Output is correct
28 Correct 74 ms 2284 KB Output is correct
29 Correct 76 ms 2284 KB Output is correct
30 Partially correct 41 ms 2284 KB Partially correct
31 Correct 2 ms 2284 KB Output is correct
32 Correct 2 ms 2284 KB Output is correct