# | User | Rating |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 167 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
5 | nor | 151 |
7 | atcoder_official | 147 |
8 | TheScrasse | 146 |
9 | Petr | 145 |
10 | pajenegod | 143 |
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 |
---|