## Submission #1041301

# Submission time Handle Problem Language Result Execution time Memory
1041301 2024-08-01T20:35:51 Z ssense Happiness (Balkan15_HAPPINESS) C++14
0 / 100
0 ms 348 KB
```#include <iostream>
#include "happiness.h"
#include <algorithm>
#include <vector>
#include <array>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <chrono>
#include <random>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <iomanip>
#include <bitset>
#include <limits.h>
#include <cassert>

#define fr first
#define sc second

using namespace std;

#define int long long

struct Tree
{
int left, right;
int sum = 0, mare = 0;
Tree *leftc = nullptr, *rightc = nullptr;
Tree(int l, int r)
{
left = l; right = r;
}
void extend()
{
if(!leftc && left < right)
{
int mid = left+right>>1;
leftc = new Tree(left, mid);
rightc = new Tree(mid+1, right);
}
}
{
extend();
if(left > pos || right < pos)
{
return;
}
if(left == right)
{
sum+=val;
if(sum == 0)
{
mare = 0;
}
else
{
mare = val;
}
return;
}
sum = leftc->sum+rightc->sum;
mare = max(leftc->mare, rightc->mare-leftc->sum);
}
};

Tree base(1, 1000000000001);

bool init(int32_t coinCount, int maxCoinSize, int coins[])
{
for(int i = 0; i < coinCount; i++)
{
}
if(base.mare > 1)
{
return false;
}
return true;
}

bool is_happy(int32_t event, int32_t coinCount, int coins[])
{
for(int i = 0; i < coinCount; i++)
{
}
if(base.mare > 1)
{
return false;
}
return true;
}
/*
int32_t main()
{
int32_t n;
int s;
cin >> n >> s;
int c[n];
for(int i = 0; i < n; i++)
{
cin >> c[i];
}
if(init(n, s, c))
{
cout << "HAPPY" << endl;
}
else
{
}
int q;
cin >> q;
while(q--)
{
int32_t nn, event;
cin >> nn >> event;
int cc[nn];
for(int i = 0; i < nn; i++)
{
cin >> cc[i];
}
if(is_happy(event, nn, cc))
{
cout << "HAPPY" << endl;
}
else
{
}
}
}
*/
/*
5 100
4 8 1 2 16
2
2 -1
2 8
3 1
7 9 2
*/
/*
#include <iostream>
#include <algorithm>
#include <vector>
#include <array>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <chrono>
#include <random>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <iomanip>
#include <bitset>
#include <cassert>
*/```

### Compilation message

```happiness.cpp: In member function 'void Tree::extend()':
happiness.cpp:42:27: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
42 |             int mid = left+right>>1;
|                       ~~~~^~~~~~
grader.cpp:16:12: warning: unused variable 'max_code' [-Wunused-variable]
16 |  long long max_code;
|            ^~~~~~~~```

#### Subtask #1 0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

#### Subtask #2 0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

#### Subtask #3 0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

#### Subtask #4 0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -