# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 163 |
2 | cry | 161 |
3 | maomao90 | 160 |
4 | -is-this-fft- | 159 |
5 | awoo | 158 |
6 | atcoder_official | 157 |
7 | adamant | 155 |
8 | nor | 154 |
9 | maroonrk | 152 |
10 | Dominater069 | 148 |
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 |
---|