#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll n,m,D,x,ans;
set<tuple<ll,ll,ll> >s;
void add(ll v)
{
ll l=v,r=v,sz=1,L,R,SZ;
auto it=s.lower_bound({l,r,1ll});
if(it!=s.begin()){
it--;
tie(L,R,SZ)=*it;
if(l<=R+D){
l=min(l,L);
r=max(r,R);
sz+=SZ;
s.erase(it);
}
}
it=s.lower_bound({l,r,1ll});
if(it!=s.end()){
tie(L,R,SZ)=*it;
if(L<=r+D){
l=min(l,L);
r=max(r,R);
sz+=SZ;
s.erase(it);
}
}
s.insert({l,r,sz});
ans=max(ans,(sz-1)*D+1-(r-l+1));
return;
}
int main()
{
scanf("%lld%lld%lld",&n,&m,&D);
for(ll i=1;i<=n;++i){
scanf("%lld",&x);
add(x);
}
for(ll i=1;i<=m;++i){
scanf("%lld",&x);
add(x);
if(ans%2)printf("%.1lf ",ans/2.0);
else printf("%lld ",ans/2);
}
putchar(10);
return 0;
}
Compilation message
Main.cpp: In function 'int main()':
Main.cpp:36:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
36 | scanf("%lld%lld%lld",&n,&m,&D);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:38:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
38 | scanf("%lld",&x);
| ~~~~~^~~~~~~~~~~
Main.cpp:42:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
42 | scanf("%lld",&x);
| ~~~~~^~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
452 KB |
Output is correct |
4 |
Correct |
1 ms |
344 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
344 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
452 KB |
Output is correct |
4 |
Correct |
1 ms |
344 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
344 KB |
Output is correct |
9 |
Correct |
140 ms |
14484 KB |
Output is correct |
10 |
Correct |
30 ms |
2308 KB |
Output is correct |
11 |
Correct |
28 ms |
2132 KB |
Output is correct |
12 |
Correct |
35 ms |
2180 KB |
Output is correct |
13 |
Correct |
29 ms |
1824 KB |
Output is correct |
14 |
Correct |
82 ms |
12444 KB |
Output is correct |
15 |
Correct |
111 ms |
4692 KB |
Output is correct |
16 |
Correct |
29 ms |
2200 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
142 ms |
11128 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
142 ms |
11128 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |