제출 #668326

#제출 시각아이디문제언어결과실행 시간메모리
668326birthdaycakeGap (APIO16_gap)C++17
0 / 100
68 ms2272 KiB
#include<bits/stdc++.h> #include "gap.h" using namespace std; long long findGap(int T, int N){ long long l = 0, r = 0, mn = 0, mx = 0; MinMax(1, 1000000000000000000, &mn, &mx); l = mn; r = mx; long long sz = (r - l + 1) / (N - 1), j = 0; vector<pair<int,int>>d; for(j = l; j <= r; j += sz+1){ MinMax(j, j + sz, &mn, &mx); d.push_back({mn, mx}); } MinMax(j, r, &mn, &mx); d.push_back({mn, mx}); long long ans = sz; mx = d[0].second; for(int i = 1; i < d.size(); i++){ if(mx != -1 && d[i].first != -1){ ans = max(ans, d[i].first - mx); mx = d[i].second; } } return ans; }

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

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:20:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |     for(int i = 1; i < d.size(); i++){
      |                    ~~^~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...