제출 #536182

#제출 시각아이디문제언어결과실행 시간메모리
536182DJ035Gap (APIO16_gap)C++17
30 / 100
45 ms1888 KiB
#include "gap.h"
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,avx,avx2")
#include <bits/stdc++.h>
#define MEM 111111
#define sanic ios_base::sync_with_stdio(0)
#define x first
#define y second
#define pf push_front
#define pb push_back
#define all(v) v.begin(), v.end()
#define sz size()
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pi;
const ll INF = 1e17+7;
const ll MOD = 998244353;
ll gcd(ll a, ll b){
    if(a%b) return gcd(b, a%b);
    return b;
}
ll t,n,m;
ll a[MEM];
ll findGap(int T, int N)
{
	if(T==1){
        ll l=0, r=1e18, s=0, e=N-1;
        for(int i=0; i<(N+1)/2; i++){
            MinMax(l, r, &l, &r);
            a[s] = l;
            a[e] = r;
            l++, r--;
            s++, e--;
        }
        ll ans=0;
        for(int i=0; i<N-1; i++)
            ans = max(ans, a[i+1]-a[i]);
        return ans;
	}
}

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

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