oj.uz

답안 #332119

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
332119 2020-12-01T13:57:18 Z Valera_Grinenko 금 캐기 (IZhO14_divide) C++17
0 / 100
 1 ms 364 KB 
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <unordered_map>
#include <iomanip>
#include <cmath>
#include <queue>
#include <bitset>
#include <numeric>
#include <array>
#include <cstring>
#include <random>
#include <chrono>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin())
typedef long long ll;
typedef long double ld;
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// template<class T>
// using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 1e5 + 42;
ll n, ans = 0;
ll pe[N], pg[N], st[(N << 2)];
void upd(int pos, ll x, int l, int r, int ti) {
  if(l == r) {
    st[ti] = x;
    return;
  }
  if(pos <= ((l + r) >> 1)) upd(pos, x, l, ((l + r) >> 1), (ti << 1));
  else upd(pos, x, ((l + r) >> 1) + 1, r, (ti << 1) + 1);
  st[ti] = max(st[(ti << 1)], st[(ti << 1) + 1]);
}
int fnd(ll x, int l, int r, int ti) {
  if(l == r) return l;
  if(st[(ti << 1)] >= x) return fnd(x, l, ((l + r) >> 1), (ti << 1));
  return fnd(x, ((l + r) >> 1) + 1, r, (ti << 1) + 1);
}
int main() {

  ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

  cin >> n;

  for(int i = 1; i <= n; i++) {
    ll x, g, e;
    cin >> x >> g >> e;
    pe[i] = pe[i - 1] + e;
    pg[i] = pg[i - 1] + g;
    upd(i, x - pe[i - 1], 1, n, 1);
    cout << x - pe[i - 1] << ' ' << x - pe[i] << endl;
    int pos = fnd(x - pe[i], 1, n, 1);
    ans = max(ans, pg[i] - pg[pos - 1]);
  }

  cout << ans;

  return 0;
}
/*

*/

Compilation message

divide.cpp:3: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    3 | #pragma GCC optimization ("unroll-loops")
      |

Subtask #1
0 / 17.0

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

Subtask #2
0 / 31.0

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

Subtask #3
0 / 52.0

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