제출 #554310

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
554310		Koosha_mv	Gap (APIO16_gap)	C++14	0 / 100	28 ms	1144 KiB

gap

#include <bits/stdc++.h>
using namespace std;
#define dbgv(v) cout<<#v<<" = "; f(i,0,v.size()) cout<<v[i]<<" "; cout<<endl
#define dbga(a,x,y) cout<<#a<<" = "; f(i,x,y) cout<<a[i]<<" "; cout<<endl
#define erorp(x) cout<<#x<<"={"<<x.F<<" , "<<x.S<<"}"<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define all(v) v.begin(),v.end()
#define bit(n,k) (((n)>>(k))&1)
#define Add(x,y) x=(x+y)%mod
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first
#include "gap.h"

const int N=1e6+99,inf=1e18;

int n;
/*
pair<int,int> get(int l,int r){
	int mn,mx;
	MinMax(l,r,&mn,&mx);
	return {mn,mx};
}*/
ll findGap(int T, int _n){
	return 0;
/*	n=_n;
	if(T==2) return 0;
	vector<int> A;
	vector<int> B;
	pair<int,int> last=get(1,inf);
	A.pb(last.F);
	B.pb(last.S);
	f(i,0,(n-1)/2){
		pair<int,int> now=get(last.F+1,last.S-1);
		A.pb(now.F);
		B.pb(now.S);
	}
	int ans=0;
	f(i,1,A.size()) maxm(ans,abs(A[i]-A[i-1]));
	f(i,1,B.size()) maxm(ans,abs(B[i]-B[i-1]));
	maxm(ans,abs(A.back()-B.back()));
	return ans;*/
}
/*
int32_t main(){
}
*/

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

gap.cpp:24:24: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   24 | const int N=1e6+99,inf=1e18;
      |                        ^~~~

• Subtask 1: 0 / 30
• Subtask 2: 0 / 70