제출 #1003464

#제출 시각아이디문제언어결과실행 시간메모리
1003464amine_arouaGap (APIO16_gap)C++17
0 / 100
44 ms2900 KiB
#include <bits/stdc++.h> using namespace std; #define intt long long #define fore(i , n) for(int i = 0 ; i < n; i++) #define forr(i , x ,y) for(int i = x; i <= y;i++) void MinMax(intt s , intt t , intt *mn , intt *mx); long long findGap(int T, int N) { intt mn , mx; MinMax(0ll , 1LL * 1e18 , &mn , &mx); intt gmn = mn , gmx = mx; double d = (double)(mx - mn)/(1.0 * (N - 1)); vector<intt> MinB(N) , MaxB(N); fore(i , N - 1) { intt lt = ceil(i * d + gmn) , rt = floor((i + 1)*d + gmn - 1); MinMax(lt , rt , &mn , &mx); MinB[i] = mn; MaxB[i] = mx; } MinB[N - 1]= MaxB[N - 1] = mx; intt prv = MaxB[0]; intt ans = (intt)d; forr(i , 1 , N - 1) { if(MinB[i] == -1) continue; ans = max(ans , MaxB[i] - MinB[i]); ans= max(ans , MinB[i] - prv); prv = MaxB[i]; } return ans; }

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

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:11:21: warning: unused variable 'gmx' [-Wunused-variable]
   11 |     intt gmn = mn , gmx = mx;
      |                     ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...