제출 #532781

#제출 시각아이디문제언어결과실행 시간메모리
532781new_accGap (APIO16_gap)C++14
0 / 100
56 ms1080 KiB
#include "gap.h" #include<bits/stdc++.h> #define fi first #define se second using namespace std; typedef long long ll; typedef vector<int> vi; typedef vector<ll> vl; const int N=1e3+10; ll solve1(int n){ ll mn,mx; ll curr1=0,curr2=1e18,last1=-1,last2=-1; ll res=0; for(int i=1;i<=(n+1)/2;i++){ MinMax(curr1,curr2,&mn,&mx); if(last1!=-1) res=max({res,curr1-last1,last2-curr2}); last1=mn,last2=mx; curr1=mn+1,curr2=mx-1; } return (n%2==0?max(res,last2-last1):res); } ll findGap(int xd,int n){ if(xd==1) return solve1(n); }

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

gap.cpp: In function 'll findGap(int, int)':
gap.cpp:24:1: warning: control reaches end of non-void function [-Wreturn-type]
   24 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...