답안 #1015191

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1015191 2024-07-06T07:17:10 Z vjudge1 Gap (APIO16_gap) C++17
47.6762 / 100
49 ms 3416 KB
#include<bits/stdc++.h>
#include "gap.h"

using namespace std;

typedef long long ll;


ll subtask1(int N);

ll subtask2(ll s = 0, ll e = 1e18)
{
  if(s >= e) return 0;
  
  ll mid = (s + e) / 2;
  ll mx1, mx2, mn1, mn2;

  MinMax(s, mid, &mn1, &mx1);
  MinMax(mid + 1, e, &mn2, &mx2);
  
  if(mn2 == -1) return subtask2(mn1, mx1);
  if(mn1 == -1) return subtask2(mn2, mx2);

  ll ans = mn2 - mx1;

  if(mx1 - mn1 < mx2 - mx2)
    swap(mx1, mx2), swap(mn1, mn2);
  
  if(ans < mx1 - mn1)
    ans = max(ans, subtask2(mn1, mx1));
  
  if(ans < mx2 - mn2)
    ans = max(ans, subtask2(mn2, mx2));

  return ans;
}

ll findGap(int T, int N)
{
  if(T == 1)
    return subtask1(N);
  return subtask2();
}
















ll subtask1(int N)
{
  int i = 0, j = N - 1;
  ll s = 0, e = 1e18;
  ll *mn = new ll, *mx = new ll;

  vector<ll> v(N);
  
  while(i <= j && s <= e)
    {
      MinMax(s, e, mn, mx);
      v[i] = *mn;
      v[j] = *mx;
      i++, j--;
      s = *mn + 1;
      e = *mx - 1;
    }

  ll ans = 0;
  for(int i = 1; i < v.size(); i++)
    ans = max(ans, v[i] - v[i - 1]);
  return ans;
}

Compilation message

gap.cpp: In function 'll subtask1(int)':
gap.cpp:79:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |   for(int i = 1; i < v.size(); i++)
      |                  ~~^~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 0 ms 2392 KB Output is correct
4 Correct 0 ms 2392 KB Output is correct
5 Correct 0 ms 2392 KB Output is correct
6 Correct 0 ms 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 0 ms 2392 KB Output is correct
9 Correct 0 ms 2392 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 7 ms 2648 KB Output is correct
17 Correct 6 ms 2648 KB Output is correct
18 Correct 8 ms 2648 KB Output is correct
19 Correct 6 ms 2564 KB Output is correct
20 Correct 6 ms 2648 KB Output is correct
21 Correct 26 ms 3416 KB Output is correct
22 Correct 25 ms 3416 KB Output is correct
23 Correct 34 ms 3416 KB Output is correct
24 Correct 25 ms 3416 KB Output is correct
25 Correct 22 ms 3416 KB Output is correct
26 Correct 25 ms 3416 KB Output is correct
27 Correct 34 ms 3416 KB Output is correct
28 Correct 25 ms 3416 KB Output is correct
29 Correct 25 ms 3416 KB Output is correct
30 Correct 22 ms 3416 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 0 ms 2392 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Partially correct 1 ms 2392 KB Partially correct
3 Partially correct 1 ms 2392 KB Partially correct
4 Correct 0 ms 2392 KB Output is correct
5 Partially correct 0 ms 2392 KB Partially correct
6 Partially correct 1 ms 2392 KB Partially correct
7 Partially correct 0 ms 2392 KB Partially correct
8 Partially correct 0 ms 2392 KB Partially correct
9 Partially correct 1 ms 2392 KB Partially correct
10 Partially correct 0 ms 2392 KB Partially correct
11 Partially correct 1 ms 2392 KB Partially correct
12 Partially correct 1 ms 2392 KB Partially correct
13 Partially correct 1 ms 2392 KB Partially correct
14 Partially correct 1 ms 2392 KB Partially correct
15 Partially correct 1 ms 2392 KB Partially correct
16 Partially correct 9 ms 2596 KB Partially correct
17 Partially correct 9 ms 2392 KB Partially correct
18 Partially correct 11 ms 2592 KB Partially correct
19 Partially correct 10 ms 2392 KB Partially correct
20 Partially correct 2 ms 2392 KB Partially correct
21 Partially correct 37 ms 2648 KB Partially correct
22 Partially correct 37 ms 2648 KB Partially correct
23 Partially correct 46 ms 2728 KB Partially correct
24 Partially correct 37 ms 2648 KB Partially correct
25 Partially correct 49 ms 2832 KB Partially correct
26 Partially correct 37 ms 2648 KB Partially correct
27 Partially correct 44 ms 2848 KB Partially correct
28 Partially correct 38 ms 2648 KB Partially correct
29 Partially correct 42 ms 2660 KB Partially correct
30 Partially correct 7 ms 2648 KB Partially correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct