제출 #400562

#제출 시각아이디문제언어결과실행 시간메모리
400562A_DGap (APIO16_gap)C++14
0 / 100
54 ms2336 KiB
#include "gap.h"

#include <bits/stdc++.h>
#define ii pair<int,int>
#define F first
#define S second
#define du long double
#define ll long long
using namespace std;
vector<ll> vec;
long long findGap(int T, int N)
{
    ll l=0,r=1e18;
    ll l2=0,r2=1e18;
    ll *l1=&l2;
    ll *r1=&r2;
    while(l<r){
        MinMax(l,r,l1,r1);
        vec.push_back(l2);
        vec.push_back(r2);
        l2++;
        r2--;
        l=l2;
        r=r2;
    }
    sort(vec.begin(),vec.end());
    ll ans=0;
    for(ll i=1;i<vec.size();i++)ans=max((ll)ans,(ll)vec[i]-vec[i-1]);
    return ans;
}

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

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:28:17: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |     for(ll i=1;i<vec.size();i++)ans=max((ll)ans,(ll)vec[i]-vec[i-1]);
      |                ~^~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...