제출 #542395

#제출 시각아이디문제언어결과실행 시간메모리
542395farhan132Gap (APIO16_gap)C++17
0 / 100
64 ms5840 KiB
#include "gap.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef unsigned long long ull; typedef double dd; typedef vector<ll> vll; typedef pair<ll , ll> ii; typedef vector< ii > vii; typedef pair < pair < ll , ll > , pair < ll , ll > > cm; typedef tuple < int, ll, ll > tp; #define ff first #define ss second #define pb push_back #define in insert ii get(ll x, ll y){ ll mn , mx; MinMax(x, y, &mn, &mx); return {mn, mx}; } long long findGap(int T, int n) { if(T == 1){ set < ll > s; ll L = 0, R = 1e18; while(L <= R){ auto [l , r] = get(L , R); if(l == -1) break; s.in(l); s.in(r); L = l + 1; R = r - 1; } ll last = -1 , ans = 0; for(auto u : s){ if(last != -1) ans = max(ans , u - last); last = u; } return ans; } auto [l, r] = get(0, 1e18); if(r - l + 1 == n) return 1; ll block = (((r - l) - (n - 1)) + n - 1) / (n - 1) + 1; vector < ii > v; ll cur = l; ll last = l; ll ans = 0; while(cur <= r){ ll L = cur , R = min(cur + block - 1, r); auto [x, y] = get(L , R); cur = R + 1; if(x == -1){ continue; } if(last != -1) ans = max(ans , x - last); last = y; } return ans; }

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

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:41:4: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   41 |    if(last != -1) ans = max(ans , u - last); last = u;
      |    ^~
gap.cpp:41:46: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   41 |    if(last != -1) ans = max(ans , u - last); last = u;
      |                                              ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...