# | User | Rating |
---|---|---|
1 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
2 | adamant | 164 |
4 | TheScrasse | 159 |
4 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Iam learning Suffix array from this blog and trying to solve DISUBSTR — Distinct Substrings from spoj . Getting wrong answer for this code submission . Not able to figure out the mistake. Please help. Thanks
I used Mo's algo to solve this problem .
First compare function: It gives me wrong answer Submission1
bool comp(query &a,query &b)
{
int x=a.L/bsize;
int y=b.L/bsize;
if(x!=y)
return x<y;
if(x&1)
return (a.R > b.R);
else
return (a.R < b.R);
}
Second function : Gives me AC Submission2
bool comp(query &a,query &b)
{
int x=a.L/bsize;
int y=b.L/bsize;
if(x!=y)
return x<y;
else
return a.R < b.R;
}
First one is an optimisation,but not able to find why it gives wrong answer
Name |
---|