제출 #977247

#제출 시각아이디문제언어결과실행 시간메모리
977247aaaaaarrozGap (APIO16_gap)C++17
100 / 100
42 ms3816 KiB
#include "gap.h" #include<bits/stdc++.h> using namespace std; long long findGap(int T, int N){ long long mn, mx, ans = -((long long)1E18 + 7); vector<long long> a(N+1, 0ll); MinMax(0ll, (long long)1E18, &mn, &mx); a[1] = mn, a[N] = mx; if(T == 1 || N <= 10){ for(register int i = 2; i <= N/2 + (N & 1); ++i){ long long l = a[i-1], r = a[N - (i-1) + 1]; MinMax(l+1, r-1, &mn, &mx); a[i] = mn, a[N - i + 1] = mx; } for(register int i = 2; i <= N; ++i) ans = max(ans, a[i] - a[i-1]); return ans; } long long blo = (mx - mn) / (N - 1) + 1; long long pmx{a[1]}; for(long long j = a[1]; j <= a[N]; j += blo){ MinMax(j, j + blo - 1, &mn, &mx); if(mn == -1) continue; ans = max(ans, mn - pmx); pmx = mx; } return ans; }

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

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:10:24: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   10 |       for(register int i = 2; i <= N/2 + (N & 1); ++i){
      |                        ^
gap.cpp:15:24: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   15 |       for(register int i = 2; i <= N; ++i) ans = max(ans, a[i] - a[i-1]);
      |                        ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...