답안 #337563

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
337563	2020-12-21T05:49:39 Z	BY_KUTBILIM	금 캐기 (IZhO14_divide)	C++14	17 / 100	1 ms	384 KB

divide

/** @BY_KUTBILIM **/
#include <bits/stdc++.h>
using namespace std;

#define ff first
#define ss second
#define pb push_back
#define ll long long

ll mn[100100];

int binsearch(int pos, int find){
    int l = 1, r = pos;
    while(l < r){
        int m = (l + r) / 2;
        if(mn[m] <= find){
            r = m;
        } else l = m + 1;
    }
    return r;
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie();

    int n;
    cin >> n;
    ll x[n+1], g[n+1], d[n+1];
    ll pg[n+1], pd[n+1];
    pg[0] = pd[0] = 0;
    ll ans = 0;
    for(int i = 1; i <= n; i++){
        cin >> x[i] >> g[i] >> d[i];
        pg[i] = pg[i-1] + g[i];
        pd[i] = pd[i-1] + d[i];
    }
    mn[0] = 1e18;
    for(int r = 1; r <= n; r++){
        mn[r] = min(mn[r-1], pd[r-1] - x[r]);
        
        int l = binsearch(r, pd[r] - x[r]);
        ans = max(ans, pg[r] - pg[l-1]);
        
    }
    
    cout << ans;
    
    return 0;
}

Subtask #1

17.0 / 17.0

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

Subtask #2

0 / 31.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	364 KB	Output is correct
2	Correct	1 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	0 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Incorrect	1 ms	384 KB	Output isn't correct
19	Halted	0 ms	0 KB	-

Subtask #3

0 / 52.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	364 KB	Output is correct
2	Correct	1 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	0 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Incorrect	1 ms	384 KB	Output isn't correct
19	Halted	0 ms	0 KB	-