제출 #551703

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
551703		hoanghq2004	Gap (APIO16_gap)	C++14	30 / 100	43 ms	1876 KiB

gap

#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include "gap.h"

using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;

mt19937 gen(std :: chrono :: system_clock :: now().time_since_epoch().count());

long long a[1000010];

long long findGap(int T, int n) {
    long long L = 0, R = 1e18;
    int lhs = 1, rhs = n;
    while (lhs <= rhs) {
        long long temp1 = 0, temp2 = 0;
        long long *nL = &temp1, *nR = &temp2;
        MinMax(L, R, nL, nR);
        L = *nL, R = *nR;
        a[lhs] = L, a[rhs] = R;
        ++L, --R;
        ++lhs, --rhs;
    }
    long long ans = 0;
    for (int i = 1; i < n; ++i) ans = max(ans, a[i + 1] - a[i]);
    return ans;
}

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