제출 #852073

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
852073		8pete8	Gap (APIO16_gap)	C++17	0 / 100	39 ms	4696 KiB

gap

#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<unordered_map>
#include <queue>
#include<cstring>
#include<limits.h>
#include<cmath>
#include<set>
#include<algorithm>
#include<bitset>
#include "gap.h"
using namespace std;
#define ll long long
#define f first
#define endl "\n"
//#define s second
#define pii pair<int,int>
#define ppii pair<int,pii>
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
using namespace std;
#define ll long long
const int mxn=1e5,mod=1000000007,lg=20,root=1000,inf=1e18;
ll findGap(int T,int N){
    ll mn,mx;
    ll ans=0;
    ll lmn=1,lmx=1e18;
    if(T==1){
        vector<ll>v;
        for(int i=0;i<(N+1)/2;i++){
            MinMax(lmn,lmx,&mn,&mx);
            v.pb(mn);
            v.pb(mx);
            lmn=mn+1;
            lmx=mx-1;
        }
        sort(all(v));
        for(int i=1;i<N;i++)ans=max(ans,v[i]-v[i-1]);
        return ans;
    }
    ans=((mx-mn-1)+(N-2))/(N-2);//min max gap
    int add=0,cur=mn;
    for(int i=0;i<N;i++){
        MinMax(cur+1,cur+ans,&mn,&mx);
        if(mn==-1)add+=(ans);
        else cur=mx,ans=max(ans,add+(mn-cur));
    }
    return ans;
}

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

gap.cpp:30:54: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   30 | const int mxn=1e5,mod=1000000007,lg=20,root=1000,inf=1e18;
      |                                                      ^~~~
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:48:13: warning: 'mx' may be used uninitialized in this function [-Wmaybe-uninitialized]
   48 |     ans=((mx-mn-1)+(N-2))/(N-2);//min max gap
      |           ~~^~~
gap.cpp:48:13: warning: 'mn' may be used uninitialized in this function [-Wmaybe-uninitialized]

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