제출 #1153378

#제출 시각아이디문제언어결과실행 시간메모리
1153378AlgorithmWarriorGap (APIO16_gap)C++20
0 / 100
38 ms1188 KiB
#include <bits/stdc++.h> using namespace std; #include "gap.h" void maxself(long long& x,long long val){ if(x<val) x=val; } long long findGap(int T, int N){ if(T==1){ long long st,dr; MinMax(0,1e18,&st,&dr); long long answer=1; while(st!=dr && st!=dr-1){ long long ultst=st; long long ultdr=dr; MinMax(ultst+1,ultdr-1,&st,&dr); if(st==-1) maxself(answer,ultdr-ultst); else{ maxself(answer,st-ultst); maxself(answer,ultdr-dr); } } return answer; } }

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

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