Submission #705889

#	Time	Username	Problem	Language	Result	Execution time	Memory
705889		Alihan_8	Gap (APIO16_gap)	C++17	0 / 100	42 ms	1832 KiB

gap

#include <bits/stdc++.h>
#include "gap.h"
// include <ext/pb_ds/assoc_container.hpp>
// include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make_pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
//#define int long long
long long findGap(int T, int N){
    int n = N;
	if ( T == 1 ){
        long long Mn = 0, Mx = 1e18+1, l = 0, r = n-1;
        vector <long long> res(n);
        while ( l <= r ){
            MinMax(Mn+1, Mx-1, &Mn, &Mx);
            res[l] = Mn, res[r] = Mx;
            l++, r--;
        }
        Mx = 0;
        for ( int i = 0; i+1 < n; i++ ){
            Mx = max(Mx, res[i+1]-res[i]);
        }
        return Mx;
	}
	return 0;
}
#if false
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n; cin >> n;
    vector <int> p(n);
    for ( auto &i: p ) cin >> i;
    cout << findGap(0, n);

    cout << '\n';
/*
4
2 3 6 8
*/
}
#endif

Compilation message (stderr)

gap.cpp: In function 'void IO(std::string)':
gap.cpp:12:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
gap.cpp:12:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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