oj.uz

답안 #775799

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
775799 2023-07-07T02:56:21 Z anha3k25cvp 금 캐기 (IZhO14_divide) C++14
100 / 100
 41 ms 8792 KB 
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define dl double
#define st first
#define nd second
#define II pair <int, int>

using namespace std;

const int N = 5 + 1e5;
const ll inf = 7 + 1e18;

struct Fenwick {
    int n;
    vector <ll> tree;
    Fenwick (int _n = 0) : n(_n) {
        tree.assign(n + 1, inf);
    }
    void update(int x, ll val) {
        for (int i = x; i <= n; i += i & -i)
            tree[i] = min(tree[i], val);
    }
    ll get(int x) {
        ll ans = inf;
        for (int i = x; i > 0; i -= i & -i)
            ans = min(ans, tree[i]);
        return ans;
    }
};

vector <ll> x, g, d, c;

int main() {
#define TASKNAME ""
    ios_base :: sync_with_stdio (0);
    cin.tie (0);
    if ( fopen( TASKNAME".inp", "r" ) ) {
        freopen (TASKNAME".inp", "r", stdin);
        freopen (TASKNAME".out", "w", stdout);
    }
    int n;
    cin >> n;
    x.assign(n + 1, 0);
    g.assign(n + 1, 0);
    d.assign(n + 1, 0);
    ll ans = 0;
    for (int i = 1; i <= n; i ++) {
        cin >> x[i] >> g[i] >> d[i];
        ans = max(ans, g[i]);
        g[i] += g[i - 1];
        d[i] += d[i - 1];
        c.push_back(d[i] - x[i]);
        c.push_back(d[i - 1] - x[i]);
    }
    sort(c.begin(), c.end());
    c.resize(unique(c.begin(), c.end()) - c.begin());
    Fenwick f(c.size());
    for (int i = 1; i <= n; i ++) {
        int val = lower_bound(c.begin(), c.end(), d[i] - x[i]) - c.begin() + 1;
        ans = max(ans, g[i] - f.get(val));
        val = lower_bound(c.begin(), c.end(), d[i - 1] - x[i]) - c.begin() + 1;
        f.update(val, g[i - 1]);
    }
    cout << ans;
    return 0;
}

Compilation message

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

Subtask #1
17.0 / 17.0

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

Subtask #2
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 316 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 472 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 2 ms 724 KB Output is correct
24 Correct 2 ms 696 KB Output is correct

Subtask #3
52.0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 316 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 472 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 2 ms 724 KB Output is correct
24 Correct 2 ms 696 KB Output is correct
25 Correct 2 ms 596 KB Output is correct
26 Correct 4 ms 1104 KB Output is correct
27 Correct 4 ms 1108 KB Output is correct
28 Correct 18 ms 4144 KB Output is correct
29 Correct 20 ms 4432 KB Output is correct
30 Correct 41 ms 8792 KB Output is correct
31 Correct 36 ms 7616 KB Output is correct
32 Correct 36 ms 7740 KB Output is correct
33 Correct 41 ms 7560 KB Output is correct
34 Correct 38 ms 7400 KB Output is correct
35 Correct 37 ms 8008 KB Output is correct
36 Correct 37 ms 8128 KB Output is correct