oj.uz

답안 #1051963

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1051963 2024-08-10T10:49:19 Z vjudge1 금 캐기 (IZhO14_divide) C++17
48 / 100
 21 ms 16484 KB 
#include <bits/stdc++.h>
using namespace std;

#define SPEED ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define str string
#define pb push_back
#define pf push_front
#define nl "\n"
#define ll long long
#define int long long
#define all(v) (v).begin() , (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define ff first
#define ss second
#define len(a) a.size()
#define pii pair<int,int>
const int N = 3e6 + 1;
const ll md = 998244353;
const ll mod = 1e9 + 7;
const ll mega = 1e6 + 3;
const ll inf = 100100;
int x[N] , g[N] , d[N] , pref[N] , pref2[N] ,n , ans , mx;
void add(int l){
    ans += d[l];
}
void del(int l){
    ans -= d[l];
}
void solve() {
    cin >> n;
    for(int i = 1; i <= n; ++i){
        cin >> x[i] >> g[i] >> d[i];
        pref[i] = pref[i - 1] + d[i];
        pref2[i] = pref2[i - 1] + g[i];
    }
    int mx = 0;
    if(n <= 5000){
        for(int i = 1; i <= n; ++i){
            for(int j = i; j <= n; ++j){
                if(x[j] - x[i] <= pref[j] - pref[i - 1]){
                    mx = max(mx , pref2[j] - pref2[i - 1]);
                }
            }
        }
        cout << mx;
    }
    else{
        for(int i = 1; i <= n; ++i){
            int l = i , r = n;
            while(l <= r){
                int m = (l + r) / 2;
                if(pref[m] - pref[i - 1] >= x[m] - x[i]){
                    l = m + 1;
                    mx = max(mx , pref2[m] - pref2[i - 1]);
                }
                else{
                    r = m - 1;
                }
            }
        }
        cout << mx;
    }
}
signed main() {
    SPEED;
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
    // #ifndef ONLINE_JUDGE
    // cerr << "\n" << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
    // #endif
    // return 0;
}

Subtask #1
17.0 / 17.0

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

Subtask #2
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 0 ms 6612 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 0 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 0 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6608 KB Output is correct
13 Correct 1 ms 6488 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 2 ms 6492 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 2 ms 6492 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 2 ms 6492 KB Output is correct
23 Correct 8 ms 6712 KB Output is correct
24 Correct 8 ms 6704 KB Output is correct

Subtask #3
0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 0 ms 6612 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 0 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 0 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6608 KB Output is correct
13 Correct 1 ms 6488 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 2 ms 6492 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 2 ms 6492 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 2 ms 6492 KB Output is correct
23 Correct 8 ms 6712 KB Output is correct
24 Correct 8 ms 6704 KB Output is correct
25 Correct 9 ms 6492 KB Output is correct
26 Correct 2 ms 6748 KB Output is correct
27 Correct 2 ms 6748 KB Output is correct
28 Correct 9 ms 10076 KB Output is correct
29 Correct 9 ms 10360 KB Output is correct
30 Correct 19 ms 16484 KB Output is correct
31 Correct 15 ms 15452 KB Output is correct
32 Correct 21 ms 15440 KB Output is correct
33 Correct 15 ms 15196 KB Output is correct
34 Incorrect 15 ms 15164 KB Output isn't correct
35 Halted 0 ms 0 KB -