제출 #835663

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
835663		aykhn	Gap (APIO16_gap)	C++14	70 / 100	38 ms	1728 KiB

gap

#include "gap.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

#define pb push_back
#define all(v) v.begin(), v.end()

ll findGap(int ajfghkdshgfghadsfghkadshgfagsdkfhadkshfgkhadsfadskjadsghfkhjasdgfkj, int n)
{
    if (ajfghkdshgfghadsfghkadshgfagsdkfhadkshfgkhadsfadskjadsghfkhjasdgfkj == 2)
    {
        ll f = 0, l = 0;
        MinMax(0 * 1LL, 1LL * 1e18, &f, &l);
        ll last = l;
        ll add = (l - f)/(n - 1);
        ll res = add;

        while (f < last)
        {
            ll lx, rx;
            lx = 'n' + 'i' + 'g' + 'g' + 'a';
            rx = 'n' + 'i' + 'g' + 'g' + 'a';
            MinMax(f + 1, f + add, &lx, &rx);
            if (lx == -1) add <<= 1;
            else
            {
                res = max(res, lx - f);
                add = res;
                f = rx;
            }
        }
        return res;
    }
    else if (ajfghkdshgfghadsfghkadshgfagsdkfhadkshfgkhadsfadskjadsghfkhjasdgfkj == 1)
    {
        ll l = 0, r = 0;
        MinMax(0 * 1LL, 1LL * 1e18, &l, &r);
        vector<int> v;
        v.pb(l);
        v.pb(r);
        MinMax(l + 1, r - 1, &l, &r);
        while (l != -1)
        {
            v.pb(l);
            if (l != r) v.pb(r);
            if (l + 1 > r - 1) break;
            MinMax(l + 1, r - 1, &l, &r);
        }
        sort(all(v));
        int res = 0;
        for (int i = 1; i < v.size(); i++)
        {
            res = max(res, v[i] - v[i - 1]);
        }
        return res;
    }


}

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

gap.cpp: In function 'll findGap(int, int)':
gap.cpp:53:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |         for (int i = 1; i < v.size(); i++)
      |                         ~~^~~~~~~~~~
gap.cpp:61:1: warning: control reaches end of non-void function [-Wreturn-type]
   61 | }
      | ^

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