제출 #482445

#제출 시각아이디문제언어결과실행 시간메모리
482445MilosMilutinovicGap (APIO16_gap)C++14
30 / 100
50 ms1856 KiB
#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}());
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head
 
const int N=101000;
ll a[N];
ll findGap(int t,int n) {
	if (t==1) {
		ll l=0,r=1e18;
		rep(i,0,(n+1)/2) {
			MinMax(l,r,&l,&r);
			a[i]=l; a[n-i-1]=r; l++; r--;
		}
		ll ans=0;
		rep(i,0,n-1) ans=max(ans,a[i+1]-a[i]);
		return ans;
	}
}

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

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