제출 #899672

#제출 시각아이디문제언어결과실행 시간메모리
899672trMatherzHappiness (Balkan15_HAPPINESS)C++17
컴파일 에러
0 ms0 KiB
//#include <iostream> //cin, cout #include "happiness.h" /* #include <fstream> std::ifstream cin ("ex.in"); std::ofstream cout ("ex.out"); */ // includes #include <cmath> #include <set> #include <map> #include <queue> #include <string> #include <vector> #include <array> #include <algorithm> #include <numeric> #include <iomanip> #include <unordered_set> #include <stack> #include <ext/pb_ds/assoc_container.hpp> #include <random> #include <chrono> //usings using namespace std; using namespace __gnu_pbds; // misc #define ll long long #define pb push_back #define pq priority_queue #define ub upper_bound #define lb lower_bound template<typename T, typename U> bool emin(T &a, const U &b){ return b < a ? a = b, true : false; } template<typename T, typename U> bool emax(T &a, const U &b){ return b > a ? a = b, true : false; } typedef uint64_t hash_t; // vectors #define vi vector<int> #define vvi vector<vi> #define vvvi vector<vvi> #define vpii vector<pair<int, int>> #define vvpii vector<vector<pair<int, int>>> #define vppipi vector<pair<int, pair<int, int>>> #define vl vector<ll> #define vvl vector<vl> #define vvvl vector<vvl> #define vpll vector<pair<ll, ll>> #define vb vector<bool> #define vvb vector<vb> #define vs vector<string> #define sz(x) (int)x.size() #define rz(x,y) x.resize(y) #define all(x) x.begin(), x.end() // pairs #define pii pair<int, int> #define pll pair<ll, ll> #define mp make_pair #define f first #define s second // sets #define si set<int> #define sl set<ll> #define ss set<string> #define in insert template <class T> using iset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; // maps #define mii map<int, int> #define mll map<ll, ll> // loops #define FR(x, z, y) for (int x = z; x < y; x++) #define FRe(x, z, y) FR(x, z, y + 1) #define F(x, y) FR(x, 0, y) #define Fe(x, y) F(x, y + 1) #define A(x, y) for(auto &x : y) struct Node { ll l, r, v = 0; Node *lc = nullptr, *rc = nullptr; Node(ll tl, ll tr) : l(tl), r(tr) {} void expand(){ if(!lc && l != r){ lc = new Node(l, (l + r) / 2); rc = new Node((l + r) / 2 + 1, r); } } void put(ll x, ll z){ if(r < x || x < l) return; if(l == r && l == x) {v = z; return;} expand(); v = lc->v + rc->v; } ll get(ll x, ll y){ if(r < x || l > y) return 0; if(x <= l && r <= y) return v; expand(); return lc->v + rc->v; } }; Node root = null; bool check(){ ll cur = 1, ma = root.v; while(cur < ma){ ll t = root.get(0, cur); if(t < cur) return false; cur = t + 1; } return true; } bool init(int coinsCount, long long maxCoinSize, long long coins[]){ Node root = new Node(0, maxCoinSize - 1); F(i, coinsCount) root.put(coins[i] - 1, coins[i]); return check(); } bool is_happy(int event, int coinsCount, long long coins[]){ F(i, coinsCount) root.put(coins[i] - 1, event * coins[i]); return check(); }

컴파일 시 표준 에러 (stderr) 메시지

happiness.cpp:116:13: error: 'null' was not declared in this scope
  116 | Node root = null;
      |             ^~~~
happiness.cpp: In function 'bool init(int, long long int, long long int*)':
happiness.cpp:128:17: error: conversion from 'Node*' to non-scalar type 'Node' requested
  128 |     Node root = new Node(0, maxCoinSize - 1);
      |                 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
grader.cpp: In function 'int main()':
grader.cpp:16:12: warning: unused variable 'max_code' [-Wunused-variable]
   16 |  long long max_code;
      |            ^~~~~~~~