Submission #1281047

#	Time	Username	Problem	Language	Result	Execution time	Memory
1281047		SoMotThanhXuan	Gap (APIO16_gap)	C++20	30 / 100	29 ms	3232 KiB

gap

#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define FOR(i, a, b) for(int i = (a), _b = (b); i <= _b; ++i)
#define REP(i, a, b) for(int i = (a), _b = (b); i >= _b; --i)
#define mp make_pair
#define all(v) v.begin(), v.end()
#define uni(v) v.erase(unique(all(v)), v.end())
#define Bit(x, i) ((x >> (i)) & 1)
#define Mask(i) (1 << (i))
#define Cnt(x) __builtin_popcount(x)
#define Cntll(x) __builtin_popcountll(x)
#define Ctz(x) __builtin_ctz(x)
#define Ctzll(x) __builtin_ctzll(x)
#define Clz(x) __builtin_clz(x)
#define Clzll(x) __builtin_clzll(x)
#define left __left
#define down __down
#define right __right
#define up __up
inline bool maximize(int &u, int v){ return v > u ? u = v, true : false; }
inline bool minimize(int &u, int v){ return v < u ? u = v, true : false; }
inline bool maximizell(long long &u, long long v){ return v > u ? u = v, true : false; }
inline bool minimizell(long long &u, long long v){ return v < u ? u = v, true : false; }
const int mod = 1e9 + 7;
inline int fastPow(int a, int n){
    if(n == 0) return 1;
    int t = fastPow(a, n >> 1);
    t = 1ll * t * t % mod;
    if(n & 1) t = 1ll * t * a % mod;
    return t;
}
inline void add(int &u, int v){ u += v; if(u >= mod) u -= mod; }
inline void sub(int &u, int v){ u -= v; if(u < 0) u += mod; }
const int maxN = 1e5 + 5;
const int inf = 1e9;
const long long infll = 1e18;
int n;
//long long a[maxN];
//void MinMax(long long S, long long T, long long *mn, long long *mx){
//    int l = lower_bound(a + 1, a + 1 + n, S) - a;
//    int r = upper_bound(a + 1, a + 1 + n, T) - a;
//    --r;
//    assert(l <= r);
//    *mn = a[l];
//    *mx = a[r];
//    return;
//}
long long b[maxN];
long long MAX = 1e18;
namespace subtask1{
    long long solve(){
        long long answer = -infll;
        MinMax(0, MAX, b + 1, b + n);
        FOR(i, 2, (n + 1) / 2){
            MinMax(*(b + i - 1) + 1, *(b + n - i + 2) - 1, b + i, b + n - i + 1);
        }
        FOR(i, 1, n - 1)maximizell(answer, b[i + 1] - b[i]);
//        FOR(i, 1, n)cout << b[i] << ' ';cout << '\n';
        return answer;
    }
}
long long findGap(int T, int N){
    n = N;
    return subtask1 :: solve();
	return 0;
}
//void process(){
//    int n, t;
//    cin >> t >> n;
//    FOR(i, 1, n)cin >> a[i];
//    cout << findGap(t, n);
//}
//#define LOVE "code"
//int main(){
////    if(fopen(LOVE".inp", "r")){
////        freopen(LOVE".inp", "r", stdin);
//////        freopen(LOVE".out", "w", stdout);
////    }
//    ios_base::sync_with_stdio(false);
//    cin.tie(0);
//    cout.tie(0);
//
//    int t = 1;
////    cin >> t;
//    while(t--)
//        process();
////    cerr << '\n' << "Time elapsed: " << (1.0 * clock() / CLOCKS_PER_SEC) << " s\n" ;
//    return 0;
//}
//
//

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