제출 #1153384

#제출 시각아이디문제언어결과실행 시간메모리
1153384AlgorithmWarriorGap (APIO16_gap)C++20
30 / 100
43 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;
        int i;
        for(i=1;i<=(N-1)/2;++i){
            long long ultst=st;
            long long ultdr=dr;
            MinMax(ultst+1,ultdr-1,&st,&dr);
            maxself(answer,st-ultst);
            maxself(answer,ultdr-dr);
        }
        maxself(answer,dr-st);
        return answer;
    }
}

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

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