이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#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)
{
vector<ll> v;
ll l = 0, r = 1e18;
while (l <= r && v.size() < n)
{
ll lx, rx;
MinMax(l, r, &lx, &rx);
if (lx == -1) break;
v.pb(lx);
if (lx != rx) v.pb(rx);
l = lx + 1;
r = rx - 1;
}
sort(all(v));
ll 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:40:35: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
40 | while (l <= r && v.size() < n)
| ~~~~~~~~~^~~
gap.cpp:52:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
52 | for (int i = 1; i < v.size(); i++)
| ~~^~~~~~~~~~
gap.cpp:60:1: warning: control reaches end of non-void function [-Wreturn-type]
60 | }
| ^
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |