oj.uz

답안 #654493

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
654493 2022-10-31T13:43:22 Z pauloamed 금 캐기 (IZhO14_divide) C++14
0 / 100
 1 ms 1108 KB 
#include<bits/stdc++.h>
using namespace std;

#define int long long

const int MAXN = 100000;

struct BIT{
  int n; vector<int> v;
  BIT(int m = 0):n(m + 2), v(vector<int>(n, INT_MAX)){}

  int query(int i){ int ans = INT_MAX;
    for(i++; i > 0; i -= i & (-i))
      ans = min(ans, v[i]);
    return ans;
  }

  void update(int i, int val){
    for(i++; i < n; i += i & (-i)) 
      v[i] = min(val, v[i]);
  }
};

BIT bit(MAXN);

int X[MAXN], G[MAXN], E[MAXN];

int idx(vector<int> &v, int x){
  int n = v.size();
  int id = lower_bound(v.begin(), v.end(), x) - v.begin();
  return n - 1 - id;
}

int32_t main(){
  int n; cin >> n;
  vector<int> vals;

  {
    int e_accu = 0;
    for(int i = 0; i < n; ++i){
      cin >> X[i] >> G[i] >> E[i];
      e_accu += E[i];
      int I = X[i] - e_accu;
      vals.push_back(I);
    }
  }

  vals.push_back(0);
  sort(vals.begin(), vals.end());
  vals.erase(unique(vals.begin(), vals.end()), vals.end());


  int e_accu = 0;
  int g_accu = 0;

  bit.update(idx(vals, 0), 0);

  int ans = INT_MIN;
  for(int i = 0; i < n; ++i){
    e_accu += E[i];
    g_accu += G[i];

    int Ival = X[i] - e_accu;
    int I = idx(vals, Ival);

    // cout << "Ival, I: " << Ival << " " << I << endl;

    bit.update(I, g_accu);
    int best = bit.query(I);

    // cout << "best: " << best << "\n";
    // cout << "g_accu: " << g_accu << endl;

    ans = max(ans, g_accu - best);
    ans = max(ans, G[i]);
  }
  cout << ans << "\n";
}

Subtask #1
0 / 17.0

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

Subtask #2
0 / 31.0

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

Subtask #3
0 / 52.0

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