oj.uz

답안 #742009

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
742009 2023-05-15T10:57:35 Z BidoTeima 금 캐기 (IZhO14_divide) C++17
100 / 100
 226 ms 25628 KB 
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
#include <fstream>
#include <string>
#include <random>
#include <chrono>
#include <memory.h>
using namespace std;
using ll = long long;
map<ll, int>idx{};
const int N = 2e5 + 3;
ll a[N];
ll st[4 * N];
void build(int l, int r, int node){
    if(l == r){
        st[node] = 1e18;
        return;
    }
    int mid = (l + r) >> 1;
    build(l, mid, 2 * node + 1);
    build(mid + 1, r, 2 * node + 2);
    st[node] = 1e18;
}
ll query(int ql, int qr, int l, int r, int node){
    if(r < ql || l > qr)
        return 1e18;
    if(ql <= l && r <= qr)
        return st[node];
    int mid = (l + r) >> 1;
    return min(query(ql, qr, l, mid, 2 * node + 1), query(ql, qr, mid + 1, r, 2 * node + 2));
}
void update(int idx, int l, int r, int node){
    if(idx<l||idx>r)
        return;
    if(l == r){
        st[node] = a[idx];
        return;
    }
    int mid = (l + r) >> 1;
    update(idx, l, mid, 2 * node + 1);
    update(idx, mid + 1, r, 2 * node + 2);
    st[node] = min(st[2 * node + 1], st[2 * node + 2]);
}
int main()
{         
    //freopen("divide.in", "r", stdin);
    //freopen("divide.out", "w", stdout);
    int n;
    cin>>n;
    vector<vector<ll>>arr;
    vector<ll> sorted; 
    ll pref = 0;
    for(int i = 0; i < n; i++){
        ll x,g,d;
        cin>>x>>g>>d;
        arr.push_back({x, g, d});
        sorted.push_back(x - pref);
        pref += d;
        sorted.push_back(x - pref);
    } 
    sort(sorted.begin(), sorted.end());
    for(int i = 0; i < (int)sorted.size(); i++){
        //cout<<sorted[i]<<' ';
        idx[sorted[i]] = i;
    }
    build(0, 2 * n - 1, 0);
    fill(a, a + N, 1e18);
    ll gold = 0, energy = 0, ans = 0;
    for(int i = 0; i < n; i++){
        ll x = arr[i][0], g = arr[i][1], d = arr[i][2];
        int ref = idx[x - energy];
        a[ref] = min(a[ref], gold);
        update(ref, 0, 2 * n - 1, 0);
        gold += g, energy += d;
        ref = idx[x - energy];
        //cout<<ref<<'\n';
        ans = max(ans, gold - query(ref, 2 * n - 1, 0, 2 * n - 1, 0));
    }
    cout<<ans<<'\n';
    return 0;
}

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Correct 1 ms 1876 KB Output is correct
4 Correct 1 ms 1876 KB Output is correct
5 Correct 1 ms 1876 KB Output is correct
6 Correct 1 ms 1876 KB Output is correct
7 Correct 1 ms 1876 KB Output is correct
8 Correct 1 ms 1876 KB Output is correct
9 Correct 1 ms 1876 KB Output is correct
10 Correct 1 ms 1876 KB Output is correct
11 Correct 1 ms 1876 KB Output is correct
12 Correct 1 ms 1876 KB Output is correct

Subtask #2
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Correct 1 ms 1876 KB Output is correct
4 Correct 1 ms 1876 KB Output is correct
5 Correct 1 ms 1876 KB Output is correct
6 Correct 1 ms 1876 KB Output is correct
7 Correct 1 ms 1876 KB Output is correct
8 Correct 1 ms 1876 KB Output is correct
9 Correct 1 ms 1876 KB Output is correct
10 Correct 1 ms 1876 KB Output is correct
11 Correct 1 ms 1876 KB Output is correct
12 Correct 1 ms 1876 KB Output is correct
13 Correct 1 ms 1876 KB Output is correct
14 Correct 1 ms 1876 KB Output is correct
15 Correct 2 ms 1876 KB Output is correct
16 Correct 2 ms 2004 KB Output is correct
17 Correct 2 ms 2004 KB Output is correct
18 Correct 3 ms 2132 KB Output is correct
19 Correct 2 ms 2004 KB Output is correct
20 Correct 3 ms 2004 KB Output is correct
21 Correct 4 ms 2260 KB Output is correct
22 Correct 4 ms 2304 KB Output is correct
23 Correct 9 ms 3092 KB Output is correct
24 Correct 10 ms 3092 KB Output is correct

Subtask #3
52.0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Correct 1 ms 1876 KB Output is correct
4 Correct 1 ms 1876 KB Output is correct
5 Correct 1 ms 1876 KB Output is correct
6 Correct 1 ms 1876 KB Output is correct
7 Correct 1 ms 1876 KB Output is correct
8 Correct 1 ms 1876 KB Output is correct
9 Correct 1 ms 1876 KB Output is correct
10 Correct 1 ms 1876 KB Output is correct
11 Correct 1 ms 1876 KB Output is correct
12 Correct 1 ms 1876 KB Output is correct
13 Correct 1 ms 1876 KB Output is correct
14 Correct 1 ms 1876 KB Output is correct
15 Correct 2 ms 1876 KB Output is correct
16 Correct 2 ms 2004 KB Output is correct
17 Correct 2 ms 2004 KB Output is correct
18 Correct 3 ms 2132 KB Output is correct
19 Correct 2 ms 2004 KB Output is correct
20 Correct 3 ms 2004 KB Output is correct
21 Correct 4 ms 2260 KB Output is correct
22 Correct 4 ms 2304 KB Output is correct
23 Correct 9 ms 3092 KB Output is correct
24 Correct 10 ms 3092 KB Output is correct
25 Correct 8 ms 3092 KB Output is correct
26 Correct 15 ms 4324 KB Output is correct
27 Correct 17 ms 4316 KB Output is correct
28 Correct 87 ms 13688 KB Output is correct
29 Correct 98 ms 13728 KB Output is correct
30 Correct 226 ms 25628 KB Output is correct
31 Correct 181 ms 25544 KB Output is correct
32 Correct 179 ms 25512 KB Output is correct
33 Correct 175 ms 25512 KB Output is correct
34 Correct 176 ms 25000 KB Output is correct
35 Correct 188 ms 25548 KB Output is correct
36 Correct 187 ms 25484 KB Output is correct