## Submission #100953

# Submission time Handle Problem Language Result Execution time Memory
100953 2019-03-15T11:48:44 Z shafinalam Growing Trees (BOI11_grow) C++14
0 / 100
1000 ms 5772 KB
```#include <bits/stdc++.h>

using namespace std;

const int mx = 1e5+5;
typedef long long ll;

#define  sf scanf
#define  pf printf

ll tree[mx<<2];
ll lazy[mx<<2];
ll arr[mx];
ll n, m;

void push(ll node, ll b,ll e)
{
if(lazy[node])
{
ll left = node<<1;
ll right = left|1;
tree[node]+=((e-b+1)*lazy[node]);
if(b!=e)
{
lazy[left]+=lazy[node];
lazy[right]+=lazy[node];
}
lazy[node] = 0;
}
return;
}
void update(ll node, ll b, ll e, ll l, ll r)
{
push(node, b, e);
if(b>r || e<l) return;
if(b>=l && e<=r)
{
lazy[node]++;
push(node, b, e);
return;
}
ll mid = (b+e)>>1;
ll left = node<<1;
ll right = left|1;
update(left, b, mid, l, r);
update(right, mid+1, e, l, r);
tree[node] = tree[left]+tree[right];
}
ll query(ll node, ll b, ll e, ll pos)
{
push(node, b, e);
if(b>pos || e<pos) return 0;
if(b>=pos && e<=pos) return tree[node];
ll mid = (b+e)>>1;
ll left = node<<1;
ll right = left|1;
return query(left, b, mid, pos)+query(right, mid+1, e, pos);
}
ll get(ll pos)
{
return query(1, 1, n, pos);
}
int main()
{
sf("%d%lld", &n, &m);

for(ll i = 1; i <= n; i++) sf("%lld", &arr[i]);
sort(arr+1, arr+n+1);

while(m--)
{
char type;
cin >> type;

if(type=='F')
{
ll h, c;
sf("%lld%lld", &c, &h);

ll lo = 1, hi = n, pos = -1;
while(lo<=hi)
{
ll mid = (lo+hi)>>1;
if(arr[mid]+get(mid)>=h)
{
pos = mid;
hi = mid-1;
}
else
lo = mid+1;
}
if(pos==-1) continue;
ll last = pos+c-1;
last = min(last, n);
if(last==n || arr[last]+get(last)!=arr[last+1]+get(last+1)) update(1, 1, n, pos, last);
else
{
ll l = 0, r = n+1, val = arr[last]+get(last);
lo = 1, hi = n;
while(lo<=hi)
{
ll mid = (lo+hi)>>1;
if(arr[mid]+get(mid)<val)
{
lo = mid+1;
l = mid;
}
else hi = mid-1;
}
lo = 1, hi = n;
while(lo<=hi)
{
ll mid = (lo+hi)>>1;
if(arr[mid]+get(mid)>val)
{
r = mid;
hi = mid-1;
}
else lo = mid+1;
}
l++;
r--;
ll len = last-l+1;
update(1, 1, n, pos, l-1);
update(1, 1, n, r-len+1, r);

}
}
else
{
ll a, b;
sf("%lld%lld", &a, &b);

ll l = -1, r = -1, lo = 1, hi = n;

while(lo<=hi)
{
ll mid = (lo+hi)>>1;
if(arr[mid]+get(mid)>=a)
{
l = mid;
hi = mid-1;
}
else lo = mid+1;
}
if(l==-1)
{
pf("0\n");
continue;
}
lo = 1, hi = n;
while(lo<=hi)
{
ll mid = (lo+hi)>>1;
if(arr[mid]+get(mid)<=b)
{
r = mid;
lo = mid+1;
}
else hi = mid-1;
}
pf("%lld\n", r-l+1);
}
}
return 0;
}
```

### Compilation message

```grow.cpp: In function 'int main()':
grow.cpp:65:24: warning: format '%d' expects argument of type 'int*', but argument 2 has type 'll* {aka long long int*}' [-Wformat=]
sf("%d%lld", &n, &m);
~~    ^
grow.cpp:65:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
sf("%d%lld", &n, &m);
^
grow.cpp:67:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
for(ll i = 1; i <= n; i++) sf("%lld", &arr[i]);
^
grow.cpp:78:15: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
sf("%lld%lld", &c, &h);
^
grow.cpp:132:15: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
sf("%lld%lld", &a, &b);
^```

#### Subtask #1 0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 753 ms 5496 KB Output isn't correct
2 Halted 0 ms 0 KB -

#### Subtask #2 0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 384 KB Output is correct
2 Incorrect 25 ms 512 KB Output isn't correct
3 Halted 0 ms 0 KB -

#### Subtask #3 0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 527 ms 1040 KB Output isn't correct
2 Halted 0 ms 0 KB -

#### Subtask #4 0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 560 ms 1400 KB Output isn't correct
2 Halted 0 ms 0 KB -

#### Subtask #5 0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 659 ms 3092 KB Output isn't correct
2 Halted 0 ms 0 KB -

#### Subtask #6 0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 933 ms 5328 KB Output is correct
2 Execution timed out 1002 ms 5368 KB Time limit exceeded
3 Halted 0 ms 0 KB -

#### Subtask #7 0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 892 ms 5384 KB Output isn't correct
2 Halted 0 ms 0 KB -

#### Subtask #8 0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 977 ms 5352 KB Output is correct
2 Execution timed out 1033 ms 5404 KB Time limit exceeded
3 Halted 0 ms 0 KB -

#### Subtask #9 0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 935 ms 5444 KB Output isn't correct
2 Halted 0 ms 0 KB -

#### Subtask #10 0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1064 ms 5772 KB Time limit exceeded