제출 #30925

#제출 시각아이디문제언어결과실행 시간메모리
30925sean617Gap (APIO16_gap)C++98
100 / 100
93 ms7548 KiB
#include "gap.h" #define SZ 100005 #include <iostream> #include <algorithm> #include <vector> typedef long long ll; using namespace std; ll n, x = -1, num = -1, a[SZ]; vector<ll> b; // //void f(ll p, ll q) { // ll mn1, mx1, mn2, mx2; // mn1 = mx1 = mn2 = mx2 = -1; // if (p > q || b.size() == n || q - p <= x) return; // if (q - p <= num) { // MinMax(p, q, &mn1, &mx1); // if (mn1 == -1) return; // b.push_back(mn1); // if (mn1 != mx1) b.push_back(mx1); // f(mn1 + 1, mx1 - 1); // } else { // ll md = (p + q) / 2; // MinMax(p, md, &mn1, &mx1); // if (p < q) MinMax(md + 1, q, &mn2, &mx2); // if (mn1 == -1 && mx1 == -1 && mn2 == -1 && mx2 == -1) x = max(x, (q + 1) - (p - 1)); // if (mn1 != -1) { // b.push_back(mn1); // if (mn1 != mx1) b.push_back(mx1); // f(mn1 + 1, mx1 - 1); // } // if (p < q && mn2 != -1) { // b.push_back(mn2); // if (mn2 != mx2) b.push_back(mx2); // f(mn2 + 1, mx2 - 1); // } // } //} // long long findGap(int T, int N) { ll st = 0, en = 1e18, i = 0, j = N - 1, mn, mx, ans, tmx; n = N; if (T == 1) { while (i <= j) { MinMax(st, en, &mn, &mx); a[i] = mn; a[j] = mx; st = mn + 1; en = mx - 1; i++; j--; } ans = a[1] - a[0]; for (i = 1; i < N - 1; i++) { ans = max(ans, a[i + 1] - a[i]); } } else { MinMax(st, en, &mn, &mx); x = (mx - mn) / (N - 1); if ((mx - mn) % (N - 1) > 0) x++; st = mn; en = mx; // b.push_back(mn); tmx = mx; for (i = st; i <= en; i += x + 1) { j = min(i + x, en); MinMax(i, j, &mn, &mx); if (mn != -1) { b.push_back(mn); if (mx != mn) b.push_back(mx); } } // b.push_back(tmx); ans = x; for (i = 0; i < b.size() - 1; i++) { ans = max(ans, b[i + 1] - b[i]); } } return ans; }

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

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:76:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (i = 0; i < b.size() - 1; i++) {
                 ^
gap.cpp:42:55: warning: variable 'tmx' set but not used [-Wunused-but-set-variable]
  ll st = 0, en = 1e18, i = 0, j = N - 1, mn, mx, ans, tmx;
                                                       ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...