답안 #47959

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
47959 2018-05-09T08:35:54 Z octopuses Gap (APIO16_gap) C++17
30 / 100
126 ms 2148 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 + 1) / (n - 1);
    answer = gap;
    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;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 428 KB Output is correct
4 Correct 2 ms 428 KB Output is correct
5 Correct 2 ms 480 KB Output is correct
6 Correct 2 ms 480 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 520 KB Output is correct
10 Correct 2 ms 520 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 3 ms 596 KB Output is correct
13 Correct 2 ms 600 KB Output is correct
14 Correct 4 ms 600 KB Output is correct
15 Correct 2 ms 600 KB Output is correct
16 Correct 15 ms 980 KB Output is correct
17 Correct 15 ms 996 KB Output is correct
18 Correct 16 ms 996 KB Output is correct
19 Correct 16 ms 996 KB Output is correct
20 Correct 11 ms 996 KB Output is correct
21 Correct 56 ms 2148 KB Output is correct
22 Correct 57 ms 2148 KB Output is correct
23 Correct 86 ms 2148 KB Output is correct
24 Correct 57 ms 2148 KB Output is correct
25 Correct 58 ms 2148 KB Output is correct
26 Correct 57 ms 2148 KB Output is correct
27 Correct 61 ms 2148 KB Output is correct
28 Correct 58 ms 2148 KB Output is correct
29 Correct 56 ms 2148 KB Output is correct
30 Correct 43 ms 2148 KB Output is correct
31 Correct 2 ms 2148 KB Output is correct
32 Correct 2 ms 2148 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 2148 KB Output isn't correct
2 Correct 2 ms 2148 KB Output is correct
3 Correct 2 ms 2148 KB Output is correct
4 Correct 2 ms 2148 KB Output is correct
5 Correct 2 ms 2148 KB Output is correct
6 Correct 2 ms 2148 KB Output is correct
7 Correct 2 ms 2148 KB Output is correct
8 Correct 2 ms 2148 KB Output is correct
9 Correct 2 ms 2148 KB Output is correct
10 Correct 2 ms 2148 KB Output is correct
11 Correct 3 ms 2148 KB Output is correct
12 Correct 3 ms 2148 KB Output is correct
13 Correct 3 ms 2148 KB Output is correct
14 Correct 3 ms 2148 KB Output is correct
15 Correct 4 ms 2148 KB Output is correct
16 Correct 20 ms 2148 KB Output is correct
17 Correct 20 ms 2148 KB Output is correct
18 Correct 20 ms 2148 KB Output is correct
19 Correct 23 ms 2148 KB Output is correct
20 Partially correct 10 ms 2148 KB Partially correct
21 Correct 83 ms 2148 KB Output is correct
22 Correct 77 ms 2148 KB Output is correct
23 Correct 79 ms 2148 KB Output is correct
24 Correct 80 ms 2148 KB Output is correct
25 Correct 74 ms 2148 KB Output is correct
26 Correct 126 ms 2148 KB Output is correct
27 Correct 78 ms 2148 KB Output is correct
28 Correct 84 ms 2148 KB Output is correct
29 Correct 83 ms 2148 KB Output is correct
30 Partially correct 43 ms 2148 KB Partially correct
31 Correct 2 ms 2148 KB Output is correct
32 Correct 2 ms 2148 KB Output is correct