I do not think that can be done because div 3 problems have a strict conditions (I do not know what is this conditions).

Not me bro #_#

this will be a new tourist age &_&

anther 4 gold meadls for china.

good luck for all ^_^

Welcome to syria bro ^_^.

we have one houre of power every 5 houre .

Because not anyone can write DIV 3 (I see that just MikeMirzayanov do this)

everyone is better than anyone ^_^

All The best ^_^

do you have more problems like this?

And believing in who tech you the algorithm ^_^

The place where farmer John built his farm ^_^

Just solve more and more problems. I think that this problems can help you to be better in dp :

https://codeforces.me/contest/1096/problem/D

https://codeforces.me/problemset/problem/474/D

https://codeforces.me/problemset/problem/429/B

https://codeforces.me/contest/118/problem/D

https://codeforces.me/contest/467/problem/C

https://codeforces.me/contest/1583/problem/C

https://codeforces.me/contest/1437/problem/C

https://codeforces.me/contest/1355/problem/C

https://codeforces.me/contest/466/problem/C

I think that I will be expert in this month &_&

some one has a gift and they see CP as game . I think that rainboy one of them and he is great person .

nice ^_^..me too.. what should it mean?

I serch for some one as rainboy and I see this user Dukkha ... and there way to write names is the same and one user in the same club sa_so_

ENTP here....who else ?

This must be stoped . I know some groups in telegram and I thik that it will be nice if telegram cut this groups &_&

I can teach you linear serch and you will be a great coder ( as me ) ^_^

USACO guide can help you to learn more topices.

nice problem for ioi type practice

did you solve the problem in O(n) ?

but also we can do the algorithm without set or queue

^_^

I'm just a Specialist &_&

and I will be the greatest ^_^

THNX ^_^

and the complex is O( C logC ) , or it will be change ? I could not implement editorial logic so can you sher your code ? THNX ^_^

Tourist is man !! He worked hard for years to be what he is... did not you? tourist

Thnx...What about your story?

When I was in 11 I started solve problems and I would be an informatice eng but now I will be a doctor but still doing CP.

5_ ioi work hard to get a medal in IOI but fail and become addicted to solve problems .

First you should make pair[N] such that p[index].first=max(b[i]-a[j],1LL) and p[index].second=i as this :

pair<ll,ll>p[N];
ll index=1;
for(ll i=1;i<=n;++i)
{
  for(ll j=1;j<=6;++j)
  {
    p[index].first=max(b[i]-a[j],1LL);
    p[index].second=i;
    ++index;
   }
}

after this you will run two pointers and you need to find the shortest subarray that we take n notes and p[r].first-p[l].first is smallest as:

ll l=1,r=1,ans=1e18,now=0;
vector<ll>vis(1000000,0);
while(r<index)
{
   if(vis[p[r].second]==0)
   {
     ++now;
   }
    ++vis[p[r].second];
    while(vis[p[l].seconde]>1)
    {
     --vis[p[l].seconde];
     ++l;
    }
 if(now==n)ans=min(ans,p[r].first-p[l].first);
++r;
}
     

^_^

We will always remember that Igor love Tanya and he wants to show his feelings and write a number on the fence opposite to Tanya's house ^_^

Fine , This means that the problem is in C++17 ?

python is slow and disorganized @_@

my computer is old too but of course is not gold &_&

did U submit code after change (AC code ) in C++20 ?

just iterative method ; I am good in lazy and rmq but when I need to use segment in tree I fail .

I had solved edu problem but The difficulty is to solve unstander problem %_%

THNX...I done with it but do U have a tutorials for segment tree on tree. it is hard to understand it using only codes &_&

I use debugger only if I had worked hard to find the worng in code but could not....sometimes debugger can not help and U need to write code again so in C++ U can not relies on debugger. another way to find wrong is to primt any char in some place of the code to know if it work just " cout<<"d1";" and know if the code worked from begin to this place .

I used to skip part of the long tutorials and this made a big problem for me... realy good plog ^_^

I think that the input in D2 is not easy to understand &_&

realy I could not understand the logic of your solution.. can you explain it plz ?

I just make for loop in powers of two 125988309

maby yes ^_^

I have a problem with segment code because it was written with templet can any one write it with out templet for me ?

THNX ^_^

code ::

124454690

I see this too many time ; sometimes it work when I change compiler but anther times if you change the structer you may get AC for example the arry is more fast than vector but for memset it with value may vectorv(n,0);

is more fast than

ll a[n]; memset(a,0,n);

anyway you should talk with problemseter or post a blog

sad it was a bitmask contest !! ^_^

I see this too but I get WR in test 2 ; so sad &_&

me too the rating is not every thing but always I be happy and fine when I solve problems and in make my rating good;

The time was 3hrs because the number of problems ; if it was 5 problems as it usually be it would be about 2hrs ; anyway it was amazing

oh guys I solved some problem in the last round which write by tourist and it was easy do not be nervous!!!

I cant submit my code after the contest too....I dont kike this sit