제출 #1262819

#제출 시각아이디문제언어결과실행 시간메모리
1262819yf_yusufGap (APIO16_gap)C++20
컴파일 에러
0 ms0 KiB
#include "gap.h" //```// YF YUSUF #define YF ios_base::sync_with_stdio(0);cout.setf(ios::fixed); #define YUSUF cout.precision(0);cout.tie(0);cin.tie(0); // #include <bits/stdc++.h> #include <iostream> #include <vector> #include <set> #include <map> #include <algorithm> #include <cmath> #include <numeric> #include <queue> #include <stack> #include <cassert> #include <climits> #include <string> #include <cstdlib> #include <random> #include <ctime> using namespace std; #ifdef YF_CHECK bool Output=1; #else #pragma GCC optimize ("unroll-loops") #pragma GCC optimize ("inline") #pragma GCC optimize ("Ofast") #pragma GCC optimize ("O3") bool Output=0; #endif using ll = long long; using ld = long double; using sll = set <ll>; using vll = vector <ll>; using mll = map <ll,ll>; using pll = pair <ll,ll>; using vvl = vector <vll>; using vpll = vector <pll>; template<class T>T MIN(T&a,T b){a=min(a,b);return a;} template<class T>T MAX(T&a,T b){a=max(a,b);return a;} #define all(a) a.begin(),a.end() #define sgr v+v+1,(tl+tr)/2+1,tr #define sgl v+v,tl,(tl+tr)/2 #define pb push_back #define ins insert #define S second #define F first mt19937_64 MT(time(0)); ll BP(ll a,ll b,ll mod=1e9+7){ if(b==0)return 1; ll q=BP(a,b/2,mod); return ((q*q)%mod*(b%2?a:1ll))%mod; } ll f(ll x){return x*(x+1)/2;} ll dup(ll a,ll b){return (a+b-1)/b;} ll lcm(ll a,ll b){return a/__gcd(a,b)*b;} ll invf(ll x){return (-1+sqrt(1+8*x))/2;} const ll mod=998244353; const ll INF=1e18; const ll inf=1e9+7; const ll N =1e6+7; ll YF_SOLVE(ll n){ ll mn,mx; MinMax(0, (ll)(1e18), &mn, &mx); ll range = mx - mn; ll seg = (range + n - 1) / (n - 1); ll ans = seg, i = mn, last = mn, x, y; for(;i + seg < mx; i += seg - 1){ MinMax(i, i + seg, x, y); if(x != -1){ MAX(ans, x - last); last = y; } } MinMax(i, mx, x, y); if(x != -1)MAX(ans, x - last); cout<<ans; } ll YF_MAIN(ll n){ vll a(n+1); { ll l = 0ll, r = (1000000000000000000LL); MinMax(l, r, &a[1], &a[n]); } ll l=2,r=n-1; while(l<=r){ MinMax(a[l-1]+1, a[r+1]-1, &a[l], &a[r]); l++; r--; } ll mx = 0ll; for(int i=2;i<min(n+1, (ll)a.size());i++){ MAX(mx, a[i] - a[i-1]); } return mx; } ll lg(ll x){return (x ? 63 - __builtin_clzll(x) : -1);} const ll SN=2e0 + 7; ll SM[SN]; const ll FN=2e0 + 7; ll FACT[FN], inv[FN], FMOD=inf; ll PER(ll n,ll k){return FACT[n] *inv[n-k]%FMOD;} ll CNK(ll n,ll k){return PER(n,k)*inv[k ]%FMOD;} void BEFORE(){ for(ll i=2;i<SN;i++){ if(SM[i])continue; for(ll j=i;j<SN;j+=i) MAX(SM[j],i); } FACT[0]=inv[0]=1; for(int i=1;i<FN;i++){ FACT[i]=FACT[i-1]*i%FMOD; if(i<5e5+7)inv[i]=BP(FACT[i],FMOD-2,FMOD); } } ll findGap(int T, int N) { YF YUSUF return (T==1 ? YF_MAIN(N) : YF_SOLVE(N)); }

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

gap.cpp: In function 'll YF_SOLVE(ll)':
gap.cpp:69:36: error: invalid conversion from 'll' {aka 'long long int'} to 'long long int*' [-fpermissive]
   69 |                 MinMax(i, i + seg, x, y);
      |                                    ^
      |                                    |
      |                                    ll {aka long long int}
In file included from gap.cpp:1:
gap.h:1:35: note:   initializing argument 3 of 'void MinMax(long long int, long long int, long long int*, long long int*)'
    1 | void MinMax(long long, long long, long long*, long long*);
      |                                   ^~~~~~~~~~
gap.cpp:69:39: error: invalid conversion from 'll' {aka 'long long int'} to 'long long int*' [-fpermissive]
   69 |                 MinMax(i, i + seg, x, y);
      |                                       ^
      |                                       |
      |                                       ll {aka long long int}
In file included from gap.cpp:1:
gap.h:1:47: note:   initializing argument 4 of 'void MinMax(long long int, long long int, long long int*, long long int*)'
    1 | void MinMax(long long, long long, long long*, long long*);
      |                                               ^~~~~~~~~~
gap.cpp:75:23: error: invalid conversion from 'll' {aka 'long long int'} to 'long long int*' [-fpermissive]
   75 |         MinMax(i, mx, x, y);
      |                       ^
      |                       |
      |                       ll {aka long long int}
In file included from gap.cpp:1:
gap.h:1:35: note:   initializing argument 3 of 'void MinMax(long long int, long long int, long long int*, long long int*)'
    1 | void MinMax(long long, long long, long long*, long long*);
      |                                   ^~~~~~~~~~
gap.cpp:75:26: error: invalid conversion from 'll' {aka 'long long int'} to 'long long int*' [-fpermissive]
   75 |         MinMax(i, mx, x, y);
      |                          ^
      |                          |
      |                          ll {aka long long int}
In file included from gap.cpp:1:
gap.h:1:47: note:   initializing argument 4 of 'void MinMax(long long int, long long int, long long int*, long long int*)'
    1 | void MinMax(long long, long long, long long*, long long*);
      |                                               ^~~~~~~~~~
gap.cpp:78:1: warning: no return statement in function returning non-void [-Wreturn-type]
   78 | }
      | ^