제출 #140739

#제출 시각아이디문제언어결과실행 시간메모리
140739BlueDiamondGap (APIO16_gap)C++14
0 / 100
63 ms4208 KiB
#include <bits/stdc++.h> #include "gap.h" using namespace std; long long findGap(int T, int N) { if (T == 1) { vector <long long> vals; long long st = 0, dr = (long long) 1e18; while (st <= dr) { long long a = -1, b = -1; MinMax(st, dr, &a, &b); vals.push_back(a); if (a < b) vals.push_back(b); if (a == -1 || b == -1) break; st = a + 1; dr = b - 1; } sort(vals.begin(), vals.end()); long long ans = 0; for (int i = 0; i + 1 < (int) vals.size(); i++) ans = max(ans, vals[i + 1] - vals[i]); return ans; } else { } }

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

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:29:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...