답안 #1015205

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1015205 2024-07-06T07:31:56 Z vjudge1 Gap (APIO16_gap) C++17
30 / 100
40 ms 1968 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;

  if(e - s == 1)
    {
      ll mn, mx;
      MinMax(s, e, &mn, &mx);
      return mx - mn;
    }
  
  ll mid1 = (s + e) / 3, mid2 = 2 * (s + e) / 3;
  ll mx1, mx2, mx3, mn1, mn2, mn3;

  MinMax(s, mid1, &mn1, &mx1);
  MinMax(mid1 + 1, mid2, &mn2, &mx2);
  MinMax(mid2 + 1, e, &mn3, &mx3);
  
  if(mn2 == -1 && mn3 == -1) return subtask2(mn1, mx1);
  if(mn1 == -1 && mn3 == -1) return subtask2(mn2, mx2);
  if(mn1 == -1 && mn2 == -1) return subtask2(mn3, mx3);

  if(mn1 == -1)
    {
      ll ans = mn3 - mx2;
      if(ans < mx3 - mn3)
	ans = max(ans, subtask2(mn3, mx3));

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

      return ans;
    }

  if(mn2 == -1)
    {
      ll ans = mn3 - mx1;
      if(ans < mx3 - mn3)
	ans = max(ans, subtask2(mn3, mx3));

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

      return ans;
    }

  if(mn3 == -1)
    {
      ll ans = mn2 - mx1;
      if(ans < mx1 - mn1)
	ans = max(ans, subtask2(mn1, mx1));

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

      return ans;
    }
  
  ll ans = max(mn2 - mx1, mn3 - mx2);
  
  if(ans < mx1 - mn1)
    ans = max(ans, subtask2(mn1, mx1));
  
  if(ans < mx2 - mn2)
    ans = max(ans, subtask2(mn2, mx2));

  if(ans < mx3 - mn3)
    ans = max(ans, subtask2(mn3, mx3));
  
  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:124:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  124 |   for(int i = 1; i < v.size(); i++)
      |                  ~~^~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 6 ms 856 KB Output is correct
17 Correct 6 ms 856 KB Output is correct
18 Correct 8 ms 660 KB Output is correct
19 Correct 6 ms 692 KB Output is correct
20 Correct 5 ms 660 KB Output is correct
21 Correct 40 ms 1880 KB Output is correct
22 Correct 25 ms 1880 KB Output is correct
23 Correct 25 ms 1880 KB Output is correct
24 Correct 25 ms 1968 KB Output is correct
25 Correct 23 ms 1880 KB Output is correct
26 Correct 31 ms 1880 KB Output is correct
27 Correct 25 ms 1880 KB Output is correct
28 Correct 25 ms 1880 KB Output is correct
29 Correct 31 ms 1824 KB Output is correct
30 Correct 25 ms 1880 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Runtime error 0 ms 344 KB Execution failed because the return code was nonzero
3 Runtime error 1 ms 344 KB Execution failed because the return code was nonzero
4 Correct 0 ms 344 KB Output is correct
5 Runtime error 0 ms 344 KB Execution failed because the return code was nonzero
6 Runtime error 0 ms 344 KB Execution failed because the return code was nonzero
7 Runtime error 0 ms 344 KB Execution failed because the return code was nonzero
8 Runtime error 0 ms 344 KB Execution failed because the return code was nonzero
9 Runtime error 0 ms 344 KB Execution failed because the return code was nonzero
10 Correct 0 ms 344 KB Output is correct
11 Runtime error 0 ms 344 KB Execution failed because the return code was nonzero
12 Runtime error 1 ms 344 KB Execution failed because the return code was nonzero
13 Runtime error 0 ms 344 KB Execution failed because the return code was nonzero
14 Runtime error 0 ms 344 KB Execution failed because the return code was nonzero
15 Runtime error 0 ms 344 KB Execution failed because the return code was nonzero
16 Runtime error 3 ms 600 KB Execution failed because the return code was nonzero
17 Runtime error 3 ms 612 KB Execution failed because the return code was nonzero
18 Runtime error 3 ms 600 KB Execution failed because the return code was nonzero
19 Runtime error 6 ms 600 KB Execution failed because the return code was nonzero
20 Correct 2 ms 600 KB Output is correct
21 Runtime error 11 ms 1112 KB Execution failed because the return code was nonzero
22 Runtime error 12 ms 1172 KB Execution failed because the return code was nonzero
23 Runtime error 12 ms 1208 KB Execution failed because the return code was nonzero
24 Runtime error 15 ms 1112 KB Execution failed because the return code was nonzero
25 Runtime error 12 ms 1112 KB Execution failed because the return code was nonzero
26 Runtime error 19 ms 1172 KB Execution failed because the return code was nonzero
27 Runtime error 13 ms 1112 KB Execution failed because the return code was nonzero
28 Runtime error 12 ms 1004 KB Execution failed because the return code was nonzero
29 Runtime error 12 ms 1112 KB Execution failed because the return code was nonzero
30 Correct 11 ms 1196 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct