oj.uz

답안 #671414

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
671414 2022-12-13T04:28:40 Z Alihan_8 금 캐기 (IZhO14_divide) C++17
0 / 100
 1 ms 212 KB 
#include <bits/stdc++.h>
// include <ext/pb_ds/assoc_container.hpp>
// include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make_pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
#define int long long
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n; cin >> n;
    vector <int> x(n), g(n), d(n);
    for ( int i = 0; i < n; i++ ) cin >> x[i] >> g[i] >> d[i];
    vector <int> pref_g(n), pref_d(n);
    for ( int i = 0; i < n; i++ ){
        pref_g[i] = (i ? pref_g[i-1] : 0)+g[i];
        pref_d[i] = (i ? pref_d[i-1] : 0)+d[i];
    }
    int Mx = 0, j = n-1;
    while ( j >= 0 and pref_d[j] >= x[j]-x[0] ) j--;
    for ( int i = 0; i < n; i++ ){
        j = max(j, i);
        while ( j < n and x[j]-x[i] <= pref_d[j]-(i ? pref_d[i-1] : 0) ) j++;
        j--;
        Mx = max(Mx, pref_g[j]-(i ? pref_g[i-1] : 0));
    }
    cout << Mx;

    cout << '\n';
}

Compilation message

divide.cpp: In function 'void IO(std::string)':
divide.cpp:11:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
divide.cpp:11:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -