oj.uz

Submission #530909

# Submission time Handle Problem Language Result Execution time Memory
530909 2022-02-27T05:24:33 Z Evang Happiness (Balkan15_HAPPINESS) C++17
60 / 100
 987 ms 524292 KB 
#include <bits/extc++.h>
#include "happiness.h"
using namespace std;
using namespace __gnu_pbds;

#ifdef _DEBUG
#define dout(x) clog << "Line " << __LINE__ << ": " << #x << "=" << (x) << el
#else
#define dout(x)
#endif

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define uid(a,b) uniform_int_distribution<int>(a,b)(rng)

#define ins insert
#define ssize(x) (int((x).size()))
#define bs(args...) binary_search(args)
#define lb(args...) lower_bound(args)
#define ub(args...) upper_bound(args)
#define all(x) (x).begin(),(x).end()
#define mp(a, b) make_pair(a, b)
#define mt(args...) make_tuple(args)
#define pb(x) push_back(x)
#define eb(args...) emplace_back(args)
#define ff first
#define ss second
#define die exit(0)

template<typename T>
using vc = vector<T>;
template<typename T>
using uset = unordered_set<T>;
template<typename A, typename B>
using umap = unordered_map<A, B>;
template<typename T, typename Comp>
using pq = std::priority_queue<T, vc<T>, Comp>;
template<typename T>
using maxpq = pq<T, less<T>>;
template<typename T>
using minpq = pq<T, greater<T>>;
template<typename T>
using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

using db = double;
using ld = long double;
using ll = long long;
using ull = unsigned long long;
using pi = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vc<int>;
using vll = vc<ll>;
using vpi = vc<pi>;
using vpll = vc<pll>;
using str = string;

constexpr char el = '\n';
constexpr char sp = ' ';
constexpr int inf = 0x3f3f3f3f;
constexpr ll llinf = 0x3f3f3f3f3f3f3f3fLL;
// ---------------------------------------------------------------------


struct node {
  ll x, sum;
  node *left=nullptr, *right=nullptr, *parent=nullptr;
  node *l() {
    if(left==nullptr) {
      left = new node;
      left->parent = this;
    }
    return left;
  }
  node *r(){
    if(right==nullptr) {
      right = new node;
      right->parent = this;
    }
    return right;
  }
};
static node *root = new node;

static void upd(ll a, int d){
  ll l = 1, r = 1ll << 40;
  node *v = root;
  while(l<r){
    ll im = (l+r)/2;
    if(a <= im){
      v = v->l();
      r = im;
    }else{
      v = v->r();
      l = im+1;
    }
  }

  v->sum += a*d;
  if(v->sum>0)
    v->x = a-1;
  else
    v->x = 0;
  while(v->parent!=nullptr){
    v = v->parent;
    v->x = max({0ll, v->l()->x, v->r()->x-v->l()->sum});
    v->sum = v->l()->sum + v->r()->sum;
  }
}

bool happy(){
  return root->x == 0;
}

bool init(int n, ll _, ll a[]){
  for(int i = 0; i < n; ++i)
    upd(a[i], 1);
  return happy();
}

bool is_happy(int d, int n, ll a[]){
  for(int i = 0; i < n; ++i)
    upd(a[i], d);
  return happy();
}

#ifdef _DEBUG
signed main(){
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);

  ll a[] = {4, 8, 1, 2, 16};
  cout << init(5, 100, a) << el;
  ll b[] = {2, 8};
  cout << is_happy(-1, 2, b) << el;
  ll c[] = {7, 9, 2};
  cout << is_happy(1, 3, c) << el;
}
#endif

Compilation message

grader.cpp: In function 'int main()':
grader.cpp:16:12: warning: unused variable 'max_code' [-Wunused-variable]
   16 |  long long max_code;
      |            ^~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 3 ms 3264 KB Output is correct
7 Correct 4 ms 3516 KB Output is correct
8 Correct 36 ms 26652 KB Output is correct
9 Correct 35 ms 26820 KB Output is correct
10 Correct 32 ms 25880 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 376 ms 53420 KB Output is correct
7 Correct 365 ms 52784 KB Output is correct
8 Correct 384 ms 53420 KB Output is correct
9 Correct 595 ms 66532 KB Output is correct
10 Correct 621 ms 70804 KB Output is correct
11 Correct 231 ms 37212 KB Output is correct
12 Correct 222 ms 37188 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 3 ms 3264 KB Output is correct
7 Correct 4 ms 3516 KB Output is correct
8 Correct 36 ms 26652 KB Output is correct
9 Correct 35 ms 26820 KB Output is correct
10 Correct 32 ms 25880 KB Output is correct
11 Correct 376 ms 53420 KB Output is correct
12 Correct 365 ms 52784 KB Output is correct
13 Correct 384 ms 53420 KB Output is correct
14 Correct 595 ms 66532 KB Output is correct
15 Correct 621 ms 70804 KB Output is correct
16 Correct 231 ms 37212 KB Output is correct
17 Correct 222 ms 37188 KB Output is correct
18 Correct 901 ms 425428 KB Output is correct
19 Correct 904 ms 442208 KB Output is correct
20 Runtime error 987 ms 524292 KB Execution killed with signal 9
21 Halted 0 ms 0 KB -