제출 #668270

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
668270		finn__	Gap (APIO16_gap)	C++17	0 / 100	41 ms	1088 KiB

gap

#include <bits/stdc++.h>
#include "gap.h"
using namespace std;

long long findGap(int T, int n)
{
    switch (T)
    {
    case 1:
    {
        long long a, b, x, y, max_d = 0;
        MinMax(0, 1e18, &a, &b);
        size_t num_examined = 2;

        if (num_examined == n)
            max_d = max(max_d, y - x);

        while (a + 1 < b && num_examined < n)
        {
            if (num_examined == n - 1)
                MinMax(a + 1, b, &x, &y);
            else
                MinMax(a + 1, b - 1, &x, &y);

            max_d = max(max_d, max(x - a, b - y));

            a = x;
            b = y;

            num_examined += 2;

            if (num_examined == n)
                max_d = max(max_d, y - x);
        }

        return max_d;
    }
    case 2:
    {
        return 0;
    }
    }
}

컴파일 시 표준 에러 (stderr) 메시지

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:15:26: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   15 |         if (num_examined == n)
      |             ~~~~~~~~~~~~~^~~~
gap.cpp:18:42: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   18 |         while (a + 1 < b && num_examined < n)
      |                             ~~~~~~~~~~~~~^~~
gap.cpp:20:30: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   20 |             if (num_examined == n - 1)
      |                 ~~~~~~~~~~~~~^~~~~~~~
gap.cpp:32:30: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   32 |             if (num_examined == n)
      |                 ~~~~~~~~~~~~~^~~~
gap.cpp:43:1: warning: control reaches end of non-void function [-Wreturn-type]
   43 | }
      | ^

• Subtask 1: 0 / 30
• Subtask 2: 0 / 70