Submission #625171

#	Time	Username	Problem	Language	Result	Execution time	Memory
625171		PoonYaPat	Gap (APIO16_gap)	C++14	100 / 100	56 ms	3252 KiB

gap

#include "gap.h"


#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;

vector<pll> v;
vector<ll> k;
ll mx,mn,ans;

ll findGap(int T, int n) {
    if (T==1) {
        ll l=0, r=1e18;
        while (k.size()<n) {
            MinMax(l,r,&mn,&mx);
            if (mn==mx) k.push_back(mn);
            else {
                k.push_back(mn);
                k.push_back(mx);
            }
            l=mn+1; r=mx-1;
        }
        sort(k.begin(),k.end());
        for (int i=1; i<k.size(); ++i) ans=max(ans,k[i]-k[i-1]);
    } else {
        MinMax(0,1e18,&mn,&mx);
        ll mmin=mn,mmax=mx;
        v.push_back(pll(mn,mn));

        ll wide=(mx-mn+n-2)/(n-1);

        for (int i=0; i<n-1; ++i) {
            if (mmin+1+wide*i > min(mmin+wide*(i+1),mmax-1)) break;
            MinMax(mmin+1+wide*i,min(mmin+wide*(i+1),mmax-1),&mn,&mx);
            if (mn!=-1) v.push_back(pll(mn,mx));
        }

        v.push_back(pll(mmax,mmax));

        for (int i=1; i<v.size(); ++i) ans=max(ans,v[i].first-v[i-1].second);
    }
    return ans;
}

Compilation message (stderr)

gap.cpp: In function 'll findGap(int, int)':
gap.cpp:16:24: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   16 |         while (k.size()<n) {
      |                ~~~~~~~~^~
gap.cpp:26:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |         for (int i=1; i<k.size(); ++i) ans=max(ans,k[i]-k[i-1]);
      |                       ~^~~~~~~~~
gap.cpp:42:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |         for (int i=1; i<v.size(); ++i) ans=max(ans,v[i].first-v[i-1].second);
      |                       ~^~~~~~~~~

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