답안 #47954

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
47954 2018-05-09T08:31:04 Z octopuses Gap (APIO16_gap) C++17
83.5083 / 100
78 ms 2264 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 - gap;
    ll r = a - 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;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 416 KB Output is correct
4 Correct 2 ms 496 KB Output is correct
5 Correct 2 ms 568 KB Output is correct
6 Correct 2 ms 748 KB Output is correct
7 Correct 2 ms 748 KB Output is correct
8 Correct 2 ms 748 KB Output is correct
9 Correct 2 ms 748 KB Output is correct
10 Correct 2 ms 748 KB Output is correct
11 Correct 2 ms 748 KB Output is correct
12 Correct 2 ms 748 KB Output is correct
13 Correct 3 ms 748 KB Output is correct
14 Correct 2 ms 748 KB Output is correct
15 Correct 2 ms 748 KB Output is correct
16 Correct 14 ms 1020 KB Output is correct
17 Correct 15 ms 1024 KB Output is correct
18 Correct 20 ms 1024 KB Output is correct
19 Correct 14 ms 1132 KB Output is correct
20 Correct 11 ms 1132 KB Output is correct
21 Correct 53 ms 2116 KB Output is correct
22 Correct 53 ms 2172 KB Output is correct
23 Correct 53 ms 2172 KB Output is correct
24 Correct 54 ms 2264 KB Output is correct
25 Correct 45 ms 2264 KB Output is correct
26 Correct 58 ms 2264 KB Output is correct
27 Correct 54 ms 2264 KB Output is correct
28 Correct 55 ms 2264 KB Output is correct
29 Correct 57 ms 2264 KB Output is correct
30 Correct 40 ms 2264 KB Output is correct
31 Correct 2 ms 2264 KB Output is correct
32 Correct 2 ms 2264 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Partially correct 2 ms 2264 KB Partially correct
2 Partially correct 2 ms 2264 KB Partially correct
3 Partially correct 2 ms 2264 KB Partially correct
4 Partially correct 2 ms 2264 KB Partially correct
5 Partially correct 2 ms 2264 KB Partially correct
6 Partially correct 2 ms 2264 KB Partially correct
7 Partially correct 2 ms 2264 KB Partially correct
8 Partially correct 2 ms 2264 KB Partially correct
9 Partially correct 2 ms 2264 KB Partially correct
10 Partially correct 2 ms 2264 KB Partially correct
11 Partially correct 3 ms 2264 KB Partially correct
12 Partially correct 3 ms 2264 KB Partially correct
13 Partially correct 3 ms 2264 KB Partially correct
14 Partially correct 3 ms 2264 KB Partially correct
15 Partially correct 3 ms 2264 KB Partially correct
16 Partially correct 18 ms 2264 KB Partially correct
17 Partially correct 18 ms 2264 KB Partially correct
18 Partially correct 18 ms 2264 KB Partially correct
19 Partially correct 18 ms 2264 KB Partially correct
20 Partially correct 9 ms 2264 KB Partially correct
21 Partially correct 71 ms 2264 KB Partially correct
22 Partially correct 71 ms 2264 KB Partially correct
23 Partially correct 73 ms 2264 KB Partially correct
24 Partially correct 78 ms 2264 KB Partially correct
25 Partially correct 69 ms 2264 KB Partially correct
26 Partially correct 75 ms 2264 KB Partially correct
27 Partially correct 73 ms 2264 KB Partially correct
28 Partially correct 71 ms 2264 KB Partially correct
29 Partially correct 72 ms 2264 KB Partially correct
30 Partially correct 40 ms 2264 KB Partially correct
31 Partially correct 2 ms 2264 KB Partially correct
32 Partially correct 2 ms 2264 KB Partially correct