제출 #1227005

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1227005		icebear	Triple Jump (JOI19_jumps)	C++20	100 / 100	816 ms	69916 KiB

jumps

// ~~ icebear ~~
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;

template<class T>
    bool minimize(T &a, const T &b) {
        if (a > b) return a = b, true;
        return false;
    }

template<class T>
    bool maximize(T &a, const T &b) {
        if (a < b) return a = b, true;
        return false;
    }

#define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
#define FORR(i,a,b) for(int i=(a); i>=(b); --i)
#define REP(i, n) for(int i=0; i<(n); ++i)
#define RED(i, n) for(int i=(n)-1; i>=0; --i)
#define MASK(i) (1LL << (i))
#define BIT(S, i) (((S) >> (i)) & 1)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define task "icebear"

const int MOD = 1e9 + 7;
const int inf = 1e9 + 27092008;
const ll INF = 1e18 + 27092008;
const int N = 5e5 + 5;
int n, q, a[N];
vector<ii> Q[N];
ll ans[N];

struct Node {
    int maxA, lazy;
    ll maxSum;

    Node(int _maxA = 0, int _lazy = 0, ll _maxSum = 0):
        maxA(_maxA), lazy(_lazy), maxSum(_maxSum) {}

    friend Node combine(const Node &L, const Node &R) {
        Node res;
        res.maxA = max(L.maxA, R.maxA);
        res.maxSum = max(L.maxSum, R.maxSum);
        return res;
    }
} node[N << 2];

void build(int id, int l, int r) {
    if (l == r) {
        node[id] = Node(a[l], 0, a[l]);
        return;
    }
    int mid = (l + r) >> 1;
    build(id << 1, l, mid);
    build(id << 1 | 1, mid + 1, r);
    node[id] = combine(node[id << 1], node[id << 1 | 1]);
}

void modify(int id, int lazy) {
    maximize(node[id].maxSum, (ll)node[id].maxA + lazy);
    maximize(node[id].lazy, lazy);
}

void pushDown(int id) {
    if (node[id].lazy) {
        modify(id << 1, node[id].lazy);
        modify(id << 1 | 1, node[id].lazy);
        node[id].lazy = 0;
    }
}

void update(int id, int l, int r, int u, int v, int k) {
    if (l > v || r < u) return;
    if (u <= l && r <= v) {
        modify(id, k);
        return;
    }
    pushDown(id);
    int mid = (l + r) >> 1;
    update(id << 1, l, mid, u, v, k);
    update(id << 1 | 1, mid + 1, r, u, v, k);
    node[id] = combine(node[id << 1], node[id << 1 | 1]);
}

Node getAns(int id, int l, int r, int u, int v) {
    if (l > v || r < u) return Node();
    if (u <= l && r <= v) return node[id];
    pushDown(id);
    int mid = (l + r) >> 1;
    return combine(getAns(id << 1, l, mid, u, v), getAns(id << 1 | 1, mid + 1, r, u, v));
}

void init(void) {
    cin >> n;
    FOR(i, 1, n) cin >> a[i];
    cin >> q;
    FOR(i, 1, q) {
        int l, r;
        cin >> l >> r;
        Q[l].pb(mp(r, i));
    }
}

void process(void) {
    stack<int> candidates;
    build(1, 1, n);
    FORR(i, n, 1) {
        while(!candidates.empty()) {
            int y = candidates.top();
            if (2 * y - i <= n) update(1, 1, n, 2 * y - i, n, a[i] + a[y]);
            if (a[i] < a[y]) break;
            candidates.pop();
        }
        candidates.push(i);

        for(ii query : Q[i])
            ans[query.se] = getAns(1, 1, n, i, query.fi).maxSum;
    }

    FOR(i, 1, q) cout << ans[i] << '\n';
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    if (fopen(task".inp", "r")) {
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    int tc = 1;
//    cin >> tc;
    while(tc--) {
        init();
        process();
    }
    return 0;
}

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

jumps.cpp: In function 'int main()':
jumps.cpp:136:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  136 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
jumps.cpp:137:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  137 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 5 / 5
• Subtask 2: 14 / 14
• Subtask 3: 27 / 27
• Subtask 4: 54 / 54