답안 #47939

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
47939 2018-05-09T08:19:48 Z octopuses Gap (APIO16_gap) C++17
0 / 100
75 ms 2224 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 = 0;
    ll pre = a;
    ll l = a;
    ll r = a + gap - 1;

    for(ll i = 0; r < b; ++ i)
    {
      l += gap;
      r += gap;
      l = max(a, l);
      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;
  l = 0; r = n + 1;
  _A[r] = M;
  l ++; r ++;
  while(l <= r)
  {
    MinMax(_A[l - 1], _A[r + 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]);
}

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:50:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 248 KB Output isn't correct
2 Incorrect 2 ms 356 KB Output isn't correct
3 Incorrect 2 ms 432 KB Output isn't correct
4 Incorrect 2 ms 576 KB Output isn't correct
5 Incorrect 2 ms 576 KB Output isn't correct
6 Incorrect 2 ms 576 KB Output isn't correct
7 Incorrect 2 ms 576 KB Output isn't correct
8 Incorrect 2 ms 588 KB Output isn't correct
9 Incorrect 2 ms 588 KB Output isn't correct
10 Incorrect 2 ms 676 KB Output isn't correct
11 Incorrect 2 ms 676 KB Output isn't correct
12 Incorrect 2 ms 700 KB Output isn't correct
13 Incorrect 2 ms 700 KB Output isn't correct
14 Incorrect 2 ms 700 KB Output isn't correct
15 Incorrect 2 ms 700 KB Output isn't correct
16 Incorrect 10 ms 992 KB Output isn't correct
17 Incorrect 11 ms 992 KB Output isn't correct
18 Incorrect 11 ms 996 KB Output isn't correct
19 Incorrect 10 ms 996 KB Output isn't correct
20 Incorrect 7 ms 996 KB Output isn't correct
21 Incorrect 40 ms 2148 KB Output isn't correct
22 Incorrect 39 ms 2152 KB Output isn't correct
23 Incorrect 38 ms 2152 KB Output isn't correct
24 Incorrect 37 ms 2152 KB Output isn't correct
25 Incorrect 30 ms 2152 KB Output isn't correct
26 Incorrect 38 ms 2152 KB Output isn't correct
27 Incorrect 38 ms 2152 KB Output isn't correct
28 Incorrect 43 ms 2152 KB Output isn't correct
29 Incorrect 38 ms 2224 KB Output isn't correct
30 Incorrect 24 ms 2224 KB Output isn't correct
31 Incorrect 2 ms 2224 KB Output isn't correct
32 Incorrect 2 ms 2224 KB Output isn't correct
# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 2224 KB Output isn't correct
2 Correct 2 ms 2224 KB Output is correct
3 Correct 2 ms 2224 KB Output is correct
4 Correct 2 ms 2224 KB Output is correct
5 Correct 2 ms 2224 KB Output is correct
6 Correct 2 ms 2224 KB Output is correct
7 Correct 2 ms 2224 KB Output is correct
8 Correct 2 ms 2224 KB Output is correct
9 Correct 2 ms 2224 KB Output is correct
10 Incorrect 2 ms 2224 KB Output isn't correct
11 Correct 2 ms 2224 KB Output is correct
12 Correct 3 ms 2224 KB Output is correct
13 Correct 3 ms 2224 KB Output is correct
14 Correct 3 ms 2224 KB Output is correct
15 Correct 3 ms 2224 KB Output is correct
16 Correct 19 ms 2224 KB Output is correct
17 Correct 19 ms 2224 KB Output is correct
18 Correct 19 ms 2224 KB Output is correct
19 Correct 19 ms 2224 KB Output is correct
20 Partially correct 9 ms 2224 KB Partially correct
21 Correct 74 ms 2224 KB Output is correct
22 Correct 74 ms 2224 KB Output is correct
23 Correct 74 ms 2224 KB Output is correct
24 Correct 74 ms 2224 KB Output is correct
25 Correct 69 ms 2224 KB Output is correct
26 Correct 75 ms 2224 KB Output is correct
27 Correct 75 ms 2224 KB Output is correct
28 Correct 74 ms 2224 KB Output is correct
29 Correct 75 ms 2224 KB Output is correct
30 Partially correct 41 ms 2224 KB Partially correct
31 Correct 2 ms 2224 KB Output is correct
32 Correct 2 ms 2224 KB Output is correct